New approaches for solving large Sylvester equations
From MaRDI portal
Publication:2489155
DOI10.1016/j.amc.2005.02.063zbMath1089.65038OpenAlexW2054743364MaRDI QIDQ2489155
Davod Khojasteh Salkuyeh, Faezeh Toutounian
Publication date: 16 May 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2005.02.063
numerical examplesGMRESfull orthogonal methodgeneralized minimal residual algorithmslarge Sylvester matrix equationsmodified global Arnoldi algorithm
Related Items
Solving linearly constrained matrix least squares problem by LSQR ⋮ Nested splitting conjugate gradient method for matrix equation \(AXB=C\) and preconditioning ⋮ A new approximate inverse preconditioner based on the Vaidya’s maximum spanning tree for matrix equation AXB = C ⋮ Nested splitting CG-like iterative method for solving the continuous Sylvester equation and preconditioning ⋮ The incomplete global GMERR algorithm for solving Sylvester equation ⋮ On the global Krylov subspace methods for solving general coupled matrix equations ⋮ Weighted versions of Gl-FOM and Gl-GMRES for solving general coupled linear matrix equations ⋮ A modified gradient based algorithm for solving Sylvester equations ⋮ New convergence results on the global GMRES method for diagonalizable matrices ⋮ Global symplectic Lanczos method with application to matrix exponential approximation ⋮ The relaxed gradient based iterative algorithm for the symmetric (skew symmetric) solution of the Sylvester equation \(A X + X B = C\) ⋮ An iterative method for solving the continuous sylvester equation by emphasizing on the skew-hermitian parts of the coefficient matrices ⋮ The right–left preconditioning technique for the solution of the large matrix equationAXB = C ⋮ A global variant of the COCR method for the complex symmetric Sylvester matrix equation \(AX+XB=C\) ⋮ The general coupled linear matrix equations with conjugate and transpose unknowns over the mixed groups of generalized reflexive and anti-reflexive matrices ⋮ The coupled Sylvester-transpose matrix equations over generalized centro-symmetric matrices ⋮ A finite iterative algorithm for Hermitian reflexive and skew-Hermitian solution groups of the general coupled linear matrix equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Global FOM and GMRES algorithms for matrix equations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- A Hessenberg-Schur method for the problem AX + XB= C
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
- Block Krylov subspace methods for solving large Sylvester equations
