A new subspace algorithm using LOBPCG-style subspaces detects definiteness of large Hermitian matrix pairs (A,B) with indefinite B faster than prior methods on medium, large, and banded cases.
Trace minimization principles for positive semi-definite pencils
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An indefinite LOBPCG type of algorithm for detecting a definite Hermitian matrix pair
A new subspace algorithm using LOBPCG-style subspaces detects definiteness of large Hermitian matrix pairs (A,B) with indefinite B faster than prior methods on medium, large, and banded cases.