Lee; Peng; Spielman (Inexact Laplacian Solver SDD Systems Solvers)

From Algorithm Wiki
Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n)$ words (Derived: Uses an auxiliary sparse Cholesky decomposition which has $O(n)$ non-zero entries) == Description == Recursive algorithm with sparse Cholesky factorization of Laplacian == Approximate? == Approximate Approximation Factor: The sparse Cholesky decomposition is a 2-approximation == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2015 == Reference...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

$O(n)$ words

(Derived: Uses an auxiliary sparse Cholesky decomposition which has $O(n)$ non-zero entries)

Description

Recursive algorithm with sparse Cholesky factorization of Laplacian

Approximate?

Approximate

Approximation Factor: The sparse Cholesky decomposition is a 2-approximation

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2015

Reference

https://arxiv.org/abs/1506.08204

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Lee;_Peng;_Spielman_(Inexact_Laplacian_Solver_SDD_Systems_Solvers)&oldid=45277"