Conjugate Gradient (Approximation? with positive definite matrix Linear System)

From Algorithm Wiki
Revision as of 10:36, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(m k^{0.5})$ == Space Complexity == $O(m)$ words (http://www.cs.cmu.edu/~quake-papers/painless-conjugate-gradient.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1952 == Reference == https://nvlpubs.nist.gov/nistpubs/jres/049/jresv49n6p409_A1b.pdf")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(m k^{0.5})$

Space Complexity

$O(m)$ words

(http://www.cs.cmu.edu/~quake-papers/painless-conjugate-gradient.pdf)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1952

Reference

https://nvlpubs.nist.gov/nistpubs/jres/049/jresv49n6p409_A1b.pdf

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Conjugate_Gradient_(Approximation%3F_with_positive_definite_matrix_Linear_System)&oldid=44557"