GMRES algorithms over 35 years

DOI10.1016/j.amc.2023.127869OpenAlexW4317951399MaRDI QIDQ2698151

Qinmeng Zou

Publication date: 21 April 2023

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.04017

zbMATH Keywords

linear systemspreconditioningparallel computingGram-Schmidtmixed precision

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Uses Software

• GMRES
• DQGMRES
• CMRH
• DGMRES
• TRLan
• Eigtool
• Anderson
• LSODA

Cites Work

• Any Ritz Value Behavior Is Possible for Arnoldi and for GMRES
• Hiding Global Communication Latency in the GMRES Algorithm on Massively Parallel Machines
• Solving Ill-Posed Linear Systems with GMRES and a Singular Preconditioner
• TT-GMRES: solution to a linear system in the structured tensor format
• Computable Convergence Bounds for GMRES
• Krylov Methods for Nonsymmetric Linear Systems
• Structure Preserving Quaternion Generalized Minimal Residual Method
• On the cost of iterative computations
• Rounding Error Analysis of Mixed Precision Block Householder QR Algorithms
• Iterative methods for linear systems of equations: A brief historical journey
• Proxy-GMRES: Preconditioning via GMRES in Polynomial Space
• Admissible and Attainable Convergence Behavior of Block Arnoldi and GMRES
• Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM
• Squeezing a Matrix into Half Precision, with an Application to Solving Linear Systems
• A GMRES Convergence Analysis for Localized Invariant Subspace Ill-Conditioning
• Enlarged GMRES for solving linear systems with one or multiple right-hand sides
• Block Modified Gram--Schmidt Algorithms and Their Analysis
• Block GMRES Method with Inexact Breakdowns and Deflated Restarting
• Preconditioning
• A Flexible Inner-Outer Preconditioned GMRES Algorithm
• On the Occurrence of Superlinear Convergence of Exact and Inexact Krylov Subspace Methods
• Inexact Matrix-Vector Products in Krylov Methods for Solving Linear Systems: A Relaxation Strategy
• A Technique for Accelerating the Convergence of Restarted GMRES
• Breakdown-free GMRES for Singular Systems
• An Iterative Least-Square Method Suitable for Solving Large Sparse Matrices
• Multipreconditioned Gmres for Shifted Systems
• Weighted Inner Products for GMRES and GMRES-DR
• A projection method to solve linear systems in tensor format
• A Flexible Krylov Solver for Shifted Systems with Application to Oscillatory Hydraulic Tomography
• Properties of Worst-Case GMRES
• GMRES convergence bounds that depend on the right-hand-side vector
• Convergence in Backward Error of Relaxed GMRES
• Algorithm 842
• On computing givens rotations reliably and efficiently
• On Improving Linear Solver Performance: A Block Variant of GMRES
• Some Remarks on the Elman Estimate for GMRES
• Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES
• Iterative Refinement in Floating Point
• Solving linear least squares problems by Gram-Schmidt orthogonalization
• GMRES Convergence Analysis for a Convection-Diffusion Model Problem
• Accelerate weighted GMRES by augmenting error approximations
• A Theoretical Comparison of the Arnoldi and GMRES Algorithms
• The principle of minimized iterations in the solution of the matrix eigenvalue problem
• On Fixed-Point, Krylov, and $2\times 2$ Block Preconditioners for Nonsymmetric Problems
• Polynomial Preconditioned Arnoldi with Stability Control
• Stability of Linear GMRES Convergence with Respect to Compact Perturbations
• Low synchronization Gram–Schmidt and generalized minimal residual algorithms
• Randomized Gram--Schmidt Process with Application to GMRES
• Toward efficient polynomial preconditioning for GMRES
• Randomized numerical linear algebra: Foundations and algorithms
• DGMRES: A GMRES-type algorithm for Drazin-inverse solution of singular nonsymmetric linear systems
• Locally optimal and heavy ball GMRES methods
• Prescribing the behavior of early terminating GMRES and Arnoldi iterations
• GMRES implementations and residual smoothing techniques for solving ill-posed linear systems
• On the generation of Krylov subspace bases
• A new look at CMRH and its relation to GMRES
• Some observations on weighted GMRES
• Some properties of range restricted GMRES methods
• Applying GMRES to the Helmholtz equation with shifted Laplacian preconditioning: What is the largest shift for which wavenumber-independent convergence is guaranteed?
• Two recursive GMRES-type methods for shifted linear systems with general preconditioning
• Numerical range, GMRES and Faber polynomials.
• Restarted block-GMRES with deflation of eigenvalues
• On a non-stagnation condition for GMRES and application to saddle point matrices
• Evaluation of the performance of inexact GMRES
• On the residual norms, the Ritz values and the harmonic Ritz values that can be generated by restarted GMRES
• On the simplification of generalized conjugate-gradient methods for nonsymmetrizable linear systems
• The loss of orthogonality in the Gram-Schmidt orthogonalization process
• On worst-case GMRES, ideal GMRES, and the polynomial numerical hull of a Jordan block
• Some remarks on the restarted and augmented GMRES method
• Using FGMRES to obtain backward stability in mixed precision
• Adaptive version of simpler GMRES
• Exact and inexact breakdowns in the block GMRES method
• A note on the error analysis of classical Gram-Schmidt
• A new computational GMRES method
• New conditions for non-stagnation of minimal residual methods
• Deflated GMRES for systems with multiple shifts and multiple right-hand sides
• The block grade of a block Krylov space
• On a multilevel Krylov method for the Helmholtz equation preconditioned by shifted Laplacian
• Algebraic properties of the block GMRES and block Arnoldi methods
• The rate of convergence of conjugate gradients
• Extrapolation vs. projection methods for linear systems of equations
• Reduced storage matrix methods in stiff ODE systems
• Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor
• Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
• Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
• A comparison of some GMRES-like methods
• Fields of values and iterative methods
• Minimum residual methods for augmented systems
• Krylov sequences of maximal length and convergence of GMRES
• Weighted FOM and GMRES for solving nonsymmetric linear systems
• The superlinear convergence behaviour of GMRES
• A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations
• Implementations of the GMRES method
• Numerical behaviour of the modified Gram-Schmidt GMRES implementation
• Field-of-values analysis of preconditioned iterative methods for nonsymmetric elliptic problems
• The polynomial numerical hulls of Jordan blocks and related matrices.
• A fast implementation for GMRES method
• A continuation/GMRES method for fast computation of nonlinear receding horizon control
• GMRES-type methods for inconsistent systems
• Expressions and bounds for the GMRES residual
• Analysis of acceleration strategies for restarted minimal residual methods
• A convergence analysis of GMRES and FOM methods for Sylvester equations
• On the regularizing properties of the GMRES method
• Generalizations of the field of values useful in the study of polynomial functions of a matrix
• GMRES with multiple preconditioners
• Varying the \(s\) in your \(s\)-step GMRES
• On the convergence rate of DGMRES
• GMRES and the Arioli, Pták, and Strakoš parametrization
• Theoretical and numerical comparisons of GMRES and WZ-GMRES
• Some theoretical results derived from polynomial numerical hulls of Jordan blocks
• CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
• Global FOM and GMRES algorithms for matrix equations
• Implicitly restarted and deflated GMRES
• Accelerating with rank-one updates
• The worst-case GMRES for normal matrices
• A note on weighted FOM and GMRES for solving nonsymmetric linear systems
• A block GMRES method augmented with eigenvectors
• Preconditioning techniques for large linear systems: A survey
• Complete stagnation of GMRES
• A parallel implementation of the restarted GMRES iterative algorithm for nonsymmetric systems of linear equations
• A polynomial preconditioner for the GMRES algorithm
• New insights in GMRES-like methods with variable preconditioners
• Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers
• Numerical stability of GMRES
• Nested Krylov methods based on GCR
• Restarted GMRES preconditioned by deflation
• A parallel GMRES version for general sparse matrices
• Reorthogonalized block classical Gram-Schmidt
• Physics based GMRES preconditioner for compressible and incompressible Navier-Stokes equations
• Some uses of the field of values in numerical analysis
• On restarted and deflated block FOM and GMRES methods for sequences of shifted linear systems
• Block Gram-Schmidt algorithms and their stability properties
• Two new variants of the simpler block GMRES method with vector deflation and eigenvalue deflation for multiple linear systems
• Krylov type methods for linear systems exploiting properties of the quadratic numerical range
• Arnoldi decomposition, GMRES, and preconditioning for linear discrete ill-posed problems
• Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations
• A simple strategy for varying the restart parameter in GMRES\((m)\)
• A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
• Any admissible harmonic Ritz value set is possible for GMRES
• The complete stagnation of GMRES for \(n \leq 4\)
• Spectral deflation in Krylov solvers: a theory of coordinate space based methods
• On investigating GMRES convergence using unitary matrices
• On the choice of preconditioner for minimum residual methods for non-Hermitian matrices
• Necessary and sufficient conditions for GMRES complete and partial stagnation
• Parallelism and robustness in GMRES with a Newton basis and deflated restarting
• Krylov subspace recycling for sequences of shifted linear systems
• Rounding error analysis of the classical Gram-Schmidt orthogonalization process
• Convergence properties of some block Krylov subspace methods for multiple linear systems
• On the similarities between the quasi-Newton least squares method and GMRes
• On the asymptotic directions of the s-dimensional optimum gradient method
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence properties of block GMRES and matrix polynomials
• GMRES and the minimal polynomial
• Analysis of the convergence of the minimal and the orthogonal residual methods
• Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
• The Idea behind Krylov Methods
• Least Squares Residuals and Minimal Residual Methods
• Residual and Backward Error Bounds in Minimum Residual Krylov Subspace Methods
• Pipelined, Flexible Krylov Subspace Methods
• A Framework for Deflated and Augmented Krylov Subspace Methods
• GMRES Convergence for Perturbed Coefficient Matrices, with Application to Approximate Deflation Preconditioning
• A Modified Block Flexible GMRES Method with Deflation at Each Iteration for the Solution of Non-Hermitian Linear Systems with Multiple Right-Hand Sides
• Communication-optimal Parallel and Sequential QR and LU Factorizations
• Any admissible cycle-convergence behavior is possible for restarted GMRES at its initial cycles
• Flexible Variants of Block Restarted GMRES Methods with Application to Geophysics
• Gram-Schmidt orthogonalization: 100 years and more
• Pseudoeigenvector bases and deflated GMRES for highly nonnormal matrices
• The Coefficients of the FOM and GMRES Residual Polynomials
• Flexible GMRES with Deflated Restarting
• Numerical Methods for Large Eigenvalue Problems
• Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
• On the Similarities Between the Quasi-Newton Inverse Least Squares Method and GMRes
• The Cycle-Convergence of Restarted GMRES for Normal Matrices Is Sublinear
• GMRES Methods for Least Squares Problems
• Anderson Acceleration for Fixed-Point Iterations
• A comparison of preconditioned Krylov subspace methods for large‐scale nonsymmetric linear systems
• GMRES vs. Ideal GMRES
• GMRES On (Nearly) Singular Systems
• Computational Methods for Linear Matrix Equations
• The Stability of Block Variants of Classical Gram--Schmidt
• Recent computational developments in Krylov subspace methods for linear systems
• Augmented GMRES-type methods
• Geometric aspects of the theory of Krylov subspace methods
• Numerical solution of saddle point problems
• Polynomial Preconditioned GMRES and GMRES-DR
• Implementation of the GMRES Method Using Householder Transformations
• A Note on GMRES Preconditioned by a Perturbed $L D L^T$ Decomposition with Static Pivoting
• On Best Approximations of Polynomials in Matrices in the Matrix 2-Norm
• Recycling Krylov Subspaces for Sequences of Linear Systems
• Improving the Accuracy of GMRes with Deflated Restarting
• Multilevel Projection-Based Nested Krylov Iteration for Boundary Value Problems
• How to Make Simpler GMRES and GCR More Stable
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Extrapolation Methods for Vector Sequences
• Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
• Efficient High Accuracy Solutions with ${\text{GMRES}}(m)$
• How Fast are Nonsymmetric Matrix Iterations?
• A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
• Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
• Parallelizable restarted iterative methods for nonsymmetric linear systems. II: parallel implementation
• Solution of Sparse Indefinite Systems of Linear Equations
• Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
• Adaptively Preconditioned GMRES Algorithms
• Truncation Strategies for Optimal Krylov Subspace Methods
• Max-Min Properties of Matrix Factor Norms
• GMRES/CR and Arnoldi/Lanczos as Matrix Approximation Problems
• A Robust GMRES-Based Adaptive Polynomial Preconditioning Algorithm for Nonsymmetric Linear Systems
• A Newton basis GMRES implementation
• Analysis of Augmented Krylov Subspace Methods
• A Note on the Superlinear Convergence of GMRES
• Deflated and Augmented Krylov Subspace Techniques
• Restarted GMRES for Shifted Linear Systems
• Error Analysis of Krylov Methods In a Nutshell
• The Tortoise and the Hare Restart GMRES
• Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
• Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
• A block GMRES method with deflated restarting for solving linear systems with multiple shifts and multiple right‐hand sides
• On GMRES for Singular EP and GP Systems
• Shanks Sequence Transformations and Anderson Acceleration
• A New Analysis of Iterative Refinement and Its Application to Accurate Solution of Ill-Conditioned Sparse Linear Systems
• Accelerating the Solution of Linear Systems by Iterative Refinement in Three Precisions
• Inexact Krylov Subspace Methods for Linear Systems
• Convergence of GMRES for Tridiagonal Toeplitz Matrices
• Convergence analysis of Krylov subspace methods
• Communication lower bounds and optimal algorithms for numerical linear algebra
• Minimal Residual Method Stronger than Polynomial Preconditioning
• Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
• GMRES with Deflated Restarting
• Iterative Krylov Methods for Large Linear Systems
• The DEFLATED-GMRES(m,k) method with switching the restart frequency dynamically
• Eigenvalue translation based preconditioners for the GMRES(k) method
• An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
• A Restarted GMRES Method Augmented with Eigenvectors
• GMRESR: a family of nested GMRES methods
• On the convergence behavior of the restarted GMRES algorithm for solving nonsymmetric linear systems
• A simpler GMRES
• Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
• Any Nonincreasing Convergence Curve is Possible for GMRES