A numerical method on the mixed solution of matrix equation ∑i=1tAiXiBi=E with sub-matrix constraints and its application

作者:

Highlights:

• In this paper, we proposed an algorithm to solve mixed solutions of the matrix Equation ∑i=1tAiXiBi=E with sub-matrix constraints. We also prove that the iterative solution sequence generated by the algorithm is convergent. Moreover, for a given matrix, its best approximation is obtained, which is the mixed solution of the matrix equation with sub-matrix constraints. Finally, a large number of numerical experiments are carried out, and results show that the algorithm is effective not only in image restoration, but also in the general case, for both small-scale and large-scale matrices. The work belongs to the field of numerical algebra, and has been widely concerned.

摘要

•In this paper, we proposed an algorithm to solve mixed solutions of the matrix Equation ∑i=1tAiXiBi=E with sub-matrix constraints. We also prove that the iterative solution sequence generated by the algorithm is convergent. Moreover, for a given matrix, its best approximation is obtained, which is the mixed solution of the matrix equation with sub-matrix constraints. Finally, a large number of numerical experiments are carried out, and results show that the algorithm is effective not only in image restoration, but also in the general case, for both small-scale and large-scale matrices. The work belongs to the field of numerical algebra, and has been widely concerned.

论文关键词:Gradient-like projection method,Centro-symmetric matrix,Bisymmetric matrix,Mixed solution

论文评审过程:Received 28 October 2020, Revised 2 March 2021, Accepted 14 June 2021, Available online 13 July 2021, Version of Record 13 July 2021.

论文官网地址:https://doi.org/10.1016/j.amc.2021.126460