Boman; Chen; Hendrickson; Toledo (Inexact Laplacian Solver SDD Systems Solvers): Difference between revisions
Jump to navigation
Jump to search
(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") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n log({1}/ϵ)$ ) | $O(n \log({1}/ϵ)$ ) | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 07:56, 10 April 2023
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