Recommendations
- GMRES methods for least squares problems
- Implementations of the GMRES method
- A new computational GMRES method
- A fast implementation for GMRES method
- scientific article; zbMATH DE number 1618000
- Generalizations and modifications of the GMRES iterative method
- scientific article; zbMATH DE number 440646
- A comparison of some GMRES-like methods
- GMRESR: a family of nested GMRES methods
- GMRES implementations and residual smoothing techniques for solving ill-posed linear systems
Cites work
- scientific article; zbMATH DE number 434716 (Why is no real title available?)
- scientific article; zbMATH DE number 19432 (Why is no real title available?)
- scientific article; zbMATH DE number 88927 (Why is no real title available?)
- scientific article; zbMATH DE number 1226273 (Why is no real title available?)
- scientific article; zbMATH DE number 556557 (Why is no real title available?)
- scientific article; zbMATH DE number 663835 (Why is no real title available?)
- scientific article; zbMATH DE number 1740439 (Why is no real title available?)
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 1406963 (Why is no real title available?)
- scientific article; zbMATH DE number 1406971 (Why is no real title available?)
- scientific article; zbMATH DE number 2212009 (Why is no real title available?)
- scientific article; zbMATH DE number 4187010 (Why is no real title available?)
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- A GMRES convergence analysis for localized invariant subspace ill-conditioning
- A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
- A Newton basis GMRES implementation
- A Note on GMRES Preconditioned by a Perturbed L D L^T Decomposition with Static Pivoting
- A Note on the Superlinear Convergence of GMRES
- A Restarted GMRES Method Augmented with Eigenvectors
- A Robust GMRES-Based Adaptive Polynomial Preconditioning Algorithm for Nonsymmetric Linear Systems
- A Technique for Accelerating the Convergence of Restarted GMRES
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
- A block GMRES method augmented with eigenvectors
- A block GMRES method with deflated restarting for solving linear systems with multiple shifts and multiple right-hand sides.
- A comparison of preconditioned Krylov subspace methods for large‐scale nonsymmetric linear systems
- A comparison of some GMRES-like methods
- A continuation/GMRES method for fast computation of nonlinear receding horizon control
- A convergence analysis of GMRES and FOM methods for Sylvester equations
- A fast implementation for GMRES method
- A flexible Krylov solver for shifted systems with application to oscillatory hydraulic tomography
- A framework for deflated and augmented Krylov subspace methods
- A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations
- A modified block flexible GMRES method with deflation at each iteration for the solution of non-Hermitian linear systems with multiple right-hand sides
- A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
- A new computational GMRES method
- A new look at CMRH and its relation to GMRES
- A note on the error analysis of classical Gram-Schmidt
- A note on weighted FOM and GMRES for solving nonsymmetric linear systems
- A parallel GMRES version for general sparse matrices
- A parallel implementation of the restarted GMRES iterative algorithm for nonsymmetric systems of linear equations
- A polynomial preconditioner for the GMRES algorithm
- A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
- A projection method to solve linear systems in tensor format
- A simple strategy for varying the restart parameter in GMRES\((m)\)
- A simpler GMRES
- Accelerate weighted GMRES by augmenting error approximations
- Accelerating the solution of linear systems by iterative refinement in three precisions
- Accelerating with rank-one updates
- Adaptive version of simpler GMRES
- Adaptively Preconditioned GMRES Algorithms
- Admissible and attainable convergence behavior of block Arnoldi and GMRES
- Algebraic properties of the block GMRES and block Arnoldi methods
- Algorithm 842
- An Iterative Least-Square Method Suitable for Solving Large Sparse Matrices
- An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
- Analysis of Augmented Krylov Subspace Methods
- Analysis of acceleration strategies for restarted minimal residual methods
- Analysis of the convergence of the minimal and the orthogonal residual methods
- Anderson acceleration for fixed-point iterations
- Any Nonincreasing Convergence Curve is Possible for GMRES
- Any Ritz value behavior is possible for Arnoldi and for GMRES
- Any admissible cycle-convergence behavior is possible for restarted GMRES at its initial cycles.
- Any admissible harmonic Ritz value set is possible for GMRES
- Applying GMRES to the Helmholtz equation with shifted Laplacian preconditioning: What is the largest shift for which wavenumber-independent convergence is guaranteed?
- Arnoldi decomposition, GMRES, and preconditioning for linear discrete ill-posed problems
- Augmented GMRES-type methods
- Block GMRES method with inexact breakdowns and deflated restarting
- Block Gram-Schmidt algorithms and their stability properties
- Block Krylov subspace methods for functions of matrices. II: Modified block FOM
- Block Modified Gram--Schmidt Algorithms and Their Analysis
- Breakdown-free GMRES for Singular Systems
- CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
- Communication lower bounds and optimal algorithms for numerical linear algebra
- Communication-optimal parallel and sequential QR and LU factorizations
- Complete stagnation of GMRES
- Computable Convergence Bounds for GMRES
- Computational Methods for Linear Matrix Equations
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
- Convergence analysis of Krylov subspace methods
- Convergence in Backward Error of Relaxed GMRES
- Convergence of GMRES for Tridiagonal Toeplitz Matrices
- Convergence properties of block GMRES and matrix polynomials
- Convergence properties of some block Krylov subspace methods for multiple linear systems
- DGMRES: A GMRES-type algorithm for Drazin-inverse solution of singular nonsymmetric linear systems
- Deflated GMRES for systems with multiple shifts and multiple right-hand sides
- Deflated and Augmented Krylov Subspace Techniques
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- Efficient High Accuracy Solutions with ${\text{GMRES}}(m)$
- Eigenvalue translation based preconditioners for the GMRES(k) method
- Enlarged GMRES for solving linear systems with one or multiple right-hand sides
- Error Analysis of Krylov Methods In a Nutshell
- Evaluation of the performance of inexact GMRES
- Exact and inexact breakdowns in the block GMRES method
- Expressions and bounds for the GMRES residual
- Extrapolation Methods for Vector Sequences
- Extrapolation vs. projection methods for linear systems of equations
- Field-of-values analysis of preconditioned iterative methods for nonsymmetric elliptic problems
- Fields of values and iterative methods
- Flexible GMRES with deflated restarting
- Flexible variants of block restarted GMRES methods with application to geophysics
- Further analysis of minimum residual iterations
- GMRES Convergence Analysis for a Convection-Diffusion Model Problem
- GMRES On (Nearly) Singular Systems
- GMRES and the Arioli, Pták, and Strakoš parametrization
- GMRES and the minimal polynomial
- GMRES convergence bounds that depend on the right-hand-side vector
- GMRES convergence for perturbed coefficient matrices, with application to approximate deflation preconditioning
- GMRES implementations and residual smoothing techniques for solving ill-posed linear systems
- GMRES methods for least squares problems
- GMRES vs. Ideal GMRES
- GMRES with Deflated Restarting
- GMRES with multiple preconditioners
- GMRES-type methods for inconsistent systems
- GMRES/CR and Arnoldi/Lanczos as Matrix Approximation Problems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- GMRESR: a family of nested GMRES methods
- Generalization of convergence conditions for a restarted GMRES
- Generalizations of the field of values useful in the study of polynomial functions of a matrix
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- Geometric aspects of the theory of Krylov subspace methods
- Global FOM and GMRES algorithms for matrix equations
- Gram-Schmidt orthogonalization: 100 years and more
- Hiding global communication latency in the GMRES algorithm on massively parallel machines
- How Fast are Nonsymmetric Matrix Iterations?
- How to Make Simpler GMRES and GCR More Stable
- Implementation of the GMRES Method Using Householder Transformations
- Implementations of the GMRES method
- Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
- Implicitly restarted and deflated GMRES
- Improving the Accuracy of GMRes with Deflated Restarting
- Inexact Krylov Subspace Methods for Linear Systems
- Inexact Matrix-Vector Products in Krylov Methods for Solving Linear Systems: A Relaxation Strategy
- Iterative Krylov Methods for Large Linear Systems
- Iterative Refinement in Floating Point
- Iterative methods for linear systems of equations: a brief historical journey
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- Krylov methods for nonsymmetric linear systems. From theory to computations
- Krylov sequences of maximal length and convergence of GMRES
- Krylov subspace methods. Principles and analysis.
- Krylov subspace recycling for sequences of shifted linear systems
- Krylov type methods for linear systems exploiting properties of the quadratic numerical range
- Least squares residuals and minimal residual methods
- Locally optimal and heavy ball GMRES methods
- Low synchronization Gram–Schmidt and generalized minimal residual algorithms
- Max-Min Properties of Matrix Factor Norms
- Minimal Residual Method Stronger than Polynomial Preconditioning
- Minimum residual methods for augmented systems
- Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES
- Multilevel Projection-Based Nested Krylov Iteration for Boundary Value Problems
- Multipreconditioned GMRES for shifted systems
- Necessary and sufficient conditions for GMRES complete and partial stagnation
- Nested Krylov methods based on GCR
- New conditions for non-stagnation of minimal residual methods
- New insights in GMRES-like methods with variable preconditioners
- Numerical behaviour of the modified Gram-Schmidt GMRES implementation
- Numerical methods for large eigenvalue problems
- Numerical range, GMRES and Faber polynomials.
- Numerical solution of saddle point problems
- Numerical stability of GMRES
- On Best Approximations of Polynomials in Matrices in the Matrix 2-Norm
- On GMRES for singular EP and GP systems
- On Improving Linear Solver Performance: A Block Variant of GMRES
- On a multilevel Krylov method for the Helmholtz equation preconditioned by shifted Laplacian
- On a non-stagnation condition for GMRES and application to saddle point matrices
- On computing givens rotations reliably and efficiently
- On fixed-point, Krylov, and \(2\times 2\) block preconditioners for nonsymmetric problems
- On investigating GMRES convergence using unitary matrices
- On restarted and deflated block FOM and GMRES methods for sequences of shifted linear systems
- On the Occurrence of Superlinear Convergence of Exact and Inexact Krylov Subspace Methods
- On the asymptotic directions of the s-dimensional optimum gradient method
- On the choice of preconditioner for minimum residual methods for non-Hermitian matrices
- On the convergence behavior of the restarted GMRES algorithm for solving nonsymmetric linear systems
- On the convergence rate of DGMRES
- On the cost of iterative computations
- On the generation of Krylov subspace bases
- On the regularizing properties of the GMRES method
- On the residual norms, the Ritz values and the harmonic Ritz values that can be generated by restarted GMRES
- On the similarities between the quasi-Newton inverse least squares method and GMRES
- On the similarities between the quasi-Newton least squares method and GMRes
- On the simplification of generalized conjugate-gradient methods for nonsymmetrizable linear systems
- On worst-case GMRES, ideal GMRES, and the polynomial numerical hull of a Jordan block
- Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor
- Parallel iterative methods for sparse linear systems
- Parallelism and robustness in GMRES with a Newton basis and deflated restarting
- Parallelizable restarted iterative methods for nonsymmetric linear systems. II: parallel implementation
- Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
- Physics based GMRES preconditioner for compressible and incompressible Navier-Stokes equations
- Pipelined, flexible Krylov subspace methods
- Polynomial Preconditioned GMRES and GMRES-DR
- Polynomial preconditioned Arnoldi with stability control
- Preconditioning
- Preconditioning techniques for large linear systems: A survey
- Prescribing the behavior of early terminating GMRES and Arnoldi iterations
- Properties of Worst-Case GMRES
- Proxy-GMRES: Preconditioning via GMRES in Polynomial Space
- Pseudoeigenvector bases and deflated GMRES for highly nonnormal matrices.
- Randomized Gram-Schmidt process with application to GMRES
- Randomized numerical linear algebra: Foundations and algorithms
- Recent computational developments in Krylov subspace methods for linear systems
- Recycling Krylov Subspaces for Sequences of Linear Systems
- Reduced storage matrix methods in stiff ODE systems
- Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers
- Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Reorthogonalized block classical Gram-Schmidt
- Residual and backward error bounds in minimum residual Krylov subspace methods
- Restarted GMRES for Shifted Linear Systems
- Restarted GMRES preconditioned by deflation
- Restarted block-GMRES with deflation of eigenvalues
- Ritz and harmonic Ritz values and the convergence of FOM and GMRES
- Rounding error analysis of mixed precision block Householder QR algorithms
- Rounding error analysis of the classical Gram-Schmidt orthogonalization process
- Shanks sequence transformations and Anderson acceleration
- Solution of Sparse Indefinite Systems of Linear Equations
- Solving ill-posed linear systems with GMRES and a singular preconditioner
- Solving linear least squares problems by Gram-Schmidt orthogonalization
- Some Remarks on the Elman Estimate for GMRES
- Some observations on weighted GMRES
- Some properties of range restricted GMRES methods
- Some remarks on the restarted and augmented GMRES method
- Some theoretical results derived from polynomial numerical hulls of Jordan blocks
- Some uses of the field of values in numerical analysis
- Spectral deflation in Krylov solvers: a theory of coordinate space based methods
- Squeezing a Matrix into Half Precision, with an Application to Solving Linear Systems
- Stability of linear GMRES convergence with respect to compact perturbations
- Structure preserving quaternion generalized minimal residual method
- TT-GMRES: solution to a linear system in the structured tensor format
- The DEFLATED-GMRES(m,k) method with switching the restart frequency dynamically
- The Idea behind Krylov Methods
- The Tortoise and the Hare Restart GMRES
- The block grade of a block Krylov space
- The coefficients of the FOM and GMRES residual polynomials
- The complete stagnation of GMRES for \(n \leq 4\)
- The cycle-convergence of restarted GMRES for normal matrices is sublinear
- The loss of orthogonality in the Gram-Schmidt orthogonalization process
- The polynomial numerical hulls of Jordan blocks and related matrices.
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- The rate of convergence of conjugate gradients
- The stability of block variants of classical Gram-Schmidt
- The superlinear convergence behaviour of GMRES
- The worst-case GMRES for normal matrices
- Theoretical and numerical comparisons of GMRES and WZ-GMRES
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- Thick-restart Lanczos method for large symmetric eigenvalue problems
- Toward efficient polynomial preconditioning for GMRES
- Truncation Strategies for Optimal Krylov Subspace Methods
- Two new variants of the simpler block GMRES method with vector deflation and eigenvalue deflation for multiple linear systems
- Two recursive GMRES-type methods for shifted linear systems with general preconditioning
- Using FGMRES to obtain backward stability in mixed precision
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- Varying the \(s\) in your \(s\)-step GMRES
- Weighted FOM and GMRES for solving nonsymmetric linear systems
- Weighted Inner Products for GMRES and GMRES-DR
- Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations
Cited in
(9)- Probabilistic rounding error analysis of modified Gram-Schmidt
- A new matrix feature selection strategy in machine learning models for certain Krylov solver prediction
- A robust implicit high-order discontinuous Galerkin method for solving compressible Navier-Stokes equations on arbitrary grids
- Rounding error analysis of the inverse compact WY modified Gram-Schmidt algorithms
- Randomized block Gram-Schmidt process for the solution of linear systems and eigenvalue problems
- Numerical study of mixed precision GMRES(m) preconditioned by deflation
- Robust bounds for Krylov methods revisited
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- GMRES algorithms over 35 years
This page was built for publication: GMRES algorithms over 35 years
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2698151)
