In mathematics the Chebyshev polynomials, named after Pafnuty Chebyshev, are a sequence of orthogonal polynomials which are related to de Moivre's formula and which can be defined recursively. One usually distinguishes between Chebyshev polynomials of the first kind which are denoted Tn and Chebyshev polynomials of the second kind which are denoted Un. The letter T is used because of the alternative transliterations of the name Chebyshev as Tchebycheff, Tchebyshev (French) or Tschebyschow (German). and

Property Value
dbo:abstract
• In mathematics the Chebyshev polynomials, named after Pafnuty Chebyshev, are a sequence of orthogonal polynomials which are related to de Moivre's formula and which can be defined recursively. One usually distinguishes between Chebyshev polynomials of the first kind which are denoted Tn and Chebyshev polynomials of the second kind which are denoted Un. The letter T is used because of the alternative transliterations of the name Chebyshev as Tchebycheff, Tchebyshev (French) or Tschebyschow (German). The Chebyshev polynomials Tn or Un are polynomials of degree n and the sequence of Chebyshev polynomials of either kind composes a polynomial sequence. Chebyshev polynomials are polynomials with the largest possible leading coefficient, but subject to the condition that their absolute value on the interval [-1,1] is bounded by 1. They are also the extremal polynomials for many other properties. Chebyshev polynomials are important in approximation theory because the roots of the Chebyshev polynomials of the first kind, which are also called Chebyshev nodes, are used as nodes in polynomial interpolation. The resulting interpolation polynomial minimizes the problem of Runge's phenomenon and provides an approximation that is close to the polynomial of best approximation to a continuous function under the maximum norm. This approximation leads directly to the method of Clenshaw–Curtis quadrature. In the study of differential equations they arise as the solution to the Chebyshev differential equations and for the polynomials of the first and second kind, respectively. These equations are special cases of the Sturm–Liouville differential equation. (en)
dbo:wikiPageID
• 184539 (xsd:integer)
dbo:wikiPageRevisionID
• 740554174 (xsd:integer)
dbp:first
• Roderick S. C.
• Roelof
• Tom H.
• P. K.
• René F.
dbp:id
• 18 (xsd:integer)
• C/c021940
dbp:last
• Koekoek
• Koornwinder
• Swarttouw
• Wong
• Suetin
dbp:style
• border:1px solid #aaa
dbp:title
• Proof
• Orthogonal Polynomials
• Chebyshev Polynomial of the First Kind
dbp:titlestyle
• text-align:center;
dbp:urlname
• ChebyshevPolynomialoftheFirstKind
dct:subject
rdf:type
rdfs:comment
• In mathematics the Chebyshev polynomials, named after Pafnuty Chebyshev, are a sequence of orthogonal polynomials which are related to de Moivre's formula and which can be defined recursively. One usually distinguishes between Chebyshev polynomials of the first kind which are denoted Tn and Chebyshev polynomials of the second kind which are denoted Un. The letter T is used because of the alternative transliterations of the name Chebyshev as Tchebycheff, Tchebyshev (French) or Tschebyschow (German). and (en)
rdfs:label
• Chebyshev polynomials (en)
owl:differentFrom
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of
is owl:differentFrom of
is foaf:primaryTopic of