The effect of non-optimal bases on the convergence of Krylov subspace methods
From MaRDI portal
Publication:2501255
DOI10.1007/s00211-005-0603-8zbMath1118.65022OpenAlexW2169195255WikidataQ115156459 ScholiaQ115156459MaRDI QIDQ2501255
Daniel B. Szyld, Valeria Simoncini
Publication date: 4 September 2006
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-005-0603-8
Related Items
On the convergence of Q-OR and Q-MR Krylov methods for solving nonsymmetric linear systems, A new look at CMRH and its relation to GMRES, On the choice of preconditioner for minimum residual methods for non-Hermitian matrices, Low-rank updates of balanced incomplete factorization preconditioners, Algebraic multigrid preconditioners for the bidomain reaction-diffusion system, Recent computational developments in Krylov subspace methods for linear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Iterative methods for solving \(Ax=b\), GMRES/FOM versus QMR/BiCG
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- A matrix analysis of Arnoldi and Lanczos methods
- Numerical behaviour of the modified Gram-Schmidt GMRES implementation
- Peaks, plateaus, numerical instabilities in a Galerkin minimal residual pair of methods for solving \(Ax=b\)
- Arnoldi versus nonsymmetric Lanczos algorithms for solving matrix eigenvalue problems
- C. G. preconditioning for Toeplitz matrices
- On the Convergence of Restarted Krylov Subspace Methods
- Flexible Conjugate Gradients
- Least Squares Residuals and Minimal Residual Methods
- Residual and Backward Error Bounds in Minimum Residual Krylov Subspace Methods
- Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear Systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations
- Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient Matrices
- Preserving Symmetry in Preconditioned Krylov Subspace Methods
- Variable‐step multilevel preconditioning methods, I: Self‐adjoint and positive definite elliptic problems
- Error Analysis of Krylov Methods In a Nutshell
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
- Inexact Preconditioned Conjugate Gradient Method with Inner-Outer Iteration
- Convergence of GMRES for Tridiagonal Toeplitz Matrices
- Iterative Krylov Methods for Large Linear Systems
- Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
- On the Occurrence of Superlinear Convergence of Exact and Inexact Krylov Subspace Methods
