Dirichlet kernel


The Dirichlet Dn of order n is defined as

Dn⁢(t)=∑k=-nnei⁢k⁢t.

It can be represented as

Dn⁢(t)=sin⁡(n+12)⁢tsin⁡t2.

Proof: It is

∑k=-nnei⁢k⁢t =e-i⁢n⁢t⁢1-ei⁢(2⁢n+1)⁢t1-ei⁢t
=ei⁢(n+12)⁢t-e-i⁢(n+12)⁢tei⁢t2-e-i⁢t2
=sin⁡(n+12)⁢tsin⁡t2.    □

The Dirichlet kernel arises in the analysis of periodic functionsMathworldPlanetmath because for any functionMathworldPlanetmath f of period 2⁢π, the convolution of DN and f results in the Fourier-series approximation of order n:

(DN*f)⁢(x)=12⁢π⁢∫-ππf⁢(y)⁢Dn⁢(x-y)⁢𝑑y=∑k=-nnf^⁢(k)⁢ei⁢k⁢x.
Title Dirichlet kernel
Canonical name DirichletKernel
Date of creation 2013-03-22 14:11:53
Last modified on 2013-03-22 14:11:53
Owner mathwizard (128)
Last modified by mathwizard (128)
Numerical id 10
Author mathwizard (128)
Entry type Definition
Classification msc 26A30
Related topic ExampleOfTelescopingSum