Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning
From MaRDI portal
Publication:6098511
DOI10.1137/22m1487709zbMath1516.65023arXiv2202.10204OpenAlexW4379985703MaRDI QIDQ6098511
Unnamed Author, Erin Claire Carson
Publication date: 14 June 2023
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.10204
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Roundoff error (65G50) Computer aspects of numerical algorithms (65Y99) Preconditioners for iterative methods (65F08)
Related Items
Cites Work
- Unnamed Item
- Using FGMRES to obtain backward stability in mixed precision
- A comparative study of sparse approximate inverse preconditioners
- Factorized sparse approximate inverses for preconditioning
- Factorized-sparse-approximate-inverse preconditionings of linear systems with unsymmetric matrices
- Preconditioning techniques for large linear systems: A survey
- Communication-optimal Parallel and Sequential QR and LU Factorizations
- The university of Florida sparse matrix collection
- GPU-accelerated preconditioned GMRES method for two-dimensional Maxwell's equations
- Iterative Refinement Implies Numerical Stability for Gaussian Elimination
- Approximate inverse preconditionings for sparse linear systems
- Factorized Sparse Approximate Inverse Preconditionings I. Theory
- Iterative refinement implies numerical stability
- Parallel Preconditioning with Sparse Approximate Inverses
- Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques
- A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
- Orderings for Factorized Sparse Approximate Inverse Preconditioners
- A New Analysis of Iterative Refinement and Its Application to Accurate Solution of Ill-Conditioned Sparse Linear Systems
- Accelerating the Solution of Linear Systems by Iterative Refinement in Three Precisions
- A New Preconditioner that Exploits Low-Rank Approximations to Factorization Error
- Accuracy and Stability of Numerical Algorithms
- Any Nonincreasing Convergence Curve is Possible for GMRES
- Solving block low-rank linear systems by LU factorization is numerically stable
- Squeezing a Matrix into Half Precision, with an Application to Solving Linear Systems
- Frobenius norm minimization and probing for preconditioning
- Iterative Refinement in Floating Point
- Linear algebra software for large-scale accelerated multicore computing
- Three-Precision GMRES-Based Iterative Refinement for Least Squares Problems
- Multistage mixed precision iterative refinement
- Mixed precision algorithms in numerical linear algebra
