A Mixed Precision Jacobi SVD Algorithm
ACM Transactions on Mathematical Software · 31.03.2025 · 51 (1) · 1-33
DOI: 10.1145/3721124 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Mathematical Software, online erschienen am 04.04.2025. Verfasst von Weiguo Gao und 2 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 33 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Key R&D Program of China.
Abstract (Originalsprache)
We propose a mixed precision Jacobi algorithm for computing the singular value decomposition (SVD) of a dense matrix. After appropriate preconditioning, the proposed algorithm computes the SVD in a lower precision as an initial guess and then performs one-sided Jacobi rotations in the working precision as iterative refinement. By carefully transforming a lower precision solution to a higher precision one, our algorithm achieves about \(2\times\) speedup on the x86-64 architecture compared to the usual one-sided Jacobi SVD algorithm in LAPACK, without sacrificing the accuracy.
Förderung
- National Key R&D Program of China
Zitieren
APA
Gao, W., Ma, Y., & Shao, M. (2025). A Mixed Precision Jacobi SVD Algorithm. ACM Transactions on Mathematical Software, 51(1), 1-33. https://doi.org/10.1145/3721124
Vancouver
Gao W, Ma Y, Shao M. A Mixed Precision Jacobi SVD Algorithm. ACM Transactions on Mathematical Software. 2025;51(1):1-33. doi:10.1145/3721124
BibTeX
@article{Gao2025,
author = {Gao, Weiguo and Ma, Yuxin and Shao, Meiyue},
title = {A Mixed Precision Jacobi SVD Algorithm},
journal = {ACM Transactions on Mathematical Software},
year = {2025},
volume = {51},
number = {1},
pages = {1--33},
doi = {10.1145/3721124}
}
EUVIMED