# Difference between revisions of "Trigonometric polynomial"

en>Addbot m (Bot: Migrating 6 interwiki links, now provided by Wikidata on d:q1969650 (Report Errors)) |
en>Trappist the monk m (→References: replace mr template with mr parameter in CS1 templates; using AWB) |
||

Line 1: | Line 1: | ||

− | In the [[mathematical]] subfields of [[numerical analysis]] and [[mathematical analysis]], a '''trigonometric polynomial''' is a finite [[linear combination]] of [[Function (mathematics)|functions]] sin(''nx'') and cos(''nx'') with ''n'' taking on the values of one or more [[natural number]]s. The coefficients may be taken as real numbers, for real-valued functions. For [[complex number|complex | + | In the [[mathematical]] subfields of [[numerical analysis]] and [[mathematical analysis]], a '''trigonometric polynomial''' is a finite [[linear combination]] of [[Function (mathematics)|functions]] sin(''nx'') and cos(''nx'') with ''n'' taking on the values of one or more [[natural number]]s. The coefficients may be taken as real numbers, for real-valued functions. For [[complex number|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 function]]s. They are used also in the [[discrete Fourier transform]]. | Trigonometric polynomials are widely used, for example in [[trigonometric interpolation]] applied to the [[interpolation]] of [[periodic function]]s. They are used also in the [[discrete Fourier transform]]. | ||

Line 30: | Line 30: | ||

==References== | ==References== | ||

* {{Citation | last1=Powell | first1=Michael J. D. | author1-link=Michael J. D. Powell | title=Approximation Theory and Methods | publisher=[[Cambridge University Press]] | isbn=978-0-521-29514-7 | year=1981}} | * {{Citation | last1=Powell | first1=Michael J. D. | author1-link=Michael J. D. Powell | title=Approximation Theory and Methods | publisher=[[Cambridge University Press]] | isbn=978-0-521-29514-7 | year=1981}} | ||

− | * {{Citation | last1=Rudin | first1=Walter | author1-link=Walter Rudin | title=Real and complex analysis | publisher=[[McGraw-Hill]] | location=New York | edition=3rd | isbn=978-0-07-054234-1 | | + | * {{Citation | last1=Rudin | first1=Walter | author1-link=Walter Rudin | title=Real and complex analysis | publisher=[[McGraw-Hill]] | location=New York | edition=3rd | isbn=978-0-07-054234-1 |mr=924157 | year=1987}}. |

[[Category:Approximation theory]] | [[Category:Approximation theory]] |

## Latest revision as of 23:19, 25 September 2014

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 *e*^{ix}.

## Formal definition

Any function *T* of the form

with *a*_{n}, *b*_{n} in **C** for 0 ≤ *n* ≤ *N*, is called a **complex trigonometric polynomial** of degree *N* Template:Harv. Using Euler's formula the polynomial can be rewritten as

Analogously let *a*_{n}, *b*_{n} be in **R**, 0 ≤ *n* ≤ *N* and *a*_{N} ≠ 0 or *b*_{N} ≠ 0 then

is called **real trigonometric polynomial** of degree *N* Template:Harv.

## Notes

A trigonometric polynomial can be considered a periodic function on the real line, with period some multiple of 2π, or as a function on the unit circle.

A basic result is that the trigonometric polynomials are dense in the space of continuous functions on the unit circle, with the uniform norm Template:Harv; this is a special case of the Stone–Weierstrass theorem. More concretely, for every continuous function ƒ and every ε > 0, there exists a trigonometric polynomial *T* such that |ƒ(*z*) − T(*z*)| < ε for all *z*. Fejér's theorem states that the arithmetic means of the partial sums of the Fourier series of ƒ converge uniformly to ƒ, thus giving an explicit way to find an approximating trigonometric polynomial *T*.

A trigonometric polynomial of degree *N* has a maximum of 2*N* roots in any open interval [*a*, *a* + 2π) with a in **R**, unless it is the zero function Template:Harv.

## References

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.