Timeline for Computing a 2D Fourier transform on a disk
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 16, 2015 at 22:20 | comment | added | Gil | What about Donoho's pseudo polar Fourier transforms? These algorithms work well. | |
| Nov 9, 2013 at 3:49 | history | edited | Michael Hardy | CC BY-SA 3.0 |
added 3 characters in body
|
| Nov 8, 2013 at 17:28 | comment | added | Andrei MF | @Carl The formulas that the ENZ theory gets using Zernike polynomials involve evaluation of infinite series of Bessel functions times certain binomial coefficients. Moreover, the terms of these sums are sign-changing and occasionally of similar size, thus cancellation errors might become a problem. | |
| Nov 8, 2013 at 16:45 | comment | added | user25199 | Sorry - you're right, though it might still simplify if you express $f$ as a Fourier series in $\theta$. Why are the Zernike polynomials unsatisfactory? | |
| Nov 8, 2013 at 15:33 | comment | added | Andrei MF | @Carl I think so, $\phi$ is sitting in the cosine (argument of the exponential). | |
| Nov 8, 2013 at 9:04 | comment | added | user25199 | Does your integral actually depend on $\phi$? | |
| Nov 7, 2013 at 23:43 | history | asked | Andrei MF | CC BY-SA 3.0 |