Blelloch; Koutis; Miller; Tangwongsan (Inexact Laplacian Solver SDD Systems Solvers)
Jump to navigation
Jump to search
Time Complexity
$O(n \log n)$
Space Complexity
m + $O(n/\log n)$ words
(https://www.cs.cmu.edu/afs/cs.cmu.edu/Web/People/jkoutis/papers/SC10-paper.pdf)
Description
Combinatorial multigrid
Approximate?
Approximate
Approximation Factor: ?
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2010
Reference
https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/document/5644892