Developing robust incomplete Cholesky factorizations in half precision arithmetic
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 991430 (Why is no real title available?)
- scientific article; zbMATH DE number 428959 (Why is no real title available?)
- scientific article; zbMATH DE number 1323248 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- A New Modified Cholesky Factorization
- A Revised Modified Cholesky Factorization Algorithm
- 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
- Algorithm 695
- Algorithms for Sparse Linear Systems
- 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
- Avoiding breakdown in incomplete factorizations in low precision arithmetic
- Estimating the Attainable Accuracy of Recursively Computed Residual Methods
- Exploiting lower precision arithmetic in solving symmetric positive definite linear systems and least squares problems
- Faster numerical algorithms via exception handling
- Five-Precision GMRES-Based Iterative Refinement
- Incomplete Cholesky Factorizations with Limited Memory
- Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning
- Mixed precision algorithms in numerical linear algebra
- Modified Cholesky algorithms: A catalog with new approaches
- Multistage mixed precision iterative refinement
- Newton-type methods for unconstrained and linearly constrained optimization
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
- Practical Optimization
- Simulating Low Precision Floating-Point Arithmetic
- Squeezing a Matrix into Half Precision, with an Application to Solving Linear Systems
- The importance of structure in incomplete factorization preconditioners
- Three-precision GMRES-based iterative refinement for least squares problems
- \texttt{HSL\_MI28}: an efficient and robust limited-memory incomplete Cholesky factorization code
This page was built for publication: Developing robust incomplete Cholesky factorizations in half precision arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875893)
