New recursive preconditioning algorithms solve k-well-conditioned linear systems and regressions in Õ(d² + k^ω) time, matching the conditional lower bound and yielding the first nearly-linear-time nuclear norm approximation.
On the rate of convergence of the preconditioned conjugate gradient method
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure
New recursive preconditioning algorithms solve k-well-conditioned linear systems and regressions in Õ(d² + k^ω) time, matching the conditional lower bound and yielding the first nearly-linear-time nuclear norm approximation.