Reduced and Mixed-Precision Block Householder QR Factorization
From MaRDI portal
Cites work
- A mixed precision algorithm for the matrix square root
- A mixed precision Jacobi SVD algorithm
- A Storage-Efficient WY Representation for Products of Householder Transformations
- Accuracy and Stability of Numerical Algorithms
- Block Householder transformation for parallel QR factorization
- Communication-optimal parallel and sequential QR and LU factorizations
- Efficient CP rounding using alternating least squares with QR decomposition
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- LAPACK Users' Guide
- Matrix Computations
- Mixed precision algorithms in numerical linear algebra
- Mixed precision block fused multiply-add: error analysis and application to GPU tensor cores
- Mixed-precision algorithms for solving the Sylvester matrix equation
- Probabilistic Rounding Error Analysis of Householder QR Factorization
- Rounding error analysis of mixed precision block Householder QR algorithms
- Rounding Errors in Algebraic Processes
- The WY Representation for Products of Householder Matrices
- Three-precision GMRES-based iterative refinement for least squares problems
- Unitary Triangularization of a Nonsymmetric Matrix
This page was built for publication: Reduced and Mixed-Precision Block Householder QR Factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7409130)