Rounding Error Analysis of Mixed Precision Block Householder QR Algorithms
From MaRDI portal
Publication:4997375
DOI10.1137/19M1296367OpenAlexW3162768929MaRDI QIDQ4997375
L. Minah Yang, Alyson L. Fox, Geoffrey Sanders
Publication date: 29 June 2021
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.06217
Iterative numerical methods for linear systems (65F10) Roundoff error (65G50) Orthogonalization in numerical linear algebra (65F25) Preconditioners for iterative methods (65F08)
Related Items (8)
Mixed precision algorithms in numerical linear algebra ⋮ Mixed-precision explicit stabilized Runge-Kutta methods for single- and multi-scale differential equations ⋮ Generation matrix: an embeddable matrix representation for hierarchical trees ⋮ Probabilistic Rounding Error Analysis of Householder QR Factorization ⋮ Double precision is not necessary for LSQR for solving discrete linear ill-posed problems ⋮ GMRES algorithms over 35 years ⋮ Block Gram-Schmidt algorithms and their stability properties ⋮ PACF: a precision-adjustable computational framework for solving singular values
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Backward error analysis of the AllReduce algorithm for Householder QR decomposition
- Fast linear algebra is stable
- Communication-optimal Parallel and Sequential QR and LU Factorizations
- Mixed Precision Block Fused Multiply-Add: Error Analysis and Application to GPU Tensor Cores
- The WY Representation for Products of Householder Matrices
- A Storage-Efficient $WY$ Representation for Products of Householder Transformations
- LAPACK Users' Guide
- Probabilistic Error Analysis for Inner Products
- A New Approach to Probabilistic Rounding Error Analysis
- Simulating Low Precision Floating-Point Arithmetic
- Unitary Triangularization of a Nonsymmetric Matrix
This page was built for publication: Rounding Error Analysis of Mixed Precision Block Householder QR Algorithms
