Skip to main content
SpringerLink
Log in

On a fast and accurate method for computing Fourier transforms

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

In this paper, a variable order method for the fast and accurate computation of the Fourier transform is presented. The increase in accuracy is achieved by applying corrections to the trapezoidal sum approximations obtained by the FFT method. It is shown that the additional computational work involved is of orderK(2m+2), wherem is a small integer andK≤n. Analytical expressions for the associated error is also given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. O. Brigham,The Fast Fourier Transform Prentice-Hall, Englewood Cliffs, N.J., 1974.

    Google Scholar 

  2. P. C. Chakravarti,Integrals and Sums The Athlone Press, London, 1970.

    Google Scholar 

  3. J. W. Cooley and J. W. Tukey,An algorithm for the machine calculation of complex Fourier series. Mathematics of Computation, 19(90) (1965), pp. 297–301.

    Google Scholar 

  4. P. J. Davis and P. Rabinowitz,Methods of Numerical Integration. Academic Press, New York, 1984.

    Google Scholar 

  5. L. N. G. Filon.On a quadrature formula for trigonometric integrals. Proc. Roy. Soc. Edinburgh, 49 (1928), pp. 38–47.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics & Statistics, McMasters University, L8N 3Z5, Hamilton, Ontario, Canada

    P. C. Chakravarti

  2. Intestinal Disease Research Unit and Department of Electrical & Comp. Engineering, McMasters University, L8N 3Z5, Hamilton, Ontario, Canada

    M. Barrientos

Authors
  1. P. C. Chakravarti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Barrientos
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chakravarti, P.C., Barrientos, M. On a fast and accurate method for computing Fourier transforms. BIT 34, 205–214 (1994). https://doi.org/10.1007/BF01955868

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01955868

AMS subject classification

Key words

Search

Navigation