The effect of non-optimal bases on the convergence of Krylov subspace methods
From MaRDI portal
Publication:2501255
DOI10.1007/S00211-005-0603-8zbMATH Open1118.65022OpenAlexW2169195255WikidataQ115156459 ScholiaQ115156459MaRDI QIDQ2501255FDOQ2501255
Authors: 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
Recommendations
- scientific article; zbMATH DE number 1829268
- An optimal Q-OR Krylov subspace method for solving linear systems
- Truncation Strategies for Optimal Krylov Subspace Methods
- Sharp error bounds of some Krylov subspace methods for non-Hermitian linear systems
- Geometric aspects of the theory of Krylov subspace methods
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- C. G. preconditioning for Toeplitz matrices
- On the convergence of restarted Krylov subspace methods
- Title not available (Why is that?)
- Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
- Iterative methods for solving \(Ax=b\), GMRES/FOM versus QMR/BiCG
- Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient Matrices
- Least squares residuals and minimal residual methods
- Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear Systems
- Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- Inexact Preconditioned Conjugate Gradient Method with Inner-Outer Iteration
- Iterative Krylov Methods for Large Linear Systems
- Convergence of GMRES for Tridiagonal Toeplitz Matrices
- On the Occurrence of Superlinear Convergence of Exact and Inexact Krylov Subspace Methods
- Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
- Numerical behaviour of the modified Gram-Schmidt GMRES implementation
- Flexible conjugate gradients
- Variable‐step multilevel preconditioning methods, I: Self‐adjoint and positive definite elliptic problems
- Arnoldi versus nonsymmetric Lanczos algorithms for solving matrix eigenvalue problems
- Error Analysis of Krylov Methods In a Nutshell
- Peaks, plateaus, numerical instabilities in a Galerkin minimal residual pair of methods for solving \(Ax=b\)
- A matrix analysis of Arnoldi and Lanczos methods
- Preserving Symmetry in Preconditioned Krylov Subspace Methods
- Residual and backward error bounds in minimum residual Krylov subspace methods
Cited In (9)
- On the choice of preconditioner for minimum residual methods for non-Hermitian matrices
- Title not available (Why is that?)
- 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
- A sketch-and-select Arnoldi process
- Algebraic multigrid preconditioners for the bidomain reaction-diffusion system
- The effect of the spectral properties of the linear system matrix on the convergence of some Krylov methods
- Low-rank updates of balanced incomplete factorization preconditioners
- Recent computational developments in Krylov subspace methods for linear systems
Uses Software
This page was built for publication: The effect of non-optimal bases on the convergence of Krylov subspace methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2501255)
