A note on “A new iteration method for the matrix equation AX=B”

摘要

In this note we point out that the iteration method proposed by Guo et al. (2007) [K. Guo, X. Hu, L. Zhang, A new iteration method for the matrix equation AX=B, Applied Mathematics and Computation 187 (2007) 1434–1441] is the steepest descent method with exact line search for some optimization problem. We also supplement a proof on the convergence of the iterative sequence generated by this method, which completes Theorem 2.2 in [2].