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

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