We propose a new iterative method to find the bisymmetric minimum norm solution of a pair of consistent matrix equations , . 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).
Aijing Liu. Guoliang Chen. Xiangyun Zhang. "A New Method for the Bisymmetric Minimum Norm Solution of the Consistent Matrix Equations , ." J. Appl. Math. 2013 1 - 6, 2013. https://doi.org/10.1155/2013/125687