Adaptive accuracy-driven splitting in Ozaki matrix multiplication and application to block LU factorization
Abstract
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.
Related
- A factorization-dependent Landauer bound for multiplication, and why it cannot be exploited
- Toeplitz multiplication and graded factorization of determinant recurrences
- Splitting singular fibers with periodic monodromies and their monodromy factorization
- Singularities of Non-negative Matrix Factorization and their application to Bayesian inference
- Simultaneous Matrix-Free HSS Compression and Factorization with Adaptive Ranks
BibTeX
@misc{carson2026adaptive,
title = {{Adaptive accuracy-driven splitting in Ozaki matrix multiplication and application to block LU factorization}},
author = {Erin Carson and Yuxin Ma},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.03158},
eprint = {2611.03158},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.03158},
}
RIS
TY - UNPB
TI - Adaptive accuracy-driven splitting in Ozaki matrix multiplication and application to block LU factorization
AU - Erin Carson
AU - Yuxin Ma
PY - 2026
DA - 2026/11/02
PB - arXiv
DO - 10.48550/arxiv.2611.03158
UR - https://arxiv.org/abs/2611.03158
AB - 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.
ER -