Bjorck-Pereyra (Vandermonde Matrix Linear System)

From Algorithm Wiki
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/stable/2004623?seq=1