A new method for the bisymmetric minimum norm solution of the consistent matrix equations \(A_1XB_1 = C_1\), \(A_2XB_2 = C_2\) (Q2375407)

Summary: We propose a new iterative method to find the bisymmetric minimum norm solution of a pair of consistent matrix equations \(A_1XB_1 = C_1\), \(A_2XB_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 \textit{J. Cai} et al. [Int. J. Comput. Math. 87, No. 12, 2706--2715 (2010; Zbl 1202.65052)].