Mixed precision algorithms in numerical linear algebra
From MaRDI portal
Publication:5887837
DOI10.1017/S0962492922000022OpenAlexW4283270874WikidataQ128147894 ScholiaQ128147894MaRDI QIDQ5887837
Nicholas J. Higham, Theo A. Mary
Publication date: 14 April 2023
Published in: Acta Numerica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0962492922000022
Related Items
Matrix Multiplication in Multiword Arithmetic: Error Analysis and Application to GPU Tensor Cores, Floating-point arithmetic, Convergence Analysis of a Mixed Precision Parareal Algorithm, Precision-aware deterministic and probabilistic error bounds for floating point summation, Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning, A mixed precision LOBPCG algorithm, Adaptive Precision Sparse Matrix–Vector Product and Its Application to Krylov Solvers
Uses Software
Cites Work
- Numerical inverting of matrices of high order
- NOTES ON THE SOLUTION OF ALGEBRAIC LINEAR SIMULTANEOUS EQUATIONS
- Three-Precision GMRES-Based Iterative Refinement for Least Squares Problems
- Stochastic Rounding and Its Probabilistic Backward Error Analysis
- Exploiting Lower Precision Arithmetic in Solving Symmetric Positive Definite Linear Systems and Least Squares Problems
- Matrices with Tunable Infinity-Norm Condition Number and No Need for Pivoting in LU Factorization
- Minimizing convex quadratics with variable precision conjugate gradients
- Arbitrary Precision Algorithms for Computing the Matrix Cosine and its Fréchet Derivative
- A Framework for Error-Bounded Approximate Computing, with an Application to Dot Products
- Multistage mixed precision iterative refinement
- Matrix Multiplication in Multiword Arithmetic: Error Analysis and Application to GPU Tensor Cores
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
- Accurate eigenvalue decomposition of real symmetric arrowhead matrices and applications
- Solving lattice QCD systems of equations using mixed precision solvers on GPUs
- Accelerating scientific computations with mixed precision algorithms
- Using FGMRES to obtain backward stability in mixed precision
- Block elimination with one refinement solves bordered linear systems accurately
- Binary cascades iterative refinement in doubled-mantissa arithmetics
- Iterative refinement for linear systems in variable-precision arithmetic
- Iterative refinement enhances the stability of \(QR\) factorization methods for solving linear equations
- Iterative refinement for constrained and weighted linear least squares
- Iterative refinement for symmetric eigenvalue decomposition
- Iterative diagonalization of symmetric matrices in mixed precision and its application to electronic structure calculations
- Mixed precision bisection
- Block Gram-Schmidt algorithms and their stability properties
- Iterative refinement for singular value decomposition based on matrix multiplication
- Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues
- Benefits from using mixed precision computations in the ELPA-AEO and ESSEX-II eigensolver projects
- Rounding error analysis of the classical Gram-Schmidt orthogonalization process
- Newton's Method in Floating Point Arithmetic and Iterative Refinement of Generalized Eigenvalue Problems
- Analysis of the Cholesky Method with Iterative Refinement for Solving the Symmetric Definite Generalized Eigenproblem
- Direct Methods for Sparse Matrices
- Improved Accuracy and Parallelism for MRRR-Based Eigensolvers---A Mixed Precision Approach
- A Symmetry Preserving Algorithm for Matrix Scaling
- More reliable forecasts with less precise computations: a fast-track route to cloud-resolved weather and climate simulators?
- Julia: A Fresh Approach to Numerical Computing
- A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems
- The university of Florida sparse matrix collection
- Stability and Performance of Various Singular Value QR Implementations on Multicore CPU with a GPU
- Mixed Precision Block Fused Multiply-Add: Error Analysis and Application to GPU Tensor Cores
- Improving the Accuracy of Computed Singular Values
- A Multiprecision Derivative-Free Schur--Parlett Algorithm for Computing Matrix Functions
- Towards Stable Mixed Pivoting Strategies for the Sequential and Parallel Solution of Sparse Symmetric Indefinite Systems
- A Note on GMRES Preconditioned by a Perturbed $L D L^T$ Decomposition with Static Pivoting
- MPFR
- Using Mixed Precision for Sparse Matrix Computations to Enhance the Performance while Achieving 64-bit Accuracy
- Correct Rounding and a Hybrid Approach to Exact Floating-Point Summation
- Improving the Accuracy of Computed Eigenvalues and Eigenvectors
- Algorithm 589: SICEDR : A FORTRAN Subroutine for Improving the Accuracy of Computed Matrix Eigenvalues
- Computing the Polar Decomposition—with Applications
- Fast Solution of Vandermonde-Like Systems Involving Orthogonal Polynomials
- Error Analysis of Direct Methods of Matrix Inversion
- Iterative Refinement Implies Numerical Stability for Gaussian Elimination
- Use of Iterative Refinement in the Solution of Sparse Linear Systems
- Efficient High Accuracy Solutions with ${\text{GMRES}}(m)$
- Iterative refinement implies numerical stability
- Estimating the Attainable Accuracy of Recursively Computed Residual Methods
- Iterative refinement for linear systems and LAPACK
- Faster numerical algorithms via exception handling
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- Accurate and Efficient Floating Point Summation
- PARDISO: a high-performance serial and parallel sparse linear solver in semiconductor device simulation
- Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic
- A New Analysis of Iterative Refinement and Its Application to Accurate Solution of Ill-Conditioned Sparse Linear Systems
- Handbook of Floating-Point Arithmetic
- Accelerating the Solution of Linear Systems by Iterative Refinement in Three Precisions
- A New Preconditioner that Exploits Low-Rank Approximations to Factorization Error
- Inexact Krylov Subspace Methods for Linear Systems
- Accuracy and Stability of Numerical Algorithms
- A Block Orthogonalization Procedure with Constant Synchronization Requirements
- On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems
- High-Performance Mixed-Precision Linear Solver for FPGAs
- The physics of numerical analysis: a climate modelling case study
- Rounding Error Analysis of Mixed Precision Block Householder QR Algorithms
- A Set of Batched Basic Linear Algebra Subprograms and LAPACK Routines
- Adaptive Precision Block-Jacobi for High Performance Preconditioning in the Ginkgo Linear Algebra Software
- Newton's Method in Mixed Precision
- Mixed precision s‐step Lanczos and conjugate gradient algorithms
- Solving block low-rank linear systems by LU factorization is numerically stable
- A Class of Fast and Accurate Summation Algorithms
- Sharper Probabilistic Backward Error Analysis for Basic Linear Algebra Kernels with Random Data
- Probabilistic Error Analysis for Inner Products
- Random Matrices Generating Large Growth in LU Factorization with Pivoting
- Logic Gates, Circuits, Processors, Compilers and Computers
- Mixed-precision iterative refinement using tensor cores on GPUs to accelerate solution of linear systems
- Algebraic Error Analysis for Mixed-Precision Multigrid Solvers
- Discretization-Error-Accurate Mixed-Precision Multigrid Solvers
- Shifted Cholesky QR for Computing the QR Factorization of Ill-Conditioned Matrices
- Squeezing a Matrix into Half Precision, with an Application to Solving Linear Systems
- Performance and Scalability of the Block Low-Rank Multifrontal Factorization on Multicore Architectures
- A New Approach to Probabilistic Rounding Error Analysis
- Simulating Low Precision Floating-Point Arithmetic
- An Arbitrary Precision Scaling and Squaring Algorithm for the Matrix Exponential
- Mixed-Precision Cholesky QR Factorization and Its Case Studies on Multicore CPU with Multiple GPUs
- Inexact Matrix-Vector Products in Krylov Methods for Solving Linear Systems: A Relaxation Strategy
- Multiprecision Algorithms for Computing the Matrix Logarithm
- Convergence in Backward Error of Relaxed GMRES
- Functions of Matrices
- SuperLU_DIST
- Design, implementation and testing of extended and mixed precision BLAS
- Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES
- Iterative refinement of linear least squares solutions I
- Iterative Refinement in Floating Point
- Performance and accuracy of hardware-oriented native-, emulated- and mixed-precision solvers in FEM simulations
