Koutis; Miller and Peng (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 == $\tilde{O}(m log n)$ == Space Complexity == $O(n)$ words (Derived: Uses an auxiliary chain of graphs, which can be kept track of with a single spanning tree) == Description == Incremental sparsifier == Approximate? == Approximate Approximation Factor: \epsilon == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2010 == Reference == https://arxiv.org/abs/1102.4842")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$\tilde{O}(m log n)$

Space Complexity

$O(n)$ words

(Derived: Uses an auxiliary chain of graphs, which can be kept track of with a single spanning tree)

Description

Incremental sparsifier

Approximate?

Approximate

Approximation Factor: \epsilon

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2010

Reference

https://arxiv.org/abs/1102.4842

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Koutis;_Miller_and_Peng_(Inexact_Laplacian_Solver_SDD_Systems_Solvers)&oldid=45272"