Accelerating the solution of linear systems by iterative refinement in three precisions
From MaRDI portal
Recommendations
- A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
- Squeezing a Matrix into Half Precision, with an Application to Solving Linear Systems
- Iterative refinement for ill-conditioned linear systems
- scientific article; zbMATH DE number 4184913
- Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning
Cites work
- A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems
- A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
- A Note on GMRES Preconditioned by a Perturbed L D L^T Decomposition with Static Pivoting
- Accuracy and Stability of Numerical Algorithms
- Any Nonincreasing Convergence Curve is Possible for GMRES
- Binary cascades iterative refinement in doubled-mantissa arithmetics
- Chebyshev acceleration of iterative refinement
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Fast Hybrid Solution of Algebraic Systems
- Faster numerical algorithms via exception handling
- scientific article; zbMATH DE number 3473182 (Why is no real title available?)
- scientific article; zbMATH DE number 1024452 (Why is no real title available?)
- Iterative refinement enhances the stability of \(QR\) factorization methods for solving linear equations
- Iterative refinement for linear systems and LAPACK
- Iterative refinement for linear systems in variable-precision arithmetic
- Iterative refinement implies numerical stability
- Iterative Refinement Implies Numerical Stability for Gaussian Elimination
- Iterative Refinement in Floating Point
- LAPACK Users' Guide
- Linear algebra software for large-scale accelerated multicore computing
- Modern Error Analysis
- Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES
- Newton's method in floating point arithmetic and iterative refinement of generalized eigenvalue problems
- NOTES ON THE SOLUTION OF ALGEBRAIC LINEAR SIMULTANEOUS EQUATIONS
- On the Compatibility of a Given Solution With the Data of a Linear System
- On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems
- Recycling Krylov Subspaces for Sequences of Linear Systems
- Solving Sparse Linear Systems with Sparse Backward Error
- The worst-case GMRES for normal matrices
- Use of Iterative Refinement in the Solution of Sparse Linear Systems
- Using FGMRES to obtain backward stability in mixed precision
Cited in
(77)- Binary cascades iterative refinement in doubled-mantissa arithmetics
- Iterative refinement enhances the stability of \(QR\) factorization methods for solving linear equations
- Accurate solution of dense linear systems I: Algorithms in rounding to nearest
- L-decremented ROW method of third-order accuracy
- A numerical study of fractional linear algebraic systems
- A Hamiltonian decomposition for fast interior-point solvers in model predictive control
- On the use of the infinity computer architecture to set up a dynamic precision floating-point arithmetic
- A new iterative refinement for ill-conditioned linear systems based on discrete gradient
- Reproducibility strategies for parallel preconditioned conjugate gradient
- Performance and energy consumption of accurate and mixed-precision linear algebra kernels on GPUs
- Mixed-precision explicit stabilized Runge-Kutta methods for single- and multi-scale differential equations
- GMRES algorithms over 35 years
- Mixed precision block fused multiply-add: error analysis and application to GPU tensor cores
- A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
- A New Preconditioner that Exploits Low-Rank Approximations to Factorization Error
- scientific article; zbMATH DE number 2151189 (Why is no real title available?)
- Enclosing Chebyshev expansions in linear time
- Hierarchical algorithms on hierarchical architectures
- Numerical algorithms for high-performance computational science
- Algebraic Error Analysis for Mixed-Precision Multigrid Solvers
- Discretization-Error-Accurate Mixed-Precision Multigrid Solvers
- Newton's method in mixed precision
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
- A Note on Inexact Inner Products in GMRES
- A Class of Fast and Accurate Summation Algorithms
- Random matrices generating large growth in LU factorization with pivoting
- 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
- Squeezing a Matrix into Half Precision, with an Application to Solving Linear Systems
- A New Approach to Probabilistic Rounding Error Analysis
- Simulating Low Precision Floating-Point Arithmetic
- Three-precision GMRES-based iterative refinement for least squares problems
- Generating extreme-scale matrices with specified singular values or condition number
- 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
- Multistage mixed precision iterative refinement
- Mixed precision algorithms in numerical linear algebra
- Convergence Analysis of a Mixed Precision Parareal Algorithm
- Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning
- A mixed precision LOBPCG algorithm
- Five-Precision GMRES-Based Iterative Refinement
- Acceleration of iterative refinement for singular value decomposition
- Adaptive Precision Sparse Matrix–Vector Product and Its Application to Krylov Solvers
- Numerical stability of algorithms at extreme scale and low precisions
- Combining sparse approximate factorizations with mixed-precision iterative refinement
- Avoiding breakdown in incomplete factorizations in low precision arithmetic
- Rounding-error analysis of multigrid V-cycles
- Newton's method in three precisions
- A stochastic simulation algorithm with iterative refinement for solving integral equations related to an inverse problem for the wave equation
- Developing robust incomplete Cholesky factorizations in half precision arithmetic
- Speeding up fermionic lattice calculations with photonic accelerated inverters
- Mixed precision sketching for least-squares problems and its application in GMRES-based iterative refinement
- Sparse linear least-squares problems
- Stable iterative refinement for solving linear systems with inaccurate computation
- Combining randomized and deterministic iterative algorithms for high accuracy solution of large linear systems and boundary integral equations
- A mixed precision Jacobi SVD algorithm
- An integer arithmetic-based AMG preconditioned FGMRES solver
- A comparison of mixed precision iterative refinement approaches for least-squares problems
- Method for verifying solutions of sparse linear systems with general coefficients
- Full operator preconditioning and the accuracy of solving linear systems
- Accelerating simulations of turbulent flows over waves leveraging GPU parallelization
- Generalizing random butterfly transforms to arbitrary matrix sizes
- Code generation for solving and differentiating through convex optimization problems
- A mixed precision algorithm for the matrix square root
- Newton-Based Mixed Precision Iterative Refinement for Large-Scale Sparse Continuous-Time Algebraic Riccati Equations
- Convergence and mixed-precision preconditioning for the naive Jacobi eigenvalue algorithm
- When a positive SIMP density floor is not enough: solver admissibility and guarded floor selection in matrix-free 3D topology optimization
- Stable algorithms for general linear systems by preconditioning the normal equations
- An extension of C++ with memory-centric specifications for HPC to reduce memory footprints and streamline MPI development
- Blas-based mixed precision block memory accessor with applications to sparse direct solvers
- A modular framework for the backward error analysis of GMRES
- Random walk on boundary with iterative refinement for solving interior Dirichlet and exterior Neumann problems for the modified Helmholtz equation
- Mixed-precision fully-connected tensor network decomposition
- Mixed-Precision Computing for Scientific Discovery: Formats, Co-Design, and Responsible Approximation
- A Mixed-Precision Model for Matrix-Splitting Methods
- Using FGMRES to obtain backward stability in mixed precision
This page was built for publication: Accelerating the solution of linear systems by iterative refinement in three precisions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4610143)
