Mixed-Precision Orthogonalization-Free Projection Methods for Eigenvalue and Singular Value Problems

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 (SVD) remains challenging. This paper introduces an approach that eliminates orthogonalization requirements in traditional Rayleigh-Ritz projection methods. The proposed method employs non-orthogonal 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.

Authors

Institutions

Publication Details

Journal
SIAM Journal on Scientific Computing
Published
2026-06-19
DOI
https://doi.org/10.1137/25m1756922
Primary Topic
Matrix Theory and Algorithms
Type
preprint
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Mixed-Precision Orthogonalization-Free Projection Methods for Eigenvalue and Singular Value Problems

Yousef Saad, Yuanzhe Xi, Jie Chen, Tianshi Xu
SIAM Journal on Scientific Computing
Matrix Theory and Algorithms
preprint

Mixed-Precision Orthogonalization-Free Projection Methods for Eigenvalue and Singular Value Problems

Yousef Saad, Yuanzhe Xi, Jie Chen, Tianshi Xu
preprint en

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 (SVD) remains challenging. This paper introduces an approach that eliminates orthogonalization requirements in traditional Rayleigh-Ritz projection methods. The proposed method employs non-orthogonal 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.

SIAM Journal on Scientific ComputingVol. 48(3)
University of Minnesota (US), IBM (United States) (US), Emory University (US)
National Science Foundation
Openalex Percentile: Top 98%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Mixed-Precision Orthogonalization-Free Projection Methods for Eigenvalue and Singular Value Problems — Yousef Saad, Yuanzhe Xi, et al. · SIAM Journal on Scientific Computing (2026) | TGRS Research Map | TGRS