A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems

DOI10.1145/1731022.1731027MaRDI QIDQ2989100zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

Gaussian eliminationmultifrontal methoditerative refinementFGMRESmixed precisionsparse symmetric linear systemsFortran 95

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Packaged methods for numerical algorithms (65Y15)

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

Cited in

(19)

• Mixed-precision preconditionders in parallel domain decomposition solvers
• Chebyshev acceleration of iterative refinement
• Newton's method in mixed precision
• Impact of mixed precision and storage layout on additive Schwarz smoothers
• Benefits from using mixed precision computations in the ELPA-AEO and ESSEX-II eigensolver projects
• Mixed precision algorithms in numerical linear algebra
• 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
• 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
• Combining sparse approximate factorizations with mixed-precision iterative refinement
• A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
• HSL_MA79
• 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
• 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

Describes a project that uses

Uses Software

• Fortran_Virtual_Memory
• SparseMatrix
• MA57
• LAPACK
• HSL
• AMD

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)