Combining sparse approximate factorizations with mixed-precision iterative refinement

DOI10.1145/3582493MaRDI QIDQ6599996FDOQ6599996

Authors: Patrick R. Amestoy, Alfredo Buttari, Nicholas J. Higham, Jean-Yves L'Excellent, Theo A. Mary 

Publication date: 6 September 2024

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

zbMATH Keywords

preconditioninglinear systemparallelismGMRESfloating-point arithmeticmultifrontal methodrounding error analysisiterative refinementmultiple precisionmixed precisionsparse direct solver

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites Work

• The University of Florida sparse matrix collection
• A Supernodal Approach to Sparse Partial Pivoting
• A fully asynchronous multifrontal solver using distributed dynamic scheduling
• A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems
• Accelerating scientific computations with mixed precision algorithms
• Nested Dissection of a Regular Finite Element Mesh
• On algorithms for permuting large entries to the diagonal of a sparse matrix
• Accuracy and Stability of Numerical Algorithms
• Iterative Refinement Implies Numerical Stability for Gaussian Elimination
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• Title not available (Why is that?)
• Using Mixed Precision for Sparse Matrix Computations to Enhance the Performance while Achieving 64-bit Accuracy
• Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors
• Error bounds from extra-precise iterative refinement
• A Note on GMRES Preconditioned by a Perturbed $L D L^T$ Decomposition with Static Pivoting
• Solving Sparse Linear Systems with Sparse Backward Error
• Iterative Refinement in Floating Point
• An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
• Improving multifrontal methods by means of block low-rank representations
• A New Approach to Probabilistic Rounding Error Analysis
• Mixed precision algorithms in numerical linear algebra
• Iterative refinement implies numerical stability
• A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
• Towards Stable Mixed Pivoting Strategies for the Sequential and Parallel Solution of Sparse Symmetric Indefinite Systems
• Accelerating the solution of linear systems by iterative refinement in three precisions
• Solving block low-rank linear systems by LU factorization is numerically stable
• Stochastic rounding and its probabilistic backward error analysis
• Performance and scalability of the block low-rank multifrontal factorization on multicore architectures
• On the complexity of the block low-rank multifrontal factorization
• A multilevel Schwarz preconditioner based on a hierarchy of robust coarse spaces
• Robust memory-aware mappings for parallel multifrontal factorizations
• Mixed-precision iterative refinement using tensor cores on GPUs to accelerate solution of linear systems
• Sharper probabilistic backward error analysis for basic linear algebra kernels with random data

Cited In (2)

• Avoiding breakdown in incomplete factorizations in low precision arithmetic
• Sparse approximate multifrontal factorization with composite compression methods

This page was built for publication: Combining sparse approximate factorizations with mixed-precision iterative refinement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599996)