5-point Gauss Seidel iteration (3-Dimensional Poisson Problem Poisson Problem)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(n^{5} \log n)$

Space Complexity

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

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

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM?

Year

1945

Reference