All public logs

Combined display of all available logs of Algorithm Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 11:15, 15 February 2023 Admin talk contribs created page Lee; Peng; Spielman (Inexact Laplacian Solver SDD Systems Solvers) (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...")