Metraipolis › archive › dc_4b34414546eb
Adaptive accuracy-driven splitting in Ozaki matrix multiplication and application to block LU factorization — arXiv:2611.03158
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.03158
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:48:40.415Z
- SHA-256 of the archived text
0b9a24ec53dff780e40871bc09f0bdc60f80a1a3da292b65e93182bccadcb174- Stable URL of this page
https://metraipolis.com/documento/dc_4b34414546eb
How to cite
Adaptive accuracy-driven splitting in Ozaki matrix multiplication and application to block LU factorization — arXiv:2611.03158 — arXiv (en), https://arxiv.org/abs/2611.03158 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4b34414546eb (Metraipolis archive dc_4b34414546eb, sha256 0b9a24ec53dff780e40871bc09f0bdc60f80a1a3da292b65e93182bccadcb174)
BibTeX
@misc{dc4b34414546eb,
title = {Adaptive accuracy-driven splitting in Ozaki matrix multiplication and application to block LU factorization — arXiv:2611.03158},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.03158},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4b34414546eb; sha256 0b9a24ec53dff780e40871bc09f0bdc60f80a1a3da292b65e93182bccadcb174},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03158. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The Ozaki scheme for matrix multiplication computes an accurate matrix product by splitting the input matrices and evaluating a sequence of low-precision matrix products. Its accuracy and computational cost depend strongly on the number of splits. We develop accuracy-driven criteria for selecting this number in both Ozaki matrix multiplication and in block LU factorization using Ozaki trailing updates. For matrix multiplication, we derive normwise and componentwise criteria that determine how many split products are required to achieve a given accuracy requirement. For block LU, we present a fixed normwise strategy with essentially no selection cost, an LU-aware adaptive normwise strategy that can reduce the number of splits in subsequent trailing updates, and a componentwise strategy that uses information accumulated from preceding updates to guide the later selections. In the componentwise strategy, when the required number of splits exceeds a prescribed maximum, the corresponding update is instead carried out using ordinary matrix multiplication. We also provide rigorous backward error bounds for these approaches. Numerical experiments show that the adaptive normwise strategy can reduce the number of splits while preserving normwise accuracy, whereas the componentwise strategy can provide smaller componentwise backward errors when stronger local accuracy is needed. 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/2611.03158 — 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-03T18:15:22.828Z dalla pagina https://arxiv.org/list/math.NA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).