Timeline for Solving Poisson-like PDE with FFT
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 16, 2021 at 3:07 | vote | accept | programjames | ||
| Jul 15, 2021 at 21:00 | comment | added | programjames | Aha! I found a paper with what I need: hal.archives-ouvertes.fr/hal-02010640/document. Except it uses the GMRES method, which is iterative. | |
| Jul 15, 2021 at 2:05 | answer | added | programjames | timeline score: 1 | |
| Jul 14, 2021 at 16:07 | comment | added | programjames | I looked into solving outrigger systems, and for my particular equation it would run in $O(n^3)$ time. It might be fast enough, but I would prefer an $O(n^2\log n)$ algorithm if I can find one. | |
| Jul 14, 2021 at 15:47 | comment | added | programjames | @MaximUmansky that looks promising, but eq. (2) has diagonals that aren't all in one band. This answer has more info on solving this specific problem. I'll look into it. | |
| Jul 14, 2021 at 15:34 | comment | added | programjames | I'm using Neumann boundary conditions. | |
| Jul 14, 2021 at 15:14 | comment | added | Bort | I think you lack boundary conditions. | |
| Jul 14, 2021 at 5:06 | comment | added | Maxim Umansky | Spectral methods are best suited for linear problems with constant coefficients. If there is a spatially dependent coefficient then you could use spectral methods by expanding this coefficient in a Fourier series and then use convolutions but that's a pain. However, Eq. (2) is a five-diagonal linear system, and I thought for those the scaling of operation count is linear with the size, e.g., see discussion in 12000.org/my_notes/penta_diagonal_solver_in_matlab/index.htm | |
| Jul 14, 2021 at 4:27 | history | edited | programjames | CC BY-SA 4.0 |
deleted 24 characters in body
|
| Jul 14, 2021 at 3:04 | review | First posts | |||
| Jul 14, 2021 at 12:39 | |||||
| Jul 14, 2021 at 3:02 | history | asked | programjames | CC BY-SA 4.0 |