5-point FFT (2-Dimensional Poisson Problem Poisson Problem)
Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2} logn)$ == 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 ==")
Time Complexity
$O(n^{2} logn)$
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