(mathematics) A finite series of functions of the form an cos nx + bn sin nx; occasionally used synonymously with trigonometric series.
| Sci-Tech Dictionary: trigonometric polynomial |
(mathematics) A finite series of functions of the form an cos nx + bn sin nx; occasionally used synonymously with trigonometric series.
| 5min Related Video: Trigonometric polynomial |
| Wikipedia: Trigonometric polynomial |
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 a natural number. 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 eix.
Any function T of the form

with an, bn in C for 0 ≤ n ≤ N, is called a complex trigonometric polynomial of degree N (Rudin 1987, p. 88). Using Euler's formula the polynomial can be rewritten as

Analogously let an, bn be in R, 0 ≤ n ≤ N and aN ≠ 0 or bN ≠ 0 then

is called real trigonometric polynomial of degree N (Powell 1981, p. 150).
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 (Rudin 1987, Thm 4.25); 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 2N roots in any open interval [a, a + 2π) with a in R, unless it is the zero function (Powell 1981, p. 150).
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)
| J. Ernest Wilkins, Jr. | |
| K-finite | |
| Trigonometric interpolation |
| What are trigonometric functions? Read answer... | |
| Is a log of a polynomial still a polynomial? Read answer... | |
| What is the difficulties of trigonometric function of an angles? Read answer... |
| What is trigonometric definations? | |
| What are the kinds of trigonometric? | |
| What is trigonometric expression? |
Copyrights:
![]() | Sci-Tech Dictionary. McGraw-Hill Dictionary of Scientific and Technical Terms. Copyright © 2003, 1994, 1989, 1984, 1978, 1976, 1974 by McGraw-Hill Companies, Inc. All rights reserved. Read more | |
![]() | Wikipedia. This article is licensed under the Creative Commons Attribution/Share-Alike License. It uses material from the Wikipedia article "Trigonometric polynomial". Read more |
Mentioned in