On the convergence rate of DGMRES
From MaRDI portal
Publication:1754438
DOI10.1016/j.laa.2018.04.027zbMath1392.65052OpenAlexW2801874341WikidataQ129918447 ScholiaQ129918447MaRDI QIDQ1754438
Abbas Salemi, Anne Greenbaum, Faranges Kyanfar
Publication date: 30 May 2018
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2018.04.027
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10) Linear equations (linear algebraic aspects) (15A06)
Related Items (3)
Global-DGMRES method for matrix equationAXB = C ⋮ GMRES algorithms over 35 years ⋮ On stagnation of the DGMRES method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- DGMRES method augmented with eigenvectors for computing the Drazin-inverse solution of singular linear systems
- A semi-iterative method for real spectrum singular linear systems with an arbitrary index
- New methods for computing the Drazin-inverse solution of singular linear systems
- The Coefficients of the FOM and GMRES Residual Polynomials
- GMRES vs. Ideal GMRES
- An Efficient Algorithm for Computing the Generalized Null Space Decomposition
- On Best Approximations of Polynomials in Matrices in the Matrix 2-Norm
- GMRES/CR and Arnoldi/Lanczos as Matrix Approximation Problems
- Minimal Residual Method Stronger than Polynomial Preconditioning
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- Ritz Value Localization for Non-Hermitian Matrices
- DGMRES: A GMRES-type algorithm for Drazin-inverse solution of singular nonsymmetric linear systems
- A unified approach to Krylov subspace methods for the Drazin-inverse solution of singular nonsymmetric linear systems
This page was built for publication: On the convergence rate of DGMRES
