Kelner; Orecchia; Sidford; Zhu (Inexact Laplacian Solver SDD Systems Solvers)
Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(m log^{2} (n)$ loglogn) == Space Complexity == $O(n)$ words (Derived: Uses a spanning tree of the graph that the Laplacian is for) == Description == Low-stretch spanning tree == Approximate? == Approximate Approximation Factor: \epsilon == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2013 == Reference == https://arxiv.org/pdf/1301.6628.pdf")
Time Complexity
$O(m log^{2} (n)$ loglogn)
Space Complexity
$O(n)$ words
(Derived: Uses a spanning tree of the graph that the Laplacian is for)
Description
Low-stretch spanning tree
Approximate?
Approximate
Approximation Factor: \epsilon
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2013