5-point ADI iteration (2-Dimensional Poisson Problem Poisson Problem)

From Algorithm Wiki
Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2} log^{2}n)$ == Space Complexity == $O(n^{2})$? words (Generally uses a constant number of n^2*n^2 matrices where O(n^2) entries are nonempty) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM? == Year == 1955 == Reference ==")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

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

Space Complexity

$O(n^{2})$? words

(Generally uses a constant number of n^2*n^2 matrices where O(n^2) entries are nonempty)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM?

Year

1955

Reference