Daitch; Spielman (Inexact Laplacian Solver SDD Systems Solvers)
Jump to navigation
Jump to search
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