enow.com Web Search

Search results

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

    en.wikipedia.org/wiki/Chebyshev_polynomials

    Plot of the Chebyshev polynomial of the first kind () with = in the complex plane from -2-2i to 2+2i with colors created with Mathematica 13.1 function ComplexPlot3D. The Chebyshev polynomials are two sequences of polynomials related to the cosine and sine functions, notated as () and ().

  3. Chebyshev nodes - Wikipedia

    en.wikipedia.org/wiki/Chebyshev_nodes

    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]

  4. Eigenvalues and eigenvectors of the second derivative

    en.wikipedia.org/wiki/Eigenvalues_and...

    where is the kth Chebyshev polynomial of the 2nd kind. Since + =, we get that () ... problem will be the zeros of the nth Chebyshev polynomial of the second kind, ...

  5. Discrete Chebyshev transform - Wikipedia

    en.wikipedia.org/wiki/Discrete_Chebyshev_transform

    Like the Chebyshev polynomials, it is named after Pafnuty Chebyshev. The two most common types of discrete Chebyshev transforms use the grid of Chebyshev zeros, the zeros of the Chebyshev polynomials of the first kind () and the grid of Chebyshev extrema, the extrema of the Chebyshev polynomials of the first kind, which are also the zeros of ...

  6. Classical orthogonal polynomials - Wikipedia

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

    There are several important subclasses of these: Gegenbauer, Legendre, and two types of Chebyshev. Every Laguerre-like polynomial sequence can have its domain shifted, scaled, and/or reflected so that its interval of orthogonality is [ 0 , ∞ ) {\displaystyle [0,\infty )} , and has Q = x .

  7. Dickson polynomial - Wikipedia

    en.wikipedia.org/wiki/Dickson_polynomial

    Specifically, for α = −1, the Dickson polynomials of the first kind are Fibonacci polynomials, and Dickson polynomials of the second kind are Lucas polynomials. By the composition rule above, when α is idempotent, composition of Dickson polynomials of the first kind is commutative. The Dickson polynomials with parameter α = 0 give monomials.

  8. Discrete Chebyshev polynomials - Wikipedia

    en.wikipedia.org/wiki/Discrete_Chebyshev_polynomials

    In mathematics, discrete Chebyshev polynomials, or Gram polynomials, are a type of discrete orthogonal polynomials used in approximation theory, introduced by Pafnuty Chebyshev [1] and rediscovered by Gram. [2] They were later found to be applicable to various algebraic properties of spin angular momentum.

  9. Chebyshev equation - Wikipedia

    en.wikipedia.org/wiki/Chebyshev_equation

    Chebyshev's equation is the second order ... that function is a polynomial of degree p and it is proportional to the Chebyshev polynomial of the first kind ...