Acceleration of iterative refinement for singular value decomposition
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3799843 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
- A note on \(\sin\Theta\) theorems for singular subspace variations
- Accelerating the solution of linear systems by iterative refinement in three precisions
- Accuracy and Stability of Numerical Algorithms
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Design, implementation and testing of extended and mixed precision BLAS
- Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications
- Iterative Refinement Implies Numerical Stability for Gaussian Elimination
- Iterative Refinement in Floating Point
- Iterative refinement enhances the stability of \(QR\) factorization methods for solving linear equations
- Iterative refinement for linear systems and LAPACK
- Iterative refinement for singular value decomposition based on matrix multiplication
- Iterative refinement for symmetric eigenvalue decomposition
- Iterative refinement implies numerical stability
- Mixed-precision iterative refinement using tensor cores on GPUs to accelerate solution of linear systems
- Perturbation bounds in connection with singular value decomposition
- The Rotation of Eigenvectors by a Perturbation. III
- The Theory of Composites
- Updating the singular value decomposition
This page was built for publication: Acceleration of iterative refinement for singular value decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6181168)