Blelloch; Koutis; Miller; Tangwongsan (Inexact Laplacian Solver SDD Systems Solvers)

From Algorithm Wiki

Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (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")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Blelloch;_Koutis;_Miller;_Tangwongsan_(Inexact_Laplacian_Solver_SDD_Systems_Solvers)&oldid=45274"