Bern; Gilbert; Hendrickson (Inexact Laplacian Solver SDD Systems Solvers): Difference between revisions
Jump to navigation
Jump to search
(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") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n | $O(n \log \log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 07:56, 10 April 2023
Time Complexity
$O(n \log \log n)$
Space Complexity
()
Description
Support Graph Preconditioning
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
2006