Gremban; Miller; Zagha (Inexact Laplacian Solver SDD Systems Solvers)

From Algorithm Wiki

Revision as of 07:56, 10 April 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n^{2})$ words (https://www.cs.cmu.edu/~glmiller/Publications/Papers/GrMiZa94-tr.pdf) == Description == Support Tree Conjugate Gradients (STCG) == Approximate? == Approximate Approximation Factor: ? == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1995 == Reference == https://www.cs.cmu.edu/~glmiller/Publications/Papers/GrMiZa94-tr.pdf")

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

Jump to navigation Jump to search

Time Complexity

$O(n^{2})$

Space Complexity

$O(n^{2})$ words

(https://www.cs.cmu.edu/~glmiller/Publications/Papers/GrMiZa94-tr.pdf)

Description

Support Tree Conjugate Gradients (STCG)

Approximate?

Approximate

Approximation Factor: ?

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1995

Reference

https://www.cs.cmu.edu/~glmiller/Publications/Papers/GrMiZa94-tr.pdf

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Gremban;_Miller;_Zagha_(Inexact_Laplacian_Solver_SDD_Systems_Solvers)&oldid=47018"