Numerical solution of singular Sylvester equations

被引:3
作者
Chu, Eric K. -W. [1 ]
Hou, Liangshao [2 ]
Szyld, Daniel B. [3 ]
Zhou, Jieyong [4 ]
机构
[1] Monash Univ, Sch Math, 9 Rainforest Walk, Melbourne, Vic 3800, Australia
[2] Hong Kong Baptist Univ, Dept Math, Hong Kong, Peoples R China
[3] Temple Univ, Dept Math, 1805 N Broad St, Philadelphia, PA 19122 USA
[4] Shanghai Univ Finance & Econ, Math Sch, Shanghai Key Lab Financial Informat Technol, Shanghai 200433, Peoples R China
关键词
Krylov subspace; Least squares solution; Lyapunov equation; Projection method; Singular equation; Sylvester equation; MINIMAL RESIDUAL METHODS; CAYLEY-HAMILTON THEOREM; KRYLOV SUBSPACE METHODS; LOW-RANK METHODS; APPROXIMATE SOLUTION; GENERALIZED CAYLEY; MATRIX; LYAPUNOV; ALGORITHMS; SPACES;
D O I
10.1016/j.cam.2023.115426
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We consider the numerical solution of the large scale singular Sylvester equation of the form AX - XD inverted perpendicular = E (or AXB inverted perpendicular inverted perpendicular - CXD inverted perpendicular inverted perpendicular = E ), where the spectra Lambda(A) A ) and Lambda(D) D ) (or, Lambda(A A - lambda C) C ) and Lambda(D D - lambda B)) B )) have a nonempty intersection. Using appropriate invariant subspaces, the singular Sylvester equation is rewritten as four Sylvester equations, three of which are nonsingular and one singular. When the invariant subspaces are small, so are three of the equations (including the singular one) which can be solved efficiently. The fourth is large but nonsingular with structures and may be solved using the projection method with Krylov subspaces or techniques involving hierarchical matrices. Some numerical examples for the subspace method are provided. Crown Copyright (c) 2023 Published by Elsevier B.V. All rights reserved.
引用
收藏
页数:17
相关论文
共 62 条
[31]   PERTURBATION-THEORY AND BACKWARD ERROR FOR AX-XB=C [J].
HIGHAM, NJ .
BIT NUMERICAL MATHEMATICS, 1993, 33 (01) :124-136
[32]  
Hochstenbach ME, 2011, ELECTRON T NUMER ANA, V38, P98
[33]   Least-squares approximate solution of overdetermined Sylvester equations [J].
Hodel, AS ;
Misra, P .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1997, 18 (02) :279-290
[34]   Global FOM and GMRES algorithms for matrix equations [J].
Jbilou, K ;
Messaoudi, A ;
Sadok, H .
APPLIED NUMERICAL MATHEMATICS, 1999, 31 (01) :49-63
[35]   Preconditioned Galerkin and minimal residual methods for solving Sylvester equations [J].
Kaabi, A. ;
Toutounian, F. ;
Kerayechian, A. .
APPLIED MATHEMATICS AND COMPUTATION, 2006, 181 (02) :1208-1214
[36]   Approximate inverse preconditioner by computing approximate solution of Sylvester equation [J].
Kaebi, A ;
Kerayechian, A ;
Toutounian, F .
APPLIED MATHEMATICS AND COMPUTATION, 2005, 170 (02) :1067-1076
[37]   Approximated least-squares solutions of a generalized Sylvester-transpose matrix equation via gradient-descent iterative algorithm [J].
Kittisopaporn, Adisorn ;
Chansangiam, Pattrawut .
ADVANCES IN DIFFERENCE EQUATIONS, 2021, 2021 (01)
[38]   Convergence analysis of the extended Krylov subspace method for the Lyapunov equation [J].
Knizhnerman, L. ;
Simoncini, V. .
NUMERISCHE MATHEMATIK, 2011, 118 (03) :567-586
[39]   Truncated low-rank methods for solving general linear matrix equations [J].
Kressner, Daniel ;
Sirkovic, Petar .
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2015, 22 (03) :564-583
[40]   LOW-RANK TENSOR KRYLOV SUBSPACE METHODS FOR PARAMETRIZED LINEAR SYSTEMS [J].
Kressner, Daniel ;
Tobler, Christine .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2011, 32 (04) :1288-1316