Bern; Gilbert; Hendrickson (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 loglogn)$ == Space Complexity == () == Description == Support Graph Preconditioning == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2006 == Reference == https://dl.acm.org/citation.cfm?id=1117896")

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

Jump to navigation Jump to search

Time Complexity

$O(n loglogn)$

Space Complexity

()

Description

Support Graph Preconditioning

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

2006

Reference

https://dl.acm.org/citation.cfm?id=1117896

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Bern;_Gilbert;_Hendrickson_(Inexact_Laplacian_Solver_SDD_Systems_Solvers)&oldid=45269"