Trigonometric polynomial
Template:Short description In the mathematical subfields of numerical analysis and mathematical analysis, a trigonometric polynomial is a finite linear combination of functions sin(nx) and cos(nx) with n taking on the values of one or more natural numbers. The coefficients may be taken as real numbers, for real-valued functions. For complex coefficients, there is no difference between such a function and a finite Fourier series.
Trigonometric polynomials are widely used, for example in trigonometric interpolation applied to the interpolation of periodic functions. They are used also in the discrete Fourier transform.
The term trigonometric polynomial for the real-valued case can be seen as using the analogy: the functions sin(nx) and cos(nx) are similar to the monomial basis for polynomials. In the complex case the trigonometric polynomials are spanned by the positive and negative powers of <math>e^{ix}</math>, i.e., Laurent polynomials in <math>z </math> under the change of variables <math>x \mapsto z := e^{ix}</math>.
DefinitionEdit
Any function T of the form
<math display="block">T(x) = a_0 + \sum_{n=1}^N a_n \cos (nx) + \sum_{n=1}^N b_n \sin(nx) \qquad (x \in \mathbb{R})</math>
with coefficients <math>a_n, b_n \in \mathbb{C}</math> and at least one of the highest-degree coefficients <math>a_N</math> and <math>b_N</math> non-zero, is called a complex trigonometric polynomial of degree N.<ref>Template:Harvnb</ref> Using Euler's formula the polynomial can be rewritten as
<math display="block">T(x) = \sum_{n=-N}^N c_n e^{inx} \qquad (x \in \mathbb{R}).</math> with <math>c_{n}\in\mathbb{C}</math>.
Analogously, letting coefficients <math>a_n, b_n \in \mathbb{R}</math>, and at least one of <math>a_N</math> and <math>b_N</math> non-zero or, equivalently, <math>c_n \in \mathbb{R}</math> and <math>c_n = \bar{c}_{-n}</math> for all <math>n\in[-N,N]</math>, then
<math display="block">t(x) = a_0 + \sum_{n=1}^N a_n \cos (nx) + \sum_{n=1}^N b_n \sin(nx) \qquad (x \in \mathbb{R})</math>
is called a real trigonometric polynomial of degree N.Template:SfnTemplate:Sfn
PropertiesEdit
A trigonometric polynomial can be considered a periodic function on the real line, with period some divisor of Template:Tmath, or as a function on the unit circle.
Trigonometric polynomials are dense in the space of continuous functions on the unit circle, with the uniform norm;<ref>Template:Harvnb</ref> this is a special case of the Stone–Weierstrass theorem. More concretely, for every continuous function Template:Tmath and every Template:Tmath there exists a trigonometric polynomial Template:Tmath such that <math>|f(z) - T(z)| < \epsilon</math> for all Template:Tmath. Fejér's theorem states that the arithmetic means of the partial sums of the Fourier series of Template:Tmath converge uniformly to Template:Tmath provided Template:Tmath is continuous on the circle; these partial sums can be used to approximate Template:Tmath.
A trigonometric polynomial of degree Template:Tmath has a maximum of Template:Tmath roots in a real interval Template:Tmath unless it is the zero function.<ref>Template:Harvnb</ref>
Fejér-Riesz theoremEdit
The Fejér-Riesz theorem states that every positive real trigonometric polynomial <math display="block">t(x) = \sum_{n=-N}^{N} c_n e^{i n x},</math> satisfying <math>t(x)>0</math> for all <math>x\in\mathbb{R}</math>, can be represented as the square of the modulus of another (usually complex) trigonometric polynomial <math>q(x)</math> such that:Template:Sfn <math display="block">t(x) = |q(x)|^2 = q(x)\bar{q}(x).</math> Or, equivalently, every Laurent polynomial <math display="block">w(z)=\sum_{n=-N}^{N} w_{n}z^{n},</math> with <math>w_n \in\mathbb{C}</math> that satisfies <math>w(\zeta)\geq 0</math> for all <math>\zeta \in \mathbb{T}</math> can be written as: <math display="block"> w(\zeta)=|p(\zeta)|^2=p(\zeta)\bar{p}(\bar{\zeta}),</math> for some polynomial <math>p(z)</math>.Template:Sfn