A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems
DOI10.1145/1731022.1731027zbMATH Open1364.65070OpenAlexW2018136118WikidataQ113310495 ScholiaQ113310495MaRDI QIDQ2989100FDOQ2989100
Authors: J. D. Hogg, J. A. Scott 
Publication date: 19 May 2017
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1731022.1731027
Recommendations
- Mixed precision algorithms in numerical linear algebra
- Mixed-precision preconditionders in parallel domain decomposition solvers
- Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning
- Squeezing a Matrix into Half Precision, with an Application to Solving Linear Systems
- Performance and accuracy of hardware-oriented native-, emulated- and mixed-precision solvers in FEM simulations
Gaussian eliminationmultifrontal methoditerative refinementFGMRESmixed precisionsparse symmetric linear systemsFortran 95
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Packaged methods for numerical algorithms (65Y15)
Cited In (18)
- Newton's method in mixed precision
- Chebyshev acceleration of iterative refinement
- Mixed precision algorithms in numerical linear algebra
- Benefits from using mixed precision computations in the ELPA-AEO and ESSEX-II eigensolver projects
- Using FGMRES to obtain backward stability in mixed precision
- New parallel sparse direct solvers for multicore architectures
- Avoiding breakdown in incomplete factorizations in low precision arithmetic
- Combining sparse approximate factorizations with mixed-precision iterative refinement
- Microcomputer symbolic generation of an optimal Crout algorithm for sparse systems of linear equations
- Using Mixed Precision for Sparse Matrix Computations to Enhance the Performance while Achieving 64-bit Accuracy
- A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
- Adaptive Precision Sparse Matrix–Vector Product and Its Application to Krylov Solvers
- Double precision is not necessary for LSQR for solving discrete linear ill-posed problems
- HSL_MA79
- Exploiting lower precision arithmetic in solving symmetric positive definite linear systems and least squares problems
- Accelerating the solution of linear systems by iterative refinement in three precisions
- Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning
- Mixed-precision preconditionders in parallel domain decomposition solvers
Uses Software
This page was built for publication: A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989100)
