Timeline for Fast computation of convolution integral of a gaussian function
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 16, 2021 at 8:06 | vote | accept | NN2 | ||
| Jul 15, 2021 at 21:07 | comment | added | Tom Copeland | Check Wikipedia. Bracewell's The Fourier Transform and its Applications is a good resource for coming up to speed on the topic. | |
| Jul 15, 2021 at 20:58 | comment | added | NN2 | @TomCopeland Thank you very much for the advice, what is the Shannon-Nyquist sampling theorem used for? I apply it after using FFT to improve the accuracy? | |
| Jul 15, 2021 at 20:39 | answer | added | Carlo Beenakker | timeline score: 5 | |
| Jul 15, 2021 at 20:37 | history | edited | NN2 | CC BY-SA 4.0 |
added 266 characters in body
|
| Jul 15, 2021 at 20:37 | comment | added | Tom Copeland | Won't the Fourier transform convolution theorem along with the Shannon-Nyquist sampling theorem give you what you want? | |
| Jul 15, 2021 at 20:30 | history | asked | NN2 | CC BY-SA 4.0 |