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

    en.wikipedia.org/wiki/Chebfun

    The mathematical basis of Chebfun is numerical algorithms involving piecewise polynomial interpolants and Chebyshev polynomials, and this is where the name "Cheb" comes from. The package aims to combine the feel of symbolic computing systems like Maple and Mathematica with the speed of floating-point numerics.

  5. Chebyshev–Gauss quadrature - Wikipedia

    en.wikipedia.org/wiki/Chebyshev–Gauss_quadrature

    In numerical analysis Chebyshev–Gauss quadrature is an extension of Gaussian quadrature method for approximating the value of integrals of the following kind: ∫ − 1 + 1 f ( x ) 1 − x 2 d x {\displaystyle \int _{-1}^{+1}{\frac {f(x)}{\sqrt {1-x^{2}}}}\,dx}

  6. Theodore J. Rivlin - Wikipedia

    en.wikipedia.org/wiki/Theodore_J._Rivlin

    Chebyshev Polynomials: From Approximation Theory to Algebra and Number Theory. NY: Wiley. 1990; 249 pages, revised 2nd edition of The Chebyshev Polynomials ; addition of about 80 exercises, a chapter introducing some elementary algebraic and number theoretic properties of the Chebyshev polynomials, and additional coverage of the polynomials ...

  7. Approximation theory - Wikipedia

    en.wikipedia.org/wiki/Approximation_theory

    One can obtain polynomials very close to the optimal one by expanding the given function in terms of Chebyshev polynomials and then cutting off the expansion at the desired degree. This is similar to the Fourier analysis of the function, using the Chebyshev polynomials instead of the usual trigonometric functions.

  8. Eigenvalues and eigenvectors of the second derivative

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

    Explicit formulas for eigenvalues and eigenvectors of the second derivative with different boundary conditions are provided both for the continuous and discrete cases. In the discrete case, the standard central difference approximation of the second derivative is used on a uniform grid.

  9. Orthogonality (mathematics) - Wikipedia

    en.wikipedia.org/wiki/Orthogonality_(mathematics)

    Somewhat more general Laguerre polynomial sequences are orthogonal with respect to gamma distributions. The Chebyshev polynomials of the first kind are orthogonal with respect to the measure . The Chebyshev polynomials of the second kind are orthogonal with respect to the Wigner semicircle distribution.