2-Dimensional Poisson Problem: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:2-Dimensional Poisson Problem (Poisson Problem)}} == Description == Given $f$, solve for $u$ in the 2-dimensional Poisson equation: $u_{xx} + u_{yy} = f(x,y)$ == Related Problems == Related: 3-Dimensional Poisson Problem == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | ...") |
No edit summary |
||
Line 48: | Line 48: | ||
|} | |} | ||
== Time Complexity | == Time Complexity Graph == | ||
[[File:Poisson Problem - 2-Dimensional Poisson Problem - Time.png|1000px]] | [[File:Poisson Problem - 2-Dimensional Poisson Problem - Time.png|1000px]] | ||
== Space Complexity | == Space Complexity Graph == | ||
[[File:Poisson Problem - 2-Dimensional Poisson Problem - Space.png|1000px]] | [[File:Poisson Problem - 2-Dimensional Poisson Problem - Space.png|1000px]] | ||
== Pareto | == Pareto Frontier Improvements Graph == | ||
[[File:Poisson Problem - 2-Dimensional Poisson Problem - Pareto Frontier.png|1000px]] | [[File:Poisson Problem - 2-Dimensional Poisson Problem - Pareto Frontier.png|1000px]] |
Revision as of 14:04, 15 February 2023
Description
Given $f$, solve for $u$ in the 2-dimensional Poisson equation:
$u_{xx} + u_{yy} = f(x,y)$
Related Problems
Related: 3-Dimensional Poisson Problem
Parameters
No parameters found.
Table of Algorithms
Name | Year | Time | Space | Approximation Factor | Model | Reference |
---|---|---|---|---|---|---|
5-point star Cramer's rule | 1945 | $O({4}^{(n^{2})})$ | $O({4}^{(n^{2})})$ for sure, $O(n^{2})$ possibly??? (if super conservative) | Exact | Deterministic | |
5-point Gauss elimination | 1945 | $O(n^{4})$ | $O(n^{4})$ | Exact | Deterministic | |
5-point Gauss Seidel iteration | 1945 | $O(n^{4} logn)$ | $O(n^{2})$? | Exact | Deterministic | |
5-point SOR iteration | 1954 | $O(n^{3} logn)$ | $O(n^{2})$? | Exact | Deterministic | |
5-point ADI iteration | 1955 | $O(n^{2} log^{2}n)$ | $O(n^{2})$? | Exact | Deterministic | |
9-point SOR iteration | 1956 | $O(n^{3})$ | $O(n^{2})$? | Exact | Deterministic | |
9-point Tensor product | 1964 | $O(n^{3})$ | $O(n^{2})$? | Exact | Deterministic | Time |
9-point ADI iteration | 1965 | $O(n^{2} logn)$ | $O(n^{2})$? | Exact | Deterministic | |
5-point FFT | 1965 | $O(n^{2} logn)$ | $O(n^{2})$? | Exact | Deterministic | |
9-point ADI iteration + smooth guess | 1969 | $O(n^{2} logn)$ | $O(n^{2})$? | Exact | Deterministic | |
5-point cyclic reduction | 1970 | $O(n^{2} logn)$ | $O(n^{2})$? | Exact | Deterministic | |
9-point FFT | 1978 | $O(n^{2} logn)$ | $O(n^{2})$? | Exact | Deterministic |
Time Complexity Graph
Error creating thumbnail: Unable to save thumbnail to destination
Space Complexity Graph
Error creating thumbnail: Unable to save thumbnail to destination
Pareto Frontier Improvements Graph
Error creating thumbnail: Unable to save thumbnail to destination