CG-type algorithms to solve symmetric matrix equations

DOI10.1016/j.amc.2005.03.003zbMath1104.65029MaRDI QIDQ2489397

Davod Khojasteh Salkuyeh

Publication date: 28 April 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.03.003

zbMATH Keywords

numerical examples; matrix equations; Krylov subspace method; multiple right-hand sides; symmetric linear systems; conjugate gradient type algorithms; Global FOM GMRES algorithms

Mathematics Subject Classification ID

65F10: Iterative numerical methods for linear systems

Related Items

A new family of global methods for linear systems with multiple right-hand sides, A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems, Generalized global conjugate gradient squared algorithm, Global SCD algorithm for real positive definite linear systems with multiple right-hand sides, The symmetric solutions of the matrix inequalityAX≥Bin least-squares sense

Uses Software

• Algorithm 432

Cites Work

• The block conjugate gradient algorithm and related methods
• 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
• An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
• Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
• Methods of conjugate gradients for solving linear systems
• Unnamed Item