Boman; Chen; Hendrickson; Toledo (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 log({1}/ϵ)$ ) == Space Complexity == $O(n)$ words (Derived: The preconditioners used have $O(n)$ non-zero entries) == Description == Maximum-weight-basis (MWB) preconditioners == Approximate? == Approximate Approximation Factor: \epsilon == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2004 == Reference == https://onlinelibrary.wiley.com/doi/abs/10.1002/nla.343")

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

Jump to navigation Jump to search

Time Complexity

$O(n log({1}/ϵ)$ )

Space Complexity

$O(n)$ words

(Derived: The preconditioners used have $O(n)$ non-zero entries)

Description

Maximum-weight-basis (MWB) preconditioners

Approximate?

Approximate

Approximation Factor: \epsilon

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2004

Reference

https://onlinelibrary.wiley.com/doi/abs/10.1002/nla.343

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Boman;_Chen;_Hendrickson;_Toledo_(Inexact_Laplacian_Solver_SDD_Systems_Solvers)&oldid=45271"