enow.com Web Search

  1. Ads

    related to: chebyshev expansion tank

Search results

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

    en.wikipedia.org/wiki/Chebyshev_polynomials

    This sum is called a Chebyshev series or a Chebyshev expansion. Since a Chebyshev series is related to a Fourier cosine series through a change of variables, all of the theorems, identities, etc. that apply to Fourier series have a Chebyshev counterpart. [16] These attributes include: The Chebyshev polynomials form a complete orthogonal system.

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

  4. Clenshaw–Curtis quadrature - Wikipedia

    en.wikipedia.org/wiki/Clenshaw–Curtis_quadrature

    Clenshaw–Curtis quadrature and Fejér quadrature are methods for numerical integration, or "quadrature", that are based on an expansion of the integrand in terms of Chebyshev polynomials. Equivalently, they employ a change of variables x = cos ⁡ θ {\displaystyle x=\cos \theta } and use a discrete cosine transform (DCT) approximation for ...

  5. Chernoff bound - Wikipedia

    en.wikipedia.org/wiki/Chernoff_bound

    It is a sharper bound than the first- or second-moment-based tail bounds such as Markov's inequality or Chebyshev's inequality, which only yield power-law bounds on tail decay. However, when applied to sums the Chernoff bound requires the random variables to be independent, a condition that is not required by either Markov's inequality or ...

  6. Classical orthogonal polynomials - Wikipedia

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

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

  7. Discrete Chebyshev transform - Wikipedia

    en.wikipedia.org/wiki/Discrete_Chebyshev_transform

    In applied mathematics, a discrete Chebyshev transform (DCT) is an analog of the discrete Fourier transform for a function of a real interval, converting in either direction between function values at a set of Chebyshev nodes and coefficients of a function in Chebyshev polynomial basis. Like the Chebyshev polynomials, it is named after Pafnuty ...

  8. List of trigonometric identities - Wikipedia

    en.wikipedia.org/wiki/List_of_trigonometric...

    12 Series expansion. 13 Infinite product formulae. ... The Chebyshev method is a recursive algorithm for finding the n th multiple angle formula knowing the ...

  9. Pafnuty Chebyshev - Wikipedia

    en.wikipedia.org/wiki/Pafnuty_Chebyshev

    Pafnuty Lvovich Chebyshev (Russian: Пафну́тий Льво́вич Чебышёв, IPA: [pɐfˈnutʲɪj ˈlʲvovʲɪtɕ tɕɪbɨˈʂof]) (16 May [O.S. 4 May] 1821 – 8 December [O.S. 26 November] 1894) [3] was a Russian mathematician and considered to be the founding father of Russian mathematics.

  1. Ads

    related to: chebyshev expansion tank