Tchebycheff polynomial

Tchebycheff polynomial
a polynomial solution of the Tchebycheff equation, of the form Tn(x) = cos(n cos-1x), where n is an integer. Also called Chebyshev polynomial.

* * *


Universalium. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Tchebycheff polynomial — Math. a polynomial solution of the Tchebycheff equation, of the form Tn(x) = cos(n cos 1x), where n is an integer. Also called Chebyshev polynomial. [see TCHEBYCHEFF EQUATION] …   Useful english dictionary

  • Chebyshev polynomial — Math. See Tchebycheff polynomial. * * * …   Universalium

  • Chebyshev polynomial — Math. See Tchebycheff polynomial …   Useful english dictionary

  • Chebyshev polynomials — Not to be confused with discrete Chebyshev polynomials. In mathematics the Chebyshev polynomials, named after Pafnuty Chebyshev,[1] are a sequence of orthogonal polynomials which are related to de Moivre s formula and which can be defined… …   Wikipedia

  • Remez algorithm — The Remez algorithm (sometimes also called Remes algorithm, Remez/Remes exchange algorithm), published by Evgeny Yakovlevich Remez in 1934 [E. Ya. Remez, Sur la détermination des polynômes d approximation de degré donnée , Comm. Soc. Math.… …   Wikipedia

  • Optimal design — This article is about the topic in the design of experiments. For the topic in optimal control theory, see shape optimization. Gustav Elfving developed the optimal design of experiments, and so minimized surveyors need for theodolite measurements …   Wikipedia

Share the article and excerpts

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