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

From Algorithm Wiki

Revision as of 08:43, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

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

Space Complexity

$O(n^{2})$? 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

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=5-point_FFT_(2-Dimensional_Poisson_Problem_Poisson_Problem)&oldid=47423"