GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems
SIAM Journal on Scientific and Statistical Computing
Journal of Computational and Applied Mathematics
ACM Transactions on Mathematical Software (TOMS)
Implicit application of polynomial filters in a k-step Arnoldi method
SIAM Journal on Matrix Analysis and Applications
SIAM Journal on Scientific and Statistical Computing
Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
Journal of Computational and Applied Mathematics - Orthogonal polynomials and numerical methods
A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems
SIAM Journal on Scientific Computing
The superlinear convergence behaviour of GMRES
Journal of Computational and Applied Mathematics
An iterative method for nonsymmetric systems with multiple right-hand sides
SIAM Journal on Scientific Computing
SIAM Journal on Matrix Analysis and Applications
A Restarted GMRES Method Augmented with Eigenvectors
SIAM Journal on Matrix Analysis and Applications
On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
Mathematics of Computation
Restarted GMRES preconditioned by deflation
Journal of Computational and Applied Mathematics
Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
SIAM Journal on Matrix Analysis and Applications
Analysis of Augmented Krylov Subspace Methods
SIAM Journal on Matrix Analysis and Applications
Analysis of Projection Methods for Solving Linear Systems with Multiple Right-Hand Sides
SIAM Journal on Scientific Computing
The symmetric eigenvalue problem
The symmetric eigenvalue problem
Adaptively Preconditioned GMRES Algorithms
SIAM Journal on Scientific Computing
ABLE: An Adaptive Block Lanczos Method for Non-Hermitian Eigenvalue Problems
SIAM Journal on Matrix Analysis and Applications
A Deflated Version of the Conjugate Gradient Algorithm
SIAM Journal on Scientific Computing
Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
SIAM Journal on Matrix Analysis and Applications
SIAM Journal on Matrix Analysis and Applications
A Lanczos-type method for multiple starting vectors
Mathematics of Computation
A block GMRES method augmented with eigenvectors
Applied Mathematics and Computation
GMRES with Deflated Restarting
SIAM Journal on Scientific Computing
A Krylov--Schur Algorithm for Large Eigenproblems
SIAM Journal on Matrix Analysis and Applications
Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
SIAM Journal on Matrix Analysis and Applications
Truncation Strategies for Optimal Krylov Subspace Methods
SIAM Journal on Numerical Analysis
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
Applied Numerical Mathematics
Deflated block Krylov subspace methods for large scale eigenvalue problems
Journal of Computational and Applied Mathematics
A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
Computers & Mathematics with Applications
SIAM Journal on Scientific Computing
A new family of global methods for linear systems with multiple right-hand sides
Journal of Computational and Applied Mathematics
SIAM Journal on Scientific Computing
Flexible Variants of Block Restarted GMRES Methods with Application to Geophysics
SIAM Journal on Scientific Computing
Hi-index | 0.00 |
Block-GMRES is an iterative method for solving nonsymmetric systems of linear equations with multiple right-hand sides. Restarting may be needed, due to orthogonalization expense or limited storage. We discuss how restarting affects convergence and the role small eigenvalues play. Then a version of restarted block-GMRES that deflates eigenvalues is presented. It is demonstrated that deflation can be particularly important for block methods.