Kelner; Orecchia; Sidford; Zhu (Inexact Laplacian Solver SDD Systems Solvers)
Jump to navigation
Jump to search
Time Complexity
$O(m \log^{2} (n)$ \log \log n)
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