Metraipolis › archive › dc_003ffbba54d4

Reduced and Mixed-Precision Block Householder QR Factorization — arXiv:2610.38537

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.38537
License (as archived)
CC0-1.0
Archived
2026-11-01T02:35:57.252Z
SHA-256 of the archived text
965b96b65d8d959183e2213ff37497746ac9c6409a4006828111e72be6d9b972
Stable URL of this page
https://metraipolis.com/documento/dc_003ffbba54d4

How to cite

Reduced and Mixed-Precision Block Householder QR Factorization — arXiv:2610.38537 — arXiv (en), https://arxiv.org/abs/2610.38537 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_003ffbba54d4 (Metraipolis archive dc_003ffbba54d4, sha256 965b96b65d8d959183e2213ff37497746ac9c6409a4006828111e72be6d9b972)
BibTeX
@misc{dc003ffbba54d4,
  title = {Reduced and Mixed-Precision Block Householder QR Factorization — arXiv:2610.38537},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.38537},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_003ffbba54d4; sha256 965b96b65d8d959183e2213ff37497746ac9c6409a4006828111e72be6d9b972},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.38537. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Recent advances in hardware architecture have highlighted the importance of reduced-precision arithmetic for improving performance and reducing energy consumption in large-scale scientific applications. However, uniformly low-precision methods can suffer from numerical instability, especially in fundamental linear algebra routines. Mixed-precision strategies therefore play an important role in balancing efficiency, stability, and accuracy. In this paper, we focus on the block Householder QR decomposition using the WY representation and study its behavior in reduced- and mixed-precision settings. Starting from a uniform half-precision variant, we show that performing norm computations with fp32 accumulation is necessary to avoid overflow and underflow on large matrices. Based on this observation, we introduce mpWYQR, a mixed-precision algorithm that increases the precision of only selected computations and avoids most of the precision conversions required by the existing mixed-precision blocked QR algorithm (mpBQR3) introduced in [L. M. Yang, A. Fox, and G. Sanders, SIAM J. Sci. Comp., 43.3 (2021), pp. A1723--A1753]. Our analysis shows that mpWYQR accuracy is governed by low-precision unit roundoff, and that its error bound exceeds that of mpBQR3 by only a constant factor, with identical heuristic bounds. In experiments across a range of matrix sizes and condition numbers, we show that mpWYQR retains mpBQR3 accuracy while running up to $18\times$ faster and using less memory. We also discuss the performance cost of computing inner products in higher precision, and the library support needed for an efficient GPU implementation.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.NA, nuovi lavori del giorno).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2610.38537 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-01T02:15:13.335Z dalla pagina https://arxiv.org/list/math.NA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).