Boman; 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 == $\tilde{O}(mn^{({1}/{2})})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: \epsilon == Randomized? == No, deterministic == Model of Computation == == Year == 2003 == Reference == https://epubs.siam.org/doi/10.1137/S0895479801390637")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$\tilde{O}(mn^{({1}/{2})})$

Space Complexity

()

Description

Approximate?

Approximate

Approximation Factor: \epsilon

Randomized?

No, deterministic

Model of Computation

Year

2003

Reference

https://epubs.siam.org/doi/10.1137/S0895479801390637