A ``multigrid'' extension of the \(FFT\) for the numerical inversion of Fourier and Laplace transforms (Q2366654)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A ``multigrid'' extension of the \(FFT\) for the numerical inversion of Fourier and Laplace transforms |
scientific article |
Statements
A ``multigrid'' extension of the \(FFT\) for the numerical inversion of Fourier and Laplace transforms (English)
0 references
28 November 1993
0 references
This paper computes inversions of slowly convergent Fourier transforms \(f(\omega)\) in a prescribed accuracy by interpolating \(f(\omega)\) on an equidistant logarithmic grid. According to this algorithm, the number of arithmetic operations per computed function value is about twice as large as that for implementing ordinary algorithms for the fast Fourier transform.
0 references
inverse Fourier transforms
0 references
inverse Laplace transforms
0 references
cubic spline interpolation
0 references
equidistant logarithmic grid
0 references
fast Fourier transform
0 references
0 references
