QMR: A quasi-minimal residual method for non-Hermitian linear systems
Publication:1180764
DOI10.1007/BF01385726zbMath0754.65034MaRDI QIDQ1180764
Noël M. Nachtigal, Roland W. Freund
Publication date: 27 June 1992
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133596
numerical experimentserror bounditerative methodsnumerical instabilitysparse linear systemsnon-Hermitian linear systemsbiconjugate gradient methodquasi-minimal residual methodLanczos biorthogonal method
Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Related Items (only showing first 100 items - show all)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the constrained Chebyshev approximation problem on ellipses
- The Tchebychev iteration for nonsymmetric linear systems
- 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
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Sparse matrix test problems
- The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric 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
- Solution of Sparse Indefinite Systems of Linear Equations
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- Methods of conjugate gradients for solving linear systems
This page was built for publication: QMR: A quasi-minimal residual method for non-Hermitian linear systems