Restarted block-GMRES with deflation of eigenvalues
From MaRDI portal
Block methods are an appropriate approach for systems of linear equations with multiple right-hand sides and fairly expensive matrix-vector products. Restarts of the block-generalized minimal residual (GMRES) method may be needed for the well-known reasons, but can induce a slow-down of the iteration. The small eigenvalues are often the reason and a version with deflated eigenvalues is suggested. The author states that it now competes with the block-quasi-minimal residual method.
Recommendations
- On the block GMRES method with deflated restarting
- A block GMRES method with deflated restarting for solving linear systems with multiple shifts and multiple right-hand sides.
- Block GMRES method with inexact breakdowns and deflated restarting
- GMRES with Deflated Restarting
- Restarted GMRES preconditioned by deflation
Cites work
- A block GMRES method augmented with eigenvectors
- A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
- A Deflated Version of the Conjugate Gradient Algorithm
- A Krylov--Schur algorithm for large eigenproblems
- A Lanczos-type method for multiple starting vectors
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- A Restarted GMRES Method Augmented with Eigenvectors
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
- ABLE: An Adaptive Block Lanczos Method for Non-Hermitian Eigenvalue Problems
- Adaptively Preconditioned GMRES Algorithms
- An Augmented Conjugate Gradient Method for Solving Consecutive Symmetric Positive Definite Linear Systems
- An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
- An iterative solution method for solving \(f(A)x=b\), using Krylov subspace information obtained for the symmetric positive definite matrix A
- Analysis of Augmented Krylov Subspace Methods
- Analysis of Projection Methods for Solving Linear Systems with Multiple Right-Hand Sides
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Computing interior eigenvalues of large matrices
- Deflated and Augmented Krylov Subspace Techniques
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- Eigenvalue translation based preconditioners for the GMRES(k) method
- GMRES with Deflated Restarting
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Harmonic projection methods for large non-symmetric eigenvalue problems
- scientific article; zbMATH DE number 3633705 (Why is no real title available?)
- scientific article; zbMATH DE number 1406963 (Why is no real title available?)
- Implementation Aspects of Band Lanczos Algorithms for Computation of Eigenvalues of Large Sparse Symmetric Matrices
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Implicitly restarted and deflated GMRES
- Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
- Numerical methods for large eigenvalue problems
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- On the Lanczos Method for Solving Symmetric Linear Systems with Several Right-Hand Sides
- Parallel iterative methods for sparse linear systems
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
- Restarted GMRES preconditioned by deflation
- Sparse matrix test problems
- The block conjugate gradient algorithm and related methods
- The superlinear convergence behaviour of GMRES
- Thick-restart Lanczos method for large symmetric eigenvalue problems
- Truncation Strategies for Optimal Krylov Subspace Methods
- Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme
Cited in
(52)- A shifted block FOM algorithm with deflated restarting for matrix exponential computations
- A dynamically deflated GMRES adjoint solver for aerodynamic shape optimization
- Implicitly restarted and deflated GMRES
- A block GMRES method augmented with eigenvectors
- Restarted GMRES preconditioned by deflation
- Convergence and preconditioning of inexact inverse subspace iteration for generalized eigenvalue problems
- Numerical investigation of ensemble methods with block iterative solvers for evolution problems
- On restarted and deflated block FOM and GMRES methods for sequences of shifted linear systems
- Block Gram-Schmidt algorithms and their stability properties
- A flexible and adaptive simpler GMRES with deflated restarting for shifted linear systems
- Two new variants of the simpler block GMRES method with vector deflation and eigenvalue deflation for multiple linear systems
- A flexible and adaptive simpler block GMRES with deflated restarting for linear systems with multiple right-hand sides
- A note on the adaptive simpler block GMRES method
- A new projected variant of the deflated block conjugate gradient method
- Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations
- Global LSMR(Gl-LSMR) method for solving general linear systems with several right-hand sides
- A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
- A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems
- A new shifted block GMRES method with inexact breakdowns for solving multi-shifted and multiple right-hand sides linear systems
- Memory efficient hybrid algebraic solvers for linear systems arising from compressible flows
- GMRES algorithms over 35 years
- A novel class of block methods based on the block AA^T-Lanczos bi-orthogonalization process for matrix equations
- Flexible variants of block restarted GMRES methods with application to geophysics
- Global simpler GMRES for nonsymmetric systems with multiple right-hand sides
- Flexible GMRES with deflated restarting
- On applying weighted weed techniques to GMRES algorithm for solving multiple linear systems
- Improving the Accuracy of GMRes with Deflated Restarting
- Sparse approximate inverse preconditioning of deflated block-GMRES algorithm for the fast monostatic RCS calculation
- GMRES with Deflated Restarting
- The DEFLATED-GMRES(m,k) method with switching the restart frequency dynamically
- A deflated conjugate gradient method for multiple right hand sides and multiple shifts
- Projections, deflation, and multigrid for nonsymmetric matrices
- Block GMRES method with inexact breakdowns and deflated restarting
- A simpler GMRES and its adaptive variant for shifted linear systems.
- Fast inexact subspace iteration for generalized eigenvalue problems with spectral transformation
- Improved seed methods for symmetric positive definite linear equations with multiple right-hand sides.
- Extending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides.
- A block minimum residual norm subspace solver with partial convergence management for sequences of linear systems
- A new deflated block GCROT(m,k) method for the solution of linear systems with multiple right-hand sides
- A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
- A survey of subspace recycling iterative methods
- Deflated and restarted Krylov subspace methods for Sylvester tensor equations
- On the block GMRES method with deflated restarting
- A new family of global methods for linear systems with multiple right-hand sides
- On applying deflation and flexible preconditioning to the adaptive simpler GMRES method for Sylvester tensor equations
- A new matrix feature selection strategy in machine learning models for certain Krylov solver prediction
- The simpler block CMRH method for linear systems
- Restarted block Lanczos bidiagonalization methods
- Augmented block Householder Arnoldi method
- Deflated GMRES for systems with multiple shifts and multiple right-hand sides
- Deflated block Krylov subspace methods for large scale eigenvalue problems
- Generalized global conjugate gradient squared algorithm
This page was built for publication: Restarted block-GMRES with deflation of eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557941)
