Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations

DOI10.1016/j.amc.2004.06.141zbMath1081.65038OpenAlexW2022393151MaRDI QIDQ2570769

Yi-Qin Lin

Publication date: 28 October 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2004.06.141

zbMATH Keywords

eigenmatrixGMRESglobal Arnoldi methodmatrix equationSylvester equationmultiple right-hand sidesmatrix Krylov subspace methodimplicit restartingfull orthogonal methodgeneralized minimal residual algorithmsharmonic Ritz values and Ritz vectors

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Iterative numerical methods for linear systems (65F10)

Related Items

Global GPBiCG method for complex non-Hermitian linear systems with multiple right-hand sides ⋮ Global simpler GMRES for nonsymmetric systems with multiple right-hand sides ⋮ On RGI algorithms for solving Sylvester tensor equations ⋮ Convergence analysis of gradient-based iterative algorithms for a class of rectangular Sylvester matrix equations based on Banach contraction principle ⋮ Direct global Lanczos method for large linear systems with multiple right-hand sides ⋮ 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 ⋮ On the block GMRES method with deflated restarting ⋮ A new family of global methods for linear systems with multiple right-hand sides ⋮ New convergence results on the global GMRES method for diagonalizable matrices ⋮ Minimal residual methods augmented with eigenvectors for solving Sylvester equations and generalized Sylvester equations ⋮ Global symplectic Lanczos method with application to matrix exponential approximation ⋮ The block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides ⋮ The relaxed gradient based iterative algorithm for the symmetric (skew symmetric) solution of the Sylvester equation \(A X + X B = C\) ⋮ A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems ⋮ Generalized global conjugate gradient squared algorithm ⋮ A global variant of the COCR method for the complex symmetric Sylvester matrix equation \(AX+XB=C\) ⋮ A flexible global GCRO-DR method for shifted linear systems and general coupled matrix equations ⋮ Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations ⋮ The symmetric solutions of the matrix inequalityAX≥Bin least-squares sense ⋮ A novel class of block methods based on the blockAA^T-Lanczos bi-orthogonalization process for matrix equations ⋮ Gradient-descent iterative algorithm for solving a class of linear matrix equations with applications to heat and Poisson equations ⋮ Global LSMR(Gl-LSMR) method for solving general linear systems with several right-hand sides

Uses Software

• eigs
• Harwell-Boeing sparse matrix collection
• IRAM

Cites Work

• Unnamed Item
• Global FOM and GMRES algorithms for matrix equations
• Sparse matrix test problems
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
• GMRES with Deflated Restarting
• A Restarted GMRES Method Augmented with Eigenvectors
• Harmonic projection methods for large non-symmetric eigenvalue problems