A modular framework for the backward error analysis of GMRES
From MaRDI portal
Cites work
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
- A New Approach to Probabilistic Rounding Error Analysis
- A new shifted block GMRES method with inexact breakdowns for solving multi-shifted and multiple right-hand sides linear systems
- A Note on GMRES Preconditioned by a Perturbed L D L^T Decomposition with Static Pivoting
- A note on the error analysis of classical Gram-Schmidt
- A simpler GMRES
- Accelerating the solution of linear systems by iterative refinement in three precisions
- Accuracy and Stability of Numerical Algorithms
- Adaptive Precision Sparse Matrix–Vector Product and Its Application to Krylov Solvers
- An optimal Q-OR Krylov subspace method for solving linear systems
- Any Nonincreasing Convergence Curve is Possible for GMRES
- Block GMRES method with inexact breakdowns and deflated restarting
- Block Gram-Schmidt algorithms and their stability properties
- Block Modified Gram--Schmidt Algorithms and Their Analysis
- Bounds for the least squares distance using scaled total least squares
- Convergence properties of block GMRES and matrix polynomials
- Efficient High Accuracy Solutions with ${\text{GMRES}}(m)$
- Exact and inexact breakdowns in the block GMRES method
- Five-Precision GMRES-Based Iterative Refinement
- Flexible Inner-Outer Krylov Subspace Methods
- Floating-point arithmetic
- Full operator preconditioning and the accuracy of solving linear systems
- GMRES algorithms over 35 years
- GMRES convergence bounds for eigenvalue problems
- GMRES convergence bounds that depend on the right-hand-side vector
- GMRES with Deflated Restarting
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Gram-Schmidt orthogonalization: 100 years and more
- How to Make Simpler GMRES and GCR More Stable
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- Implementation of the GMRES Method Using Householder Transformations
- Iterative algorithms for Gram-Schmidt orthogonalization
- Loss and Recapture of Orthogonality in the Modified Gram–Schmidt Algorithm
- Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning
- Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES
- Numerical stability of GMRES
- On the cost of iterative computations
- Preconditioning
- Preconditioning for accurate solutions of ill-conditioned linear systems.
- Randomized Gram-Schmidt process with application to GMRES
- Rounding error analysis of the classical Gram-Schmidt orthogonalization process
- Sharper probabilistic backward error analysis for basic linear algebra kernels with random data
- Solving linear least squares problems by Gram-Schmidt orthogonalization
- Stability Analysis and Improvement of the Block Gram–Schmidt Algorithm
- Stochastic rounding and its probabilistic backward error analysis
- The effect of non-optimal bases on the convergence of Krylov subspace methods
- The matrix sign decomposition and its relation to the polar decomposition
- The stability of split-preconditioned FGMRES in four precisions
- Using FGMRES to obtain backward stability in mixed precision
- Using Mixed Precision for Sparse Matrix Computations to Enhance the Performance while Achieving 64-bit Accuracy
- When modified Gram-Schmidt generates a well-conditioned set of vectors
This page was built for publication: A modular framework for the backward error analysis of GMRES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7318705)
