The convergence of Krylov subspace methods for large unsymmetric linear systems
From MaRDI portal
Publication:4225456
DOI10.1007/BF02580408zbMath0921.65028MaRDI QIDQ4225456
Publication date: 29 September 1999
Published in: Acta Mathematica Sinica, English Series (Search for Journal in Brave)
Related Items (6)
Some observations on preconditioning for non-self-adjoint and time-dependent problems ⋮ Double sweep preconditioner for optimized Schwarz methods applied to the Helmholtz problem ⋮ Theoretical and numerical comparisons of GMRES and WZ-GMRES ⋮ Inexact block SSOR-like preconditioners for non-Hermitian positive definite linear systems of strong Hermitian parts ⋮ Sharp error bounds of some Krylov subspace methods for non-Hermitian linear systems ⋮ Some recursions on Arnoldi's method and IOM for large non-Hermitian linear systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chebyshev polynomials are not always optimal
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- The Tchebychev iteration for nonsymmetric linear systems
- On IGMRES: An incomplete generalized minimal residual method for large unsymmetric linear systems
- The superlinear convergence behaviour of GMRES
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
- A Comparison of the Successive Overrelaxation Method and Semi-Iterative Methods Using Chebyshev Polynomials
- Krylov Subspace Methods on Supercomputers
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- On IOM(q): The Incomplete Orthogonalization Method for Large Unsymmetric Linear Systems
- The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems
This page was built for publication: The convergence of Krylov subspace methods for large unsymmetric linear systems
