The worst-case GMRES for normal matrices
From MaRDI portal
Publication:1826451
Recommendations
Cited in
(18)- The rate of convergence of GMRES on a tridiagonal Toeplitz linear system. II
- On investigating GMRES convergence using unitary matrices
- Necessary and sufficient conditions for GMRES complete and partial stagnation
- Convergence of CG and GMRES on a tridiagonal Toeplitz linear system
- Vandermonde matrices with Chebyshev nodes
- The role eigenvalues play in forming GMRES residual norms with non-normal matrices
- GMRES algorithms over 35 years
- Accelerating the solution of linear systems by iterative refinement in three precisions
- Convergence analysis of Krylov subspace methods
- Computable Convergence Bounds for GMRES
- On the cost of iterative computations
- Properties of Worst-Case GMRES
- On Meinardus' examples for the conjugate gradient method
- Three-precision GMRES-based iterative refinement for least squares problems
- GMRES, pseudospectra, and Crouzeix's conjecture for shifted and scaled Ginibre matrices
- Constraints on admissible behavior of GMRES applied to tridiagonal Toeplitz systems
- On worst-case GMRES, ideal GMRES, and the polynomial numerical hull of a Jordan block
- On the worst-case convergence of MR and CG for symmetric positive definite tridiagonal Toeplitz matrices
This page was built for publication: The worst-case GMRES for normal matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1826451)