|
|
|
|
A new method for the bisymmetric minimum norm solution of the consistent matrix equations A1 XB1 = C1,A 2XB2= C2
|
|
|
|
|
|
|
|
نویسنده
|
liu a. ,chen g. ,zhang x.
|
|
منبع
|
journal of applied mathematics - 2013 - دوره : 2013 - شماره : 0
|
|
چکیده
|
We propose a new iterative method to find the bisymmetric minimum norm solution of a pair of consistent matrix equations a1 xb1 = 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). © 2013 aijing liu et al.
|
|
|
|
|
آدرس
|
department of mathematics,east china normal university,shanghai 200241,china,school of mathematical sciences,qufu normal university, China, department of mathematics,east china normal university, China, department of mathematics,east china normal university, China
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|