Daitch; Spielman (Inexact Laplacian Solver SDD Systems Solvers): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n^{5/4} (log^{2} (n)$ loglogn)^{3/4} log({1}/ϵ)) == Space Complexity == $O(n)$ words (Derived: Uses an auxiliary sparse Cholesky decomposition which has $O(n)$ non-zero entries) == Description == Support Theory (Trusses and Stiffness Matrices) == Approximate? == Approximate Approximation Factor: \epsilon == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2007 == Reference == https://arxiv....") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n^{5/4} (log^{2} (n)$ | $O(n^{5/4} (\log^{2} (n)$ \log\log n)^{3/4} \log({1}/ϵ)) | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 07:56, 10 April 2023
Time Complexity
$O(n^{5/4} (\log^{2} (n)$ \log\log n)^{3/4} \log({1}/ϵ))
Space Complexity
$O(n)$ words
(Derived: Uses an auxiliary sparse Cholesky decomposition which has $O(n)$ non-zero entries)
Description
Support Theory (Trusses and Stiffness Matrices)
Approximate?
Approximate
Approximation Factor: \epsilon
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2007