Analysis of acceleration strategies for restarted minimal residual methods
From MaRDI portal
Publication:1591186
DOI10.1016/S0377-0427(00)00398-8zbMath0968.65016MaRDI QIDQ1591186
Oliver G. Ernst, Michael Eiermann, Olaf Schneider
Publication date: 2 September 2001
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
convergence acceleration; preconditioner; Ritz values; Arnoldi method; minimal residual methods; restarting; Krylov-subspace methods; optimal truncation
65F10: Iterative numerical methods for linear systems
Related Items
Accelerate weighted GMRES by augmenting error approximations, Two-level algebraic domain decomposition preconditioners using Jacobi-Schwarz smoother and adaptive coarse grid corrections, GMRES with adaptively deflated restarting and its performance on an electromagnetic cavity problem, Comparison of two-level preconditioners derived from deflation, domain decomposition and multigrid methods, The behavior of symmetric Krylov subspace methods for solving \(Mx=(M-\gamma I)v\)., A refined Arnoldi type method for large scale eigenvalue problems, A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity, Computational aspects of the stochastic finite element method, A simple strategy for varying the restart parameter in GMRES\((m)\), Any admissible cycle-convergence behavior is possible for restarted GMRES at its initial cycles, Usage of the convergence test of the residual norm in the Tsuno-Nodera version of the GMRES algorithm, Convergence conditions for a restarted GMRES method augmented with eigenspaces
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing interior eigenvalues of large matrices
- Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
- Nested Krylov methods based on GCR
- Restarted GMRES preconditioned by deflation
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
- Geometric aspects of the theory of Krylov subspace methods
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Solution of Sparse Indefinite Systems of Linear Equations
- Adaptively Preconditioned GMRES Algorithms
- Truncation Strategies for Optimal Krylov Subspace Methods
- Analysis of Augmented Krylov Subspace Methods
- Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
- Eigenvalue translation based preconditioners for the GMRES(k) method
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- A Restarted GMRES Method Augmented with Eigenvectors
- GMRESR: a family of nested GMRES methods
- On the roots of the orthogonal polynomials and residual polynomials associated with a conjugate gradient method
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
