Avoiding breakdown in incomplete factorizations in low precision arithmetic
From MaRDI portal
Publication:6604161
Cites work
- \texttt{HSL\_MI28}: an efficient and robust limited-memory incomplete Cholesky factorization code
- A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems
- 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 Note on GMRES Preconditioned by a Perturbed L D L^T Decomposition with Static Pivoting
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- A Symmetry Preserving Algorithm for Matrix Scaling
- Accelerating scientific computations with mixed precision algorithms
- Accelerating the solution of linear systems by iterative refinement in three precisions
- Accuracy and Stability of Numerical Algorithms
- An improved incomplete Cholesky factorization
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Combining sparse approximate factorizations with mixed-precision iterative refinement
- Error bounds from extra-precise iterative refinement
- Estimating the Attainable Accuracy of Recursively Computed Residual Methods
- Exploiting lower precision arithmetic in solving symmetric positive definite linear systems and least squares problems
- Five-Precision GMRES-Based Iterative Refinement
- scientific article; zbMATH DE number 991430 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- Incomplete Cholesky Factorizations with Limited Memory
- Mixed precision algorithms in numerical linear algebra
- Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- Parallel Preconditioning with Sparse Approximate Inverses
- Preconditioning techniques for large linear systems: A survey
- Simulating Low Precision Floating-Point Arithmetic
- Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
- Squeezing a Matrix into Half Precision, with an Application to Solving Linear Systems
- The importance of structure in incomplete factorization preconditioners
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- Three-precision GMRES-based iterative refinement for least squares problems
- 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
Cited in
(2)
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)
