Convergence in Backward Error of Relaxed GMRES
From MaRDI portal
(Redirected from Convergence in Backward Error of Relaxed GMRES)
Recommendations
Cited in
(22)- Parallel algebraic hybrid solvers for large 3D convection-diffusion problems
- A ROM-accelerated parallel-in-time preconditioner for solving all-at-once systems in unsteady convection-diffusion PDEs
- Analysis of inexact Krylov subspace methods for approximating the matrix exponential
- Inexact GMRES iterations and relaxation strategies with fast-multipole boundary element method
- GMRES algorithms over 35 years
- On the robustness of numerical algorithms for linear systems and signal processing in finite precision arithmetic
- Backward error analysis of the shift-and-invert Arnoldi algorithm
- Relaxed Krylov subspace approximation
- The adaptive s-step conjugate gradient method
- A Note on Inexact Inner Products in GMRES
- Properties of Worst-Case GMRES
- Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES
- Accelerating convergence for Backward-Euler method by adding time relaxation term
- Randomized Gram-Schmidt process with application to GMRES
- Mixed precision algorithms in numerical linear algebra
- Evaluation of the performance of inexact GMRES
- Theory of Krylov subspace methods based on the Arnoldi process with inexact inner products
- Solving nonlinear ODEs with the ultraspherical spectral method
- A note on TT-GMRES for the solution of parametric linear systems
- Compact Rational Krylov for Parametrized Systems with Application to BEM Frequency Sweeping
- Blas-based mixed precision block memory accessor with applications to sparse direct solvers
- Mixed-Precision Computing for Scientific Discovery: Formats, Co-Design, and Responsible Approximation
This page was built for publication: Convergence in Backward Error of Relaxed GMRES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5453559)
