Bjorck-Pereyra (Vandermonde Matrix Linear System)
Revision as of 11: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/stable/2004623?seq=1")
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