Abstract
An algorithm for accurate numerical inversion of slowly convergent Fourier and Laplace Transforms is studied. It makes use of several equidistant grids with the same number of points, covering different symmetric intervals of the time and frequency axes. Typically, the number of operations per computed function value is about twice as large as for an ordinary FFT. The distribution of points is, however, for many applications much more adequate because, globally, the union of the grids is an approximately equidistant point set on a logarithmic scale.
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.
