On the Occurrence of Superlinear Convergence of Exact and Inexact Krylov Subspace Methods
From MaRDI portal
Publication:5317151
DOI10.1137/S0036144503424439zbMATH Open1079.65034WikidataQ115156458 ScholiaQ115156458MaRDI QIDQ5317151FDOQ5317151
Authors: Valeria Simoncini, Daniel B. Szyld 
Publication date: 16 September 2005
Published in: SIAM Review (Search for Journal in Brave)
Recommendations
- Superlinear convergence of Krylov subspace methods for self-adjoint problems in Hilbert space
- Convergence of Restarted Krylov Subspaces to Invariant Subspaces
- Discrete orthogonal polynomials and superlinear convergence of Krylov subspace methods in numerical linear algebra
- Convergence analysis of Krylov subspace methods
- Geometric aspects of the theory of Krylov subspace methods
Krylov subspace methodsnumerical examplesgeneralized minimal residual methodsuperlinear convergenceconjugate gradientsiterations
Cited In (33)
- Krylov subspace recycling for sequences of shifted linear systems
- Exploiting spatial symmetries for solving Poisson's equation
- On the field of values of oblique projections
- A convergence analysis of the MINRES method for some Hermitian indefinite systems
- Robust Superlinear Krylov Convergence for Complex Noncoercive Compact-Equivalent Operator Preconditioners
- Preconditioning Methods for Thin Scattering Structures Based on Asymptotic Results
- A posteriori superlinear convergence bounds for block conjugate gradient
- Superlinear convergence using block preconditioners for the real system formulation of complex Helmholtz equations
- Krylov solvability under perturbations of abstract inverse linear problems
- Superlinear convergence of Krylov subspace methods for self-adjoint problems in Hilbert space
- The many proofs of an identity on the norm of oblique projections
- The numerical stability analysis of pipelined conjugate gradient methods: historical context and methodology
- A survey of subspace recycling iterative methods
- Discrete orthogonal polynomials and superlinear convergence of Krylov subspace methods in numerical linear algebra
- A note on the mesh independence of convergence bounds for additive Schwarz preconditioned GMRES
- Some observations on weighted GMRES
- One-step convergence of inexact Anderson acceleration for contractive and non-contractive mappings
- An efficient Newton-Krylov implementation of the constrained runs scheme for initializing on a slow manifold
- Accelerate weighted GMRES by augmenting error approximations
- Superlinear convergence in minimum residual iterations
- Analysis and parallel implementation of a forced \(N\)-body problem
- The effect of non-optimal bases on the convergence of Krylov subspace methods
- An accelerated subspaces recycling strategy for the deflation of parametric linear systems based on model order reduction
- Block preconditioners for finite element discretization of incompressible flow with thermal convection.
- Any admissible cycle-convergence behavior is possible for restarted GMRES at its initial cycles.
- The deflated conjugate gradient method: convergence, perturbation and accuracy
- Adaptive multilevel Krylov methods
- Direct methods and ADI‐preconditioned Krylov subspace methods for generalized Lyapunov equations
- GMRES with multiple preconditioners
- GMRES algorithms over 35 years
- A minimum residual algorithm for solving linear systems
- Convergence of Restarted Krylov Subspaces to Invariant Subspaces
- Some properties of the Arnoldi-based methods for linear ill-posed problems
Uses Software
This page was built for publication: On the Occurrence of Superlinear Convergence of Exact and Inexact Krylov Subspace Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317151)
