Combining sparse approximate factorizations with mixed-precision iterative refinement
From MaRDI portal
Cites work
- A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems
- A fully asynchronous multifrontal solver using distributed dynamic scheduling
- A multilevel Schwarz preconditioner based on a hierarchy of robust coarse spaces
- A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
- A New Approach to Probabilistic Rounding Error Analysis
- A Note on GMRES Preconditioned by a Perturbed L D L^T Decomposition with Static Pivoting
- A Supernodal Approach to Sparse Partial Pivoting
- 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 efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
- Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors
- Error bounds from extra-precise iterative refinement
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- Improving multifrontal methods by means of block low-rank representations
- Iterative refinement implies numerical stability
- Iterative Refinement Implies Numerical Stability for Gaussian Elimination
- Iterative Refinement in Floating Point
- Mixed precision algorithms in numerical linear algebra
- Mixed-precision iterative refinement using tensor cores on GPUs to accelerate solution of linear systems
- Nested Dissection of a Regular Finite Element Mesh
- On algorithms for permuting large entries to the diagonal of a sparse matrix
- On the complexity of the block low-rank multifrontal factorization
- Performance and scalability of the block low-rank multifrontal factorization on multicore architectures
- Robust memory-aware mappings for parallel multifrontal factorizations
- Sharper probabilistic backward error analysis for basic linear algebra kernels with random data
- Solving block low-rank linear systems by LU factorization is numerically stable
- Solving Sparse Linear Systems with Sparse Backward Error
- Stochastic rounding and its probabilistic backward error analysis
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- The University of Florida sparse matrix collection
- Towards Stable Mixed Pivoting Strategies for the Sequential and Parallel Solution of Sparse Symmetric Indefinite Systems
- Using Mixed Precision for Sparse Matrix Computations to Enhance the Performance while Achieving 64-bit Accuracy
Cited in
(4)- Sparse approximate multifrontal factorization with composite compression methods
- Avoiding breakdown in incomplete factorizations in low precision arithmetic
- Blas-based mixed precision block memory accessor with applications to sparse direct solvers
- Mixed-Precision Computing for Scientific Discovery: Formats, Co-Design, and Responsible Approximation
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)
