5-point FFT (3-Dimensional Poisson Problem Poisson Problem)

From Algorithm Wiki
Revision as of 11:52, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3} logn)$ == Space Complexity == $O(n^{3})$? words (FFT generally requires aux. space equal to dimension of vector?) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM? == Year == 1965 == Reference ==")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{3} logn)$

Space Complexity

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

(FFT generally requires aux. space equal to dimension of vector?)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM?

Year

1965

Reference