A randomized algorithm produces an HSS approximation with expected error at most O(log(N/k)) times optimal, using O(k log(N/k)) matrix-vector products.
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
-
Quasi-optimal hierarchically semi-separable matrix approximation
A randomized algorithm produces an HSS approximation with expected error at most O(log(N/k)) times optimal, using O(k log(N/k)) matrix-vector products.