5-point star Cramer's rule (2-Dimensional Poisson Problem Poisson Problem)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O({4}^{(n^{2})})$

Space Complexity

$O({4}^{(n^{2})})$ for sure, $O(n^{2})$ possibly??? (if super conservative) words

(For expansion by minors, each "level" of expansion requires computing and storing O(1) smaller determinants, and there are O(n^2) levels overall)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM?

Year

1945

Reference