BiCR算法求解Sylvester矩阵方程组的Perhermitian解
The BiCR Algorithm for Solving the Perhermitian Solutions of Sylvester Matrix Equations
摘要: 对于给定的矩阵X∈Cn×n,如果SXS=SH,其中S是给定的反射矩阵,即SH=S,S2=I,则称矩阵X为perhermitian矩阵。本文提出一种用于求解Sylvester矩阵方程组的perhermitian解的双共轭残差(BiCR)算法,并且证明了该算法的收敛性。通过选择任意初始perhermitian矩阵,可以在有限步求解出Sylvester矩阵方程组的唯一最小范数perhermitian解。最后,我们给出了一些数值算例来验证该算法的有效性和可行性。
Abstract: For a given matrix X∈Cn×n , matrix X is said to be perhermitian if SXS=SH , where S is a given re-flection matrix, i.e., SH=S , S2=I . In this paper, we propose the Bi-Conjugate Residual (BiCR) algorithm for solving the perhermitian solutions of Sylvester matrix equations and prove the con-vergence of the algorithm. By choosing any initial perhermitian matrices, the unique mini-mum-norm perhermitian solutions of the Sylvester matrix equations can be solved in finite steps. Finally, we give some numerical examples to verify the validity and feasibility of the algorithm.
文章引用:唐孝伟, 李胜坤. BiCR算法求解Sylvester矩阵方程组的Perhermitian解[J]. 应用数学进展, 2023, 12(12): 4967-4986. https://doi.org/10.12677/AAM.2023.1212489

参考文献

[1] Petkov, P.H., Christov, N.D. and Konstantinov, M.M. (1991) Computational Methods for Linear Control Systems. Pren-tice-Hall, Hoboken, USA.
[2] Helmke, U. and Moore, J. (1996) Optimization and Dynamical Systems. Proceedings of the IEEE, 84, 907. [Google Scholar] [CrossRef
[3] 程云鹏, 张凯院, 徐仲. 矩阵论[M]. 第3版. 西安: 西北工业出版社, 2006.
[4] 张晓宁. 约束矩阵方程求解的交替投影算法及其在图像恢复中的应用[D]: [硕士学位论文]. 桂林: 桂林电子科技大学, 2015.
[5] 杨清宇, 马训鸣, 朱洪艳. 现代控制理论[M]. 西安: 西安交通大学出版社, 2013.
[6] 孙志忠, 袁慰平, 闻珍初. 数值分析[M]. 第3版. 南京: 东南大学出版社, 2010.
[7] Hu, D.Y. and Reichel, L. (1992) Krylov-Subspace Methods for the Sylvester Equation. Linear Algebra and Its Applications, 172, 283-313. [Google Scholar] [CrossRef
[8] El Guennouni, A., Jbilou, K. and Riquet, A.J. (2002) Block Krylov Subspace Methods for Solving Large Sylvester Equations. Numerical Algorithms, 29, 75-96. [Google Scholar] [CrossRef
[9] Beik, F.P.A. and Salkuyeh, D.K. (2011) On the Global Krylov Subspace Methods for Solving General Coupled Matrix Equations. Computers & Mathematics with Applications, 62, 4605-4613. [Google Scholar] [CrossRef
[10] Bouhamidi, A., Hached, M., Heyouni, M. and Jbi-lou, K. (2013) A Preconditioned Block Arnoldi Method for Large Sylvester Matrix Equations. Numerical Linear Algebra with Applications, 20, 208-219. [Google Scholar] [CrossRef
[11] Kaabi, A., Toutounian, F. and Kerayechian, A. (2006) Preconditioned Galerkin and Minimal Residual Methods for Solving Sylvester Equations. Applied Mathematics and Computation, 181, 1208-1214. [Google Scholar] [CrossRef
[12] 徐冬梅, 鲍亮, 蔡兆克. 预条件Krylov子空间法求解耦合Sylvester矩阵方程[J]. 华东理工大学学报(自然科学版), 2015, 41(6): 871-876.
[13] Dehghan, M. and Hajarian, M. (2008) An Iterative Algorithm for the Reflexive Solutions of the Generalized Coupled Sylvester Matrix Equations and Its Optimal Approximation. Applied Mathematics and Computation, 202, 571-588. [Google Scholar] [CrossRef
[14] Dehghan, M. and Hajarian, M. (2010) An Iterative Method for Solving the Generalized Coupled Sylvester Matrix Equations over Generalized Bisymmetric Matrices. Applied Mathe-matical Modelling, 34, 639-654. [Google Scholar] [CrossRef
[15] Dehghan, M. and Hajarian, M. (2010) The General Coupled Matrix Equations over Generalized Bisymmetric Matrices. Linear Algebra and Its Applications, 432, 1531-1552. [Google Scholar] [CrossRef
[16] Dehghan, M. and Hajarian, M. (2010) An Efficient Algorithm for Solving General Coupled Matrix Equations and Its Application. Mathematical and Computer Modelling, 51, 1118-1134. [Google Scholar] [CrossRef
[17] Lv, C.Q. and Ma, C.F. (2018) BCR Method for Solving General-ized Coupled Sylvester Equations over Centrosymmetric or Anti-Centrosymmetric Matrix. Computers & Mathematics with Applications, 75, 70-88. [Google Scholar] [CrossRef
[18] Hajarian, M. (2016) Symmetric Solutions of the Coupled Gener-alized Sylvester Matrix Equations via BCR Algorithm. Journal of the Franklin Institute, 353, 3233-3248. [Google Scholar] [CrossRef
[19] Yan, T.X. and Ma, C.F. (2020) The BCR Algorithms for Solving the Reflexive or Anti-Reflexive Solutions of Generalized Coupled Sylvester Matrix Equations. Journal of the Franklin Institute, 357, 12787-12807. [Google Scholar] [CrossRef
[20] Hill, R.D., Bates, R.G. and Waters, S.R. (1990) On Perhermit-ian Matrices. SIAM Journal on Matrix Analysis and Applications, 11, 173-179. [Google Scholar] [CrossRef
[21] Pressman, I.S. (1998) Matrices with Multiple Symmetry Properties: Applica-tions of Centrohermitian and Perhermitian Matrices. Linear Algebra and Its Applications, 284, 239-258. [Google Scholar] [CrossRef
[22] Wu, A.G. and Zhang, Y. (2017) Complex Conjugate Matrix Equations for Systems and Control. Springer, Singapore. [Google Scholar] [CrossRef
[23] Wu, A.G., Feng, G., Duan, G.R. and Wu, W.J. (2010) Iterative Solutions to Coupled Sylvester-Conjugate Matrix Equations. Computers & Mathematics with Applications, 60, 54-66. [Google Scholar] [CrossRef
[24] Liang, K. and Liu, J. (2011) Iterative Algorithms for the Mini-mum-Norm Solution and the Least-Squares Solution of the Linear Matrix Equations , . Applied Mathematics and Computation, 218, 3166-3175. [Google Scholar] [CrossRef
[25] Peng, Y.X., Hu, X.Y. and Zhang, L. (2005) An Iteration Method for the Symmetric Solutions and the Optimal Approximation Solution of the Matrix Equation . Applied Math-ematics and Computation, 160, 763-777. [Google Scholar] [CrossRef
[26] Peng, Z.Y., Wang, L. and Peng, J.J. (2012) The Solutions of Ma-trix Equation over a Matrix Inequality Constraint. SIAM Journal on Matrix Analysis and Applications, 33, 554-568. [Google Scholar] [CrossRef