A randomized inverse-free divide-and-conquer solver for definite matrix pencils preserves definiteness under structured perturbations and reduces the worst-case complexity to O(n^omega0 log(n/epsilon) log(log(n/epsilon) + log(n) log(gamma^{-1}))).
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Structured Divide-and-Conquer for the Definite Generalized Eigenvalue Problem
A randomized inverse-free divide-and-conquer solver for definite matrix pencils preserves definiteness under structured perturbations and reduces the worst-case complexity to O(n^omega0 log(n/epsilon) log(log(n/epsilon) + log(n) log(gamma^{-1}))).