Poisson summation formula

Poisson summation formula

The Poisson summation formula is an equation relating the coefficients of the Fourier Series of the periodic extension of a function in terms of the values of the function's continuous Fourier transform. The Poisson Summation Formula was discovered by Siméon Denis Poisson and is sometimes called Poisson resummation.

Definition

The Poisson summation formula may be stated as: harv|Pinsky|2002 harv|Zygmund|1968

:sum_{n=-infty}^infty f(nT)=frac{1}{T}sum_{n=-infty}^infty hat fleft(frac{n}{T} ight),

where hat{f}( u) stackrel{mathrm{def{=}int_{-infty}^{infty} f(x) e^{-2pi i u x}, dx.

There is a second version of the Poisson summation formula that is equivalent for nice enough functions which relies on the notion of a periodic extension.

The "Periodic extension" of a function is a new function formed by shifting the original function by multiples of some period, T, and adding all the copies together. The periodic extension of a function ƒ("t") can be written:

:varphi_T(t) stackrel{mathrm{def{=} sum_{n=-infty}^{infty} f(t + nT).

Assuming f is integrable and that sum_{k=-infty}^{infty}left|hat fleft(frac{k}{T} ight) ight| it can be shown below that: harv|Grafakos|2004

For the special case "t"=0 EquationNote|Eq.1 reduces to the version of the Poisson summation formula given above. The first version holds under the less restrictive conditions that 0 is a point of continuity of φ"T"("t"). This may fail to be the case even when both f and hat{f} are continuous and the sums converge absolutely harv|Katznelson|1976.

Intuitive Derivation of the Poisson Summation Formula

The function φ"T"("t") is periodic, with period "T". It can therefore be expanded into a Fourier series,whose coefficients are given by:

:egin{align}hatvarphi_T [k] &stackrel{mathrm{def{=} frac{1}{T}int_0^{T} varphi_T(t)cdot e^{-2pi i frac{k}{T} t}, dt\&= frac{1}{T}int_0^{T} left(sum_{n=-infty}^{infty} f(t + nT) ight)cdot e^{-2pi ifrac{k}{T} t}, dt\&= frac{1}{T} sum_{n=-infty}^{infty} int_0^{T} f(t + nT)cdot e^{-2pi ifrac{k}{T} t}, dtend{align}

With a change of variables ( au stackrel{mathrm{def{=} t + nT) this becomes:

:egin{align}hatvarphi_T [k] & =frac{1}{T} sum_{n=-infty}^{infty} int_{nT}^{nT + T} f( au) e^{-2pi ifrac{k}{T} ( au - nT)} d au \ & =frac{1}{T} sum_{n=-infty}^{infty} int_{nT}^{nT + T} f( au) e^{-2pi ifrac{k}{T} au } underbrace{ e^{i 2pi k n_{=1 forall k, n} d au \ & =frac{1}{T} sum_{n=-infty}^{infty} int_{nT}^{nT + T} f( au) e^{-2pi ifrac{k}{T} au} d au \ & = frac{1}{T} int_{-infty}^{infty} f( au) e^{-2pi ifrac{k}{T} au} d auquad stackrel{mathrm{def{=}quad frac{1}{T} hat fleft(frac{k}{T} ight).end{align}

Substitution of these coefficients into the Fourier series produces EquationNote|Eq.1.

Applications of the Poisson Summation Formula

The Poisson Summation formula may be used to give a proof of the Shannon Sampling theorem harv|Pinsky|2002. It also provides a connection between Fourier analysis on the circle and the real line. harv|Grafakos|2004.

Computationally, the Poisson Summation Formula is useful since a slowly converging summationin real space is guaranteed to be converted into a quickly converging equivalent summation in Fourier space. (A broad function in real spacebecomes a narrow function in Fourier space and vice versa.) This is the essential idea behind Ewald summation.

Convergence conditions

Some conditions restricting hat f must naturally be applied to have convergence. A useful way to get around stating those precisely is to use the language of distributions. Let δ("t") be the Dirac delta function. Then if we write

:Delta(t) = sum_{n=-infty}^{infty} delta(t - n)

summed over "all" integers "n", we have that Δ is a distribution (a so-called Dirac comb), because applied to any test function we get a bi-infinite sum that has very small 'tails'. Then one may interpret the summation formula as saying that Delta(t) "is its own Fourier transform".

Again this depends on precise normalization in the transform, but it conveys good information about the variance of the formula. For example, for constant "a" ≠ 0 it would follow that

:Delta(at) "is the Fourier transform" of Delta(t/a) .

Therefore we can always find a spacing λ"Z" of the integers, such that placing a delta-function at each of those points is its own transform, and each normalization will have a corresponding valid formula. It also suggests a method of proof that is intuitive: put instead a Gaussian centered at each integer, calculate using the known Fourier transform of a Gaussian, and then let the width of all the Gaussians become small.

Generalizations

There is a version in "n" dimensions, that is easy to formulate. Given a lattice Λ in R"n", there is a "dual lattice" Λ′ (defined by vector space or Pontryagin duality, as one wishes). Then the statement is that the sum of delta-functions at each point of Λ, and at each point of Λ′, are again Fourier transforms as distributions, subject to correct normalization.

This is applied in the theory of theta functions, and is a possible method in geometry of numbers. In fact in more recent work on counting lattice points in regions it is routinely used − summing the indicator function of a region "D" over lattice points is exactly the question, so that the LHS of the summation formula is what is sought and the RHS something that can be attacked by mathematical analysis.

Further generalisation to locally compact abelian groups is required in number theory. In non-commutative harmonic analysis, the idea is taken even further in the Selberg trace formula, but takes on a much deeper character.

Literature

* J.J. Benedetto; G. Zimmermann: "Sampling multipliers and the Poisson summation formula." J. Fourier Ana. App. 3(1997)5, [https://www.uni-hohenheim.de/~gzim/Publications/sm.html Preprint online]
* J.R. Higgins: "Five short stories about the cardinal series." Bull. AMS 12(1985)1, Online at [http://projecteuclid.org/euclid.bams/1183552334 Project Open Euclid]
*.
*
*.
*.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Poisson (disambiguation) — Poisson (meaning fish in French) may refer to:* Siméon Denis Poisson (1781 1840), French mathematician, geometer and physicist, after whom a number of mathematical concepts and physical phenomena are named, including: ** Poisson distribution, a… …   Wikipedia

  • Ewald summation — is a method for computing the interaction energies of periodic systems (e.g. crystals), particularly electrostatic energies. Ewald summation is a special case of the Poisson summation formula, replacing the summation of interaction energies in… …   Wikipedia

  • Siméon Denis Poisson — Infobox Scientist box width = 300px name = Siméon Poisson image size = 200px caption = Siméon Denis Poisson (1781 1840) birth date = 21 June 1781 birth place = Pithiviers, France death date = 25 April 1840 death place = Sceaux, France residence …   Wikipedia

  • Selberg trace formula — In mathematics, the Selberg trace formula is a central result, or area of research, in non commutative harmonic analysis. It provides an expression for the trace, in a sense suitably generalising that of the trace of a matrix, for suitable… …   Wikipedia

  • Siméon Denis Poisson — Siméon Poisson Siméon Denis Poisson (1781 1840) Nacimiento 21 de junio de 1781 Pithiviers, Loiret …   Wikipedia Español

  • Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms The Fourier transform is a mathematical operation that decomposes a function into its constituent… …   Wikipedia

  • Dirac delta function — Schematic representation of the Dirac delta function by a line surmounted by an arrow. The height of the arrow is usually used to specify the value of any multiplicative constant, which will give the area under the function. The other convention… …   Wikipedia

  • Relations between Fourier transforms and Fourier series — In the mathematical field of harmonic analysis, the continuous Fourier transform has very precise relations with Fourier series. It is also closely related to the discrete time Fourier transform (DTFT) and the discrete Fourier transform (DFT).… …   Wikipedia

  • Fourier series — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms …   Wikipedia

  • List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”