Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • 13 - Trigonometric Interpolation and the Fast Fourier Transform

  • from Part II - Constructive Approximation Theory
  • Abner J. Salgado, University of Tennessee, Knoxville, Steven M. Wise, University of Tennessee, Knoxville
  • Book:
    Classical Numerical Analysis
    Published online:
    29 September 2022
    Print publication:
    20 October 2022, pp 345-371

  • Summary

    This chapter begins with the study of trigonometric interpolation and the discrete Fourier transform. As a first application, the numerical integration of periodic functions is discussed. More detailed topics, like existence and uniqueness of trigonometric interpolants, as well as alias as convergence of trigonometric interpolation are discussed. An important practical tool, the fast Fourier transform (FFT) is then introduced. With this at hand the most rudimentary ideas of signal processing are presented.