The DEFLATED-GMRES(m,k) method with switching the restart frequency dynamically
DOI<569::AID-NLA213>3.0.CO;2-8 10.1002/1099-1506(200010/12)7:7/8<569::AID-NLA213>3.0.CO;2-8zbMath1051.65037OpenAlexW2062477148MaRDI QIDQ4814499
Publication date: 7 September 2004
Full work available at URL: https://doi.org/10.1002/1099-1506(200010/12)7:7/8<569::aid-nla213>3.0.co;2-8
algorithmconvergencenumerical examplespreconditioningArnoldi processKrylov subspace techniquesautomatic restartdeflated-GMRES
Boundary value problems for second-order elliptic equations (35J25) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Finite difference methods for boundary value problems involving PDEs (65N06)
Related Items (7)
Uses Software
Cites Work
- Unnamed Item
- Restarted GMRES preconditioned by deflation
- Implementation of the GMRES Method Using Householder Transformations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Lanczos Methods for the Solution of Nonsymmetric Systems of Linear Equations
- Adaptively Preconditioned GMRES Algorithms
- Parallel Preconditioning with Sparse Approximate Inverses
- A Restarted GMRES Method Augmented with Eigenvectors
- A simpler GMRES
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
This page was built for publication: The DEFLATED-GMRES(m,k) method with switching the restart frequency dynamically