A New Method for the Bisymmetric Minimum Norm Solution of the Consistent Matrix Equations A1XB1=C1, A2XB2=C2
We propose a new iterative method to find the bisymmetric minimum norm solution of a pair of consistent matrix equations A1XB1=C1, A2XB2=C2. The algorithm can obtain the bisymmetric solution with minimum Frobenius norm in finite iteration steps in the absence of round-off errors. Our algorithm is fa...
Saved in:
Main Authors: | Aijing Liu, Guoliang Chen, Xiangyun Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2013-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2013/125687 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
One-sided complements and solutions of the equation aXb=c in semirings
by: Sam L. Blyumin, et al.
Published: (2002-01-01) -
Two accelerated gradient-based iteration methods for solving the Sylvester matrix equation AX + XB = C
by: Huiling Wang, et al.
Published: (2024-12-01) -
Safety and efficacy of trifluridine/tipiracil +/− bevacizumab plus XB2001 (anti-IL-1α antibody): a single-center phase 1 trial
by: Marion Thibaudin, et al.
Published: (2025-01-01) -
Heterogeneous nuclear ribonucleoprotein C promotes non-small cell lung cancer progression by enhancing XB130 mRNA stability and translation
by: Qinrong Wang, et al.
Published: (2025-01-01) -
The Generalized Bisymmetric (Bi-Skew-Symmetric) Solutions of a Class of Matrix Equations and Its Least Squares Problem
by: Yifen Ke, et al.
Published: (2014-01-01)