Math 2.0

Approximations and expansions Best approximation and Chebyshev systems Concept

Chebyshev series

Summary

A Chebyshev series expands a function on [−1,1][-1, 1] as a sum ∑akTk(x)\sum a_k T_k(x) of Chebyshev polynomials. Under the substitution x=cos⁡θx = \cos \theta it becomes the Fourier cosine series of f(cos⁡θ)f(\cos \theta). Truncated Chebyshev series are cheap to compute and are close to minimax approximations, within a factor that grows like log⁡n\log n. So they are central in numerical analysis.

Further reading

  1. Web https://en.wikipedia.org/wiki/Chebyshev_polynomials
About this page
TagGP98BJP4JH
URIm2://GP98BJP4JH
Kindconcept
WritingW0 stub
MSC41A10, 42A10, 33C45

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Definitions