Using FGMRES to obtain backward stability in mixed precision
From MaRDI portal
Publication:836834
zbMath1171.65018MaRDI QIDQ836834
Publication date: 8 September 2009
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/130614
error analysisiterative methodssparse matrix factorizationlarge sparse systemshybrid methodbackward stabilitytriangular factorizationiterative refinementFGMRESdirect factorizationmixed precision arithmetic
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)
Related Items
Mixed precision algorithms in numerical linear algebra ⋮ Chebyshev acceleration of iterative refinement ⋮ Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning ⋮ A New Analysis of Iterative Refinement and Its Application to Accurate Solution of Ill-Conditioned Sparse Linear Systems ⋮ GMRES algorithms over 35 years ⋮ Accelerating the Solution of Linear Systems by Iterative Refinement in Three Precisions ⋮ Semismooth Newton methods with domain decomposition for American options ⋮ Accelerating scientific computations with mixed precision algorithms ⋮ Parameter modified versions of preconditioning and iterative inner product free refinement methods for two-by-two block matrices ⋮ Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems
Uses Software
This page was built for publication: Using FGMRES to obtain backward stability in mixed precision
