5-point FFT (2-Dimensional Poisson Problem Poisson Problem)
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