9-point ADI iteration (2-Dimensional Poisson Problem Poisson Problem): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n^{2} logn)$ == Space Complexity == $O(n^{2})$? words (Generally uses a constant number of n^2*n^2 matrices where O(n^2) entries are nonempty) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM? == Year == 1965 == Reference ==") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n^{2} | $O(n^{2} \log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 09:43, 10 April 2023
Time Complexity
$O(n^{2} \log n)$
Space Complexity
$O(n^{2})$? words
(Generally uses a constant number of n^2*n^2 matrices where O(n^2) entries are nonempty)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Real RAM?
Year
1965