Timeline for Context for this discrete Cauchy integral formula
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 26, 2021 at 18:35 | comment | added | Carlo Beenakker | this MO posting addresses a similar correspondence: mathoverflow.net/a/350028/11260 | |
| Feb 26, 2021 at 17:20 | comment | added | Anurag Sahay | I might be wrong, but my understanding was that one of the basic applications of the Fast Fourier transform (which is just an algorithm to do DFT fast on a computer) is precisely to make use of (1) in settings where evaluation of a polynomial function is easy, but you want to compute things related to the coefficients. The standard example is probably integer arithmetic on computers -- look up the basic fast integer multiplication algorithms a la Schönhage-Strassen. | |
| Feb 26, 2021 at 16:40 | comment | added | Carlo Beenakker | isn't this a well-known connection? see Taylor and Fourier series are the same | |
| Feb 26, 2021 at 16:26 | history | asked | Yly | CC BY-SA 4.0 |