Search results
Results from the WOW.Com Content Network
The Chebyshev polynomials of the second kind are defined by the recurrence relation: = = + = (). Notice that the two sets of recurrence relations are identical, except for () = vs. () =.
The recurrence relation for is (+) = (), making the coefficients in the recursion relation = , = and the evaluation of the series is given by + = + =, = + + + (), The final step is made particularly simple because () = =, so the end of the recurrence is simply () (); the term is added separately: = + .
The most widely used orthogonal polynomials are the classical orthogonal polynomials, consisting of the Hermite polynomials, the Laguerre polynomials and the Jacobi polynomials. The Gegenbauer polynomials form the most important class of Jacobi polynomials; they include the Chebyshev polynomials, and the Legendre polynomials as special
The Chebyshev nodes of the second kind, also called the Chebyshev extrema, are the extrema of the Chebyshev polynomials of the first kind, which are also the zeros of the Chebyshev polynomials of the second kind. Both of these sets of numbers are commonly referred to as Chebyshev nodes in literature. [1] Polynomial interpolants constructed from ...
Chebyshev 's equation is the ... where the coefficients obey the recurrence relation ... that function is a polynomial of degree p and it is proportional to the ...
Because of this, expansion of functions in terms of Chebyshev polynomials is sometimes used for polynomial approximations in computer math libraries. Some authors use versions of these polynomials that have been shifted so that the interval of orthogonality is [0, 1] or [−2, 2].
Since the Jacobi polynomials can be described in terms of the hypergeometric function, recurrences of the hypergeometric function give equivalent recurrences of the Jacobi polynomials. In particular, Gauss' contiguous relations correspond to the identities
The Dickson polynomials with parameter α = 1 are related to Chebyshev polynomials T n (x) = cos (n arccos x) of the first kind by [1] (,) = (). Since the Dickson polynomial D n (x,α) can be defined over rings with additional idempotents, D n (x,α) is often not related to a Chebyshev polynomial.