Daitch; Spielman (Inexact Laplacian Solver SDD Systems Solvers)
Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (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....")
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