An Iterative Method for the Symmetric Arrowhead Solution of Matrix Equation
چکیده
In this paper, according to the classical algorithm LSQR for solving the least-squares problem, an iterative method is proposed for least-squares solution of constrained matrix equation. By using the Kronecker product, the matrix-form LSQR is presented to obtain the like-minimum norm and minimum norm solutions in a constrained matrix set for the symmetric arrowhead matrices. Finally, numerical examples are also given to investigate the performance. Keywords—Symmetric arrowhead matrix, iterative method, like-minimum norm, minimum norm, Algorithm LSQR.