Restarted block-GMRES with deflation of eigenvalues

DOI10.1016/j.apnum.2004.09.028zbMath1074.65043OpenAlexW1970821534MaRDI QIDQ557941

Ronald B. Morgan

Publication date: 30 June 2005

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apnum.2004.09.028

zbMATH Keywords

comparison of methodsiterative methodsGMRESgeneralized minimal residual methodBlock methodsquasi-minimal residual methodrestarts

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items

A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity, Global simpler GMRES for nonsymmetric systems with multiple right-hand sides, A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems, Restarted block Lanczos bidiagonalization methods, A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems, A new shifted block GMRES method with inexact breakdowns for solving multi-shifted and multiple right-hand sides linear systems, A survey of subspace recycling iterative methods, A shifted block FOM algorithm with deflated restarting for matrix exponential computations, Deflated and restarted Krylov subspace methods for Sylvester tensor equations, A flexible and adaptive simpler GMRES with deflated restarting for shifted linear systems, GMRES algorithms over 35 years, Memory efficient hybrid algebraic solvers for linear systems arising from compressible flows, On the block GMRES method with deflated restarting, A new family of global methods for linear systems with multiple right-hand sides, Two new variants of the simpler block GMRES method with vector deflation and eigenvalue deflation for multiple linear systems, A deflated conjugate gradient method for multiple right hand sides and multiple shifts, A dynamically deflated GMRES adjoint solver for aerodynamic shape optimization, Augmented block Householder Arnoldi method, Deflated GMRES for systems with multiple shifts and multiple right-hand sides, Unnamed Item, A flexible and adaptive simpler block GMRES with deflated restarting for linear systems with multiple right-hand sides, Deflated block Krylov subspace methods for large scale eigenvalue problems, Fast inexact subspace iteration for generalized eigenvalue problems with spectral transformation, Generalized global conjugate gradient squared algorithm, 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, A new deflated block GCROT(\(m,k\)) method for the solution of linear systems with multiple right-hand sides, A note on the adaptive simpler block GMRES method, Projections, Deflation, and Multigrid for Nonsymmetric Matrices, Sparse approximate inverse preconditioning of deflated block-GMRES algorithm for the fast monostatic RCS calculation, A new projected variant of the deflated block conjugate gradient method, Block Gram-Schmidt algorithms and their stability properties, Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations, The simpler block CMRH method for linear systems, 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 novel class of block methods based on the blockAA^T-Lanczos bi-orthogonalization process for matrix equations, A simpler GMRES and its adaptive variant for shifted linear systems, Global LSMR(Gl-LSMR) method for solving general linear systems with several right-hand sides

Uses Software

• eigs
• Harwell-Boeing sparse matrix collection
• IRAM
• ABLE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
• Computing interior eigenvalues of large matrices
• An iterative solution method for solving \(f(A)x=b\), using Krylov subspace information obtained for the symmetric positive definite matrix A
• The block conjugate gradient algorithm and related methods
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
• The superlinear convergence behaviour of GMRES
• Implicitly restarted and deflated GMRES
• A block GMRES method augmented with eigenvectors
• Restarted GMRES preconditioned by deflation
• Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
• A Krylov--Schur Algorithm for Large Eigenproblems
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Sparse matrix test problems
• 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
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Adaptively Preconditioned GMRES Algorithms
• Truncation Strategies for Optimal Krylov Subspace Methods
• Analysis of Augmented Krylov Subspace Methods
• Analysis of Projection Methods for Solving Linear Systems with Multiple Right-Hand Sides
• Deflated and Augmented Krylov Subspace Techniques
• A Lanczos-type method for multiple starting vectors
• Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
• An Augmented Conjugate Gradient Method for Solving Consecutive Symmetric Positive Definite Linear Systems
• A Deflated Version of the Conjugate Gradient Algorithm
• ABLE: An Adaptive Block Lanczos Method for Non-Hermitian Eigenvalue Problems
• Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
• On the Lanczos Method for Solving Symmetric Linear Systems with Several Right-Hand Sides
• GMRES with Deflated Restarting
• Eigenvalue translation based preconditioners for the GMRES(k) method
• An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
• Approximate solutions and eigenvalue bounds from Krylov subspaces
• Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme
• A Restarted GMRES Method Augmented with Eigenvectors
• On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
• Harmonic projection methods for large non-symmetric eigenvalue problems
• A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems