A unified approach to Krylov subspace methods for solving linear systems

DOI10.1007/s11075-023-01648-0OpenAlexW4387670152MaRDI QIDQ6126599

No author found.

Publication date: 9 April 2024

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-023-01648-0

zbMATH Keywords

convergencelinear systemsenhancementKrylov subspace methodsleft inverse

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of solutions to systems of equations (65H10) Iterative numerical methods for linear systems (65F10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new look at CMRH and its relation to GMRES
• On certain methods for expanding the characteristic polynomial
• The Gauss quadrature for general linear functionals, Lanczos algorithm, and minimal partial realization
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• Avoiding breakdown in the CGS algorithm
• On a variable smoothing procedure for Krylov subspace methods
• The matrix and polynomial approaches to Lanczos-type algorithms
• CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
• Generalized inverses. Theory and applications.
• A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Reduction to Tridiagonal Form and Minimal Realizations
• Lanczos Methods for the Solution of Nonsymmetric Systems of Linear Equations
• Iterative Krylov Methods for Large Linear Systems
• Krylov Methods for Nonsymmetric Linear Systems
• An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
• Some Applications of the Pseudoinverse of a Matrix
• Methods of conjugate gradients for solving linear systems
• An enhancement of the convergence of the IDR method