科研之友
微信
新浪微博
Facebook
分享链接
摘要
We propose a new iterative method to find the bisymmetric minimum norm solution of a pair of consistent matrix equations A(1)XB(1) = C-1, A(2)XB(2) = C-2. 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).
