Blelloch; Koutis; Miller; Tangwongsan (Inexact Laplacian Solver SDD Systems Solvers): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n logn)$ == 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/document/5644892") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n | $O(n \log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
m + $O(n/log n)$ words | m + $O(n/\log n)$ words | ||
(https://www.cs.cmu.edu/afs/cs.cmu.edu/Web/People/jkoutis/papers/SC10-paper.pdf) | (https://www.cs.cmu.edu/afs/cs.cmu.edu/Web/People/jkoutis/papers/SC10-paper.pdf) | ||
Latest revision as of 07:56, 10 April 2023
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