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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.NA 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A scaling technique allows three-term recurrence iterations to preserve dissipation in energy-based models by guaranteeing a positive definite symmetric part in the iteration matrix.
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.
-
Three-term recurrence iterations for energy-based models
A scaling technique allows three-term recurrence iterations to preserve dissipation in energy-based models by guaranteeing a positive definite symmetric part in the iteration matrix.