Abstract
In this paper we discuss the discrete Fourier transform and point out some computational problems in (mainly) complex analysis where it can be fruitfully applied. We begin by describing the elementary properties of the transform and its efficient implementation, both in the one-dimensional and in the multi-dimensional case, by the reduction formulas of Cooley, Lewis, and Welch (IBM Res, paper, 1967).The following applications are then discussed: Calculation of Fourier coefficients using attenuation factors; solution of Symm’s integral equation in numerical conformal mapping; trigonometric interpolation; determination of conjugate periodic functions and their application to Theodorsen’s integral equation for the conformal mapping of simply and of doubly connected regions; determination of Laurent coefficients with applications to numerical differentiation, generating functions, and the numerical inversion of Laplace transforms; determination of the “density” of the zeros of high degree polynomials. We then...
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
