Spielman, Teng (Inexact Laplacian Solver SDD Systems Solvers)

From Algorithm Wiki

Revision as of 07:56, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(m \log^c n)$

Space Complexity

$O(n)$ words

(Derived: Uses spanning trees and sparse Cholesky factorization which both take $O(n)$ space)

Description

Spectral Sparsification

Approximate?

Approximate

Approximation Factor: \epsilon

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2004

Reference

https://dl.acm.org/doi/pdf/10.1145/1007352.1007372?casa_token=k60CrC_UJp0AAAAA:yGVve4fRNbftRM0P7aaEbq8OIlxa4nRy8-CjZErlGrBwBfPEt0ECHGYc8Ei48rdA9W9NoY73xC2W

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Spielman,_Teng_(Inexact_Laplacian_Solver_SDD_Systems_Solvers)&oldid=47017"