A linear system solver based on a modified Krylov subspace method for breakdown recovery
From MaRDI portal
Publication:1921331
DOI10.1007/BF02141750zbMath0858.65034MaRDI QIDQ1921331
Publication date: 11 August 1996
Published in: Numerical Algorithms (Search for Journal in Brave)
algorithm; convergence; numerical results; Krylov subspace method; nonsymmetric linear systems; breakdown recovery; Lanczos' biorthogonalization method; MLAN/QM algorithm; residual quasi-minimization
65F10: Iterative numerical methods for linear systems
Related Items
The matrix and polynomial approaches to Lanczos-type algorithms, A review of formal orthogonality in Lanczos-based methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Avoiding breakdown in the CGS algorithm
- Nonsymmetric Lanczos and finding orthogonal polynomials associated with indefinite weights
- Avoiding breakdown and near-breakdown in Lanczos type algorithms
- Matrix interpretations and applications of the continued fraction algorithm
- Lanczos-type algorithms for solving systems of linear equations
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Sparse matrix test problems
- Reduction to Tridiagonal Form and Minimal Realizations
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
- Lanczos Methods for the Solution of Nonsymmetric Systems of Linear Equations
- A Breakdown-Free Variation of the Nonsymmetric Lanczos Algorithms
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
- Low-Rank Modification of the Unsymmetric Lanczos Algorithm
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
