enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Chebyshev polynomials - Wikipedia

    en.wikipedia.org/wiki/Chebyshev_polynomials

    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. () =.

  3. Clenshaw algorithm - Wikipedia

    en.wikipedia.org/wiki/Clenshaw_algorithm

    In numerical analysis, the Clenshaw algorithm, also called Clenshaw summation, is a recursive method to evaluate a linear combination of Chebyshev polynomials. [1] [2] The method was published by Charles William Clenshaw in 1955.

  4. Orthogonal polynomials - Wikipedia

    en.wikipedia.org/wiki/Orthogonal_polynomials

    The Gegenbauer polynomials form the most important class of Jacobi polynomials; they include the Chebyshev polynomials, and the Legendre polynomials as special cases. The field of orthogonal polynomials developed in the late 19th century from a study of continued fractions by P. L. Chebyshev and was pursued by A. A. Markov and T. J. Stieltjes.

  5. Chebyshev equation - Wikipedia

    en.wikipedia.org/wiki/Chebyshev_equation

    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 ...

  6. Classical orthogonal polynomials - Wikipedia

    en.wikipedia.org/wiki/Classical_orthogonal...

    In mathematics, the classical orthogonal polynomials are the most widely used orthogonal polynomials: the Hermite polynomials, Laguerre polynomials, Jacobi polynomials (including as a special case the Gegenbauer polynomials, Chebyshev polynomials, and Legendre polynomials [1]).

  7. Recurrence relation - Wikipedia

    en.wikipedia.org/wiki/Recurrence_relation

    In mathematics, a recurrence relation is an equation according to which the th term of a sequence of numbers is equal to some combination of the previous terms. Often, only previous terms of the sequence appear in the equation, for a parameter that is independent of ; this number is called the order of the relation.

  8. Hermite polynomials - Wikipedia

    en.wikipedia.org/wiki/Hermite_polynomials

    Hermite polynomials were defined by Pierre-Simon Laplace in 1810, [1] [2] though in scarcely recognizable form, and studied in detail by Pafnuty Chebyshev in 1859. [3] Chebyshev's work was overlooked, and they were named later after Charles Hermite, who wrote on the polynomials in 1864, describing them as new. [4]

  9. Jacobi polynomials - Wikipedia

    en.wikipedia.org/wiki/Jacobi_polynomials

    The Gegenbauer polynomials, and thus also the Legendre, Zernike and Chebyshev polynomials, are special cases of the Jacobi polynomials. [1] ... Recurrence relations