About the Project

Fourier transform

AdvancedHelp

(0.003 seconds)

1—10 of 38 matching pages

1: 1.16 Distributions
§1.16(vii) Fourier Transforms of Tempered Distributions
Then its Fourier transform is … The Fourier transform ( u ) of a tempered distribution is again a tempered distribution, and …
§1.16(viii) Fourier Transforms of Special Distributions
Since 2 π ( δ ) = 1 , we have …
2: 1.14 Integral Transforms
§1.14(i) Fourier Transform
Inversion
In this subsection we let F c ( x ) = c f ( x ) , F s ( x ) = s f ( x ) , G c ( x ) = c g ( x ) , and G s ( x ) = s g ( x ) . …
Fourier Transform
where f ( x ) is given by (1.14.1). …
3: 27.17 Other Applications
§27.17 Other Applications
Reed et al. (1990, pp. 458–470) describes a number-theoretic approach to Fourier analysis (called the arithmetic Fourier transform) that uses the Möbius inversion (27.5.7) to increase efficiency in computing coefficients of Fourier series. …
4: 15.17 Mathematical Applications
Harmonic analysis can be developed for the Jacobi transform either as a generalization of the Fourier-cosine transform1.14(ii)) or as a specialization of a group Fourier transform. …
5: 15.14 Integrals
Fourier transforms of hypergeometric functions are given in Erdélyi et al. (1954a, §§1.14 and 2.14). Laplace transforms of hypergeometric functions are given in Erdélyi et al. (1954a, §4.21), Oberhettinger and Badii (1973, §1.19), and Prudnikov et al. (1992a, §3.37). …
6: Guide to Searching the DLMF
Table 1: Query Examples
Query Matching records contain
"Fourier transform" and series both the phrase “Fourier transform” and the word “series”.
Fourier (transform or series) at least one of “Fourier transform” or “Fourier series”.
1/(2pi) and "Fourier transform" both 1 / ( 2 π ) and the phrase “Fourier transform”.
7: 30.15 Signal Analysis
§30.15(iii) Fourier Transform
Equations (30.15.4) and (30.15.6) show that the functions ϕ n are σ -bandlimited, that is, their Fourier transform vanishes outside the interval [ σ , σ ] . …
8: 3.11 Approximation Techniques
Example. The Discrete Fourier Transform
is called a discrete Fourier transform pair.
The Fast Fourier Transform
The direct computation of the discrete Fourier transform (3.11.38), that is, of …The method of the fast Fourier transform (FFT) exploits the structure of the matrix 𝛀 with elements ω n j k , j , k = 0 , 1 , , n 1 . …
9: 7.14 Integrals
Fourier Transform
10: Errata
  • Section 1.14

    There have been extensive changes in the notation used for the integral transforms defined in §1.14. These changes are applied throughout the DLMF. The following table summarizes the changes.

    Transform New Abbreviated Old
    Notation Notation Notation
    Fourier ( f ) ( x ) f ( x )
    Fourier Cosine c ( f ) ( x ) c f ( x )
    Fourier Sine s ( f ) ( x ) s f ( x )
    Laplace ( f ) ( s ) f ( s ) ( f ( t ) ; s )
    Mellin ( f ) ( s ) f ( s ) ( f ; s )
    Hilbert ( f ) ( s ) f ( s ) ( f ; s )
    Stieltjes 𝒮 ( f ) ( s ) 𝒮 f ( s ) 𝒮 ( f ; s )

    Previously, for the Fourier, Fourier cosine and Fourier sine transforms, either temporary local notations were used or the Fourier integrals were written out explicitly.

  • Subsection 1.16(vii)

    Several changes have been made to

    1. (i)

      make consistent use of the Fourier transform notations ( f ) , ( ϕ ) and ( u ) where f is a function of one real variable, ϕ is a test function of n variables associated with tempered distributions, and u is a tempered distribution (see (1.14.1), (1.16.29) and (1.16.35));

    2. (ii)

      introduce the partial differential operator 𝐃 in (1.16.30);

    3. (iii)

      clarify the definition (1.16.32) of the partial differential operator P ( 𝐃 ) ; and

    4. (iv)

      clarify the use of P ( 𝐃 ) and P ( 𝐱 ) in (1.16.33), (1.16.34), (1.16.36) and (1.16.37).

  • Subsection 1.16(viii)

    An entire new Subsection 1.16(viii) Fourier Transforms of Special Distributions, was contributed by Roderick Wong.