Open AccessA New Method for the Bisymmetric Minimum Norm Solution of the Consistent Matrix EquationsA 1 X B 1 = C 1 A 2 X B 2 = C 2
Author(s) -
Aijing Liu,
Guoliang Chen,
Xiangyun Zhang
Publication year - 2013
Publication title -
journal of applied mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.307
H-Index - 43
eISSN - 1687-0042
pISSN - 1110-757X
DOI - 10.1155/2013/125687
Subject(s) - algorithm , computer science
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 faster and more stable than Algorithm 2.1 by Cai et al. (2010)
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom