ISSN:
1572-9125
Keywords:
65R10
;
42A04
;
65B20
;
65D07
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01990346
Permalink