Avoiding breakdown in incomplete factorizations in low precision arithmetic
From MaRDI portal
Publication:6604161
DOI10.1145/3651155MaRDI QIDQ6604161
Publication date: 12 September 2024
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
preconditioningsparse matricessparse linear systemsiterative refinementmixed precision arithmeticincomplete factorizationshalf precision arithmetic
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The importance of structure in incomplete factorization preconditioners
- Accelerating scientific computations with mixed precision algorithms
- Using FGMRES to obtain backward stability in mixed precision
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- Preconditioning techniques for large linear systems: A survey
- A Symmetry Preserving Algorithm for Matrix Scaling
- A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems
- A Note on GMRES Preconditioned by a Perturbed $L D L^T$ Decomposition with Static Pivoting
- Error bounds from extra-precise iterative refinement
- Using Mixed Precision for Sparse Matrix Computations to Enhance the Performance while Achieving 64-bit Accuracy
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Estimating the Attainable Accuracy of Recursively Computed Residual Methods
- Parallel Preconditioning with Sparse Approximate Inverses
- An improved incomplete Cholesky factorization
- 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
- Incomplete Cholesky Factorizations with Limited Memory
- Accuracy and Stability of Numerical Algorithms
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- Squeezing a Matrix into Half Precision, with an Application to Solving Linear Systems
- Simulating Low Precision Floating-Point Arithmetic
- HSL_MI28
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- Three-Precision GMRES-Based Iterative Refinement for Least Squares Problems
- Exploiting Lower Precision Arithmetic in Solving Symmetric Positive Definite Linear Systems and Least Squares Problems
- Mixed precision algorithms in numerical linear algebra
- Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning
- Five-Precision GMRES-Based Iterative Refinement
- Combining sparse approximate factorizations with mixed-precision iterative refinement
This page was built for publication: Avoiding breakdown in incomplete factorizations in low precision arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604161)