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

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 12:1512:15, 15 February 2023‎ Admin talk contribs‎ 513 bytes +513‎ 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..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Lee;_Peng;_Spielman_(Inexact_Laplacian_Solver_SDD_Systems_Solvers)"