Abstract
This chapter discusses the approximate integration over infinite intervals. It also discusses the truncation of the infinite interval. One may reduce the infinite interval to a finite interval by ignoring the tail of an integrand. Rigorous application of this method requires that the analyst be able to estimate this tail by some simple analytical device. The chapter presents an algorithm known as a Fast Fourier Transform (FFT). The algorithm is particularly useful as it offers the saving of a significant number of numerical operations over conventional methods. As a result, the FFT has gained wide acceptance in many areas of data handling and interpretation, linear system analysis, stochastic analysis, and digital signal and image processing. The FFT algorithm can be traced back to Runge. A history of the algorithm may be found in Cooley, Lewis, and Welch. The two-dimensional FFT has found wide use as a tool for image processing by digital computer and for pattern recognition.
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.
