A mixed precision LOBPCG algorithm

The locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm is a popular approach for computing a few smallest eigenvalues and the corresponding eigenvectors of a large Hermitian positive definite matrix A . In this work, we propose a mixed precision variant of LOBPCG that uses a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Numerical algorithms Ročník 94; číslo 4; s. 1653 - 1671
Hlavní autoři: Kressner, Daniel, Ma, Yuxin, Shao, Meiyue
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.12.2023
Springer Nature B.V
Témata:
Algebra
Algorithms
Approximation
Cholesky factorization
Computer Science
Convergence
Eigenvalues
Eigenvectors
Error analysis
Impact analysis
Mathematical analysis
Matrices (mathematics)
Numeric Computing
Numerical Analysis
Numerical prediction
Original Paper
Theory of Computation
Symmetric eigenvalue problem
65F50
65F15
LOBPCG algorithm
65F08
Mixed precision algorithm
ISSN:1017-1398, 1572-9265
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm is a popular approach for computing a few smallest eigenvalues and the corresponding eigenvectors of a large Hermitian positive definite matrix A . In this work, we propose a mixed precision variant of LOBPCG that uses a (sparse) Cholesky factorization of A computed in lower precision as the preconditioner. To further enhance performance, a mixed precision orthogonalization strategy is proposed. To analyze the impact of reducing precision in the preconditioner on performance, we carry out a rounding error and convergence analysis of PINVIT, a simplified variant of LOBPCG. Our theoretical results predict and our numerical experiments confirm that the impact on convergence remains marginal. In practice, our mixed precision LOBPCG algorithm typically reduces the computation time by a factor of 1.4 – 2.0 on both CPUs and GPUs.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1017-1398
1572-9265
DOI:10.1007/s11075-023-01550-9