Bjorck-Pereyra (Vandermonde Matrix Linear System)

From Algorithm Wiki

Revision as of 10:32, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n^{2})$ total words (can be easily derived (lower bounded by input size, upper bounded by runtime)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1970 == Reference == https://www-jstor-org.ezproxy.canberra.edu.au/stable/2004623?seq=1")

(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})$ total words

(can be easily derived (lower bounded by input size, upper bounded by runtime))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1970

Reference

https://www-jstor-org.ezproxy.canberra.edu.au/stable/2004623?seq=1

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Bjorck-Pereyra_(Vandermonde_Matrix_Linear_System)&oldid=44410"