Fourier Transforms on the Line and in Space

  • Yves Nievergelt

Abstract

This chapter introduces a few features of the Fourier transform, mainly for its use in the design of Daubechies’ continuous, compactly supported, orthogonal wavelets. The principal use of the Fourier transform in the design of wavelets will consist in transforming “convolutions” of functions into ordinary multiplications of functions, which allow for an analysis easier than with convolutions. The material presented here involves mostly calculus, with only a few results with brief statements—such as Fubini’s theorem on the permutation of the order of multiple integrals [12, pp. 65-66], [21, pp. 384-388], [28, pp. 226-239]—borrowed from the literature in mathematical real analysis and complex analysis.

Keywords

Fourier Transform Weight Function Integrable Function Inverse Fourier Transform Approximate Identity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1999

Authors and Affiliations

  • Yves Nievergelt
    • 1
  1. 1.Department of MathematicsEastern Washington UniversityCheneyUSA

Personalised recommendations