Abstract
Mixed-precision arithmetic offers significant computational advantages for large scale matrix computation tasks, yet preserving accuracy and stability in eigenvalue problems and the singular value decomposition remains challenging. This paper introduces an approach that eliminates orthogonalization requirements in traditional Rayleigh–Ritz projection methods. The proposed method employs nonorthogonal bases computed at reduced precision, resulting in bases computed without inner products. A primary focus is on maintaining the linear independence of the basis vectors. Through extensive evaluation with both synthetic test cases and real-world applications, we demonstrate that the proposed approach achieves the desired accuracy while fully taking advantage of mixed-precision arithmetic.
| Original language | English (US) |
|---|---|
| Pages (from-to) | B544-B568 |
| Journal | SIAM Journal on Scientific Computing |
| Volume | 48 |
| Issue number | 3 |
| DOIs | |
| State | Published - 2026 |
Bibliographical note
Publisher Copyright:© 2026 Society for Industrial and Applied Mathematics.
Keywords
- eigenvalue problem
- GPU
- mixed precision
- orthogonalization-free
- Rayleigh–Ritz
- singular value decomposition
Fingerprint
Dive into the research topics of 'MIXED-PRECISION ORTHOGONALIZATION-FREE PROJECTION METHODS FOR EIGENVALUE AND SINGULAR VALUE PROBLEMS'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS