New convergence results on the global GMRES method for diagonalizable matrices
From MaRDI portal
Publication:935792
DOI10.1016/j.cam.2007.09.016zbMath1196.65068OpenAlexW2094437101MaRDI QIDQ935792
Khalide Jbilou, Hassane Sadok, Mohammed Bellalij
Publication date: 8 August 2008
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2007.09.016
Related Items
The distance of an eigenvector to a Krylov subspace and the convergence of the Arnoldi method for eigenvalue problems ⋮ Global GPBiCG method for complex non-Hermitian linear systems with multiple right-hand sides ⋮ An extended-rational Arnoldi method for large matrix exponential evaluations ⋮ Preconditioned global GPBiCG method for solving saddle point problems with multiple right-hand sides and its convergence analysis ⋮ Deflated and augmented global Krylov subspace methods for the matrix equations ⋮ A block preconditioner for the Gl-LSMR algorithm ⋮ Weighted and flexible versions of block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides ⋮ On investigating GMRES convergence using unitary matrices ⋮ A new family of global methods for linear systems with multiple right-hand sides ⋮ The block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides ⋮ Generalized global conjugate gradient squared algorithm ⋮ The role eigenvalues play in forming GMRES residual norms with non-normal matrices ⋮ Regularized preconditioned GMRES and the regularized iteration method ⋮ Preconditioned global Krylov subspace methods for solving saddle point problems with multiple right-hand sides ⋮ Preconditioned Krylov subspace and GMRHSS iteration methods for solving the nonsymmetric saddle point problems ⋮ Extended nonsymmetric global Lanczos method for matrix function approximation ⋮ The symmetric solutions of the matrix inequalityAX≥Bin least-squares sense ⋮ Global LSMR(Gl-LSMR) method for solving general linear systems with several right-hand sides
Cites Work
- Unnamed Item
- Analysis of some Krylov subspace methods for normal matrices via approximation theory and convex optimization
- Exact and inexact breakdowns in the block GMRES method
- Matrix Krylov subspace methods for large scale model reduction problems
- Global FOM and GMRES algorithms for matrix equations
- On block minimal residual methods
- New approaches for solving large Sylvester equations
- Projection methods for large Lyapunov matrix equations
- Convergence properties of some block Krylov subspace methods for multiple linear systems
- Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations
- Analysis of the convergence of the minimal and the orthogonal residual methods
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
