Approximations and expansions Best approximation and Chebyshev systems Concept
Chebyshev series
Summary
A Chebyshev series expands a function on as a sum of Chebyshev polynomials. Under the substitution it becomes the Fourier cosine series of . Truncated Chebyshev series are cheap to compute and are close to minimax approximations, within a factor that grows like . So they are central in numerical analysis.
Further reading
About this page
| Tag | GP98BJP4JH |
|---|---|
| URI | m2://GP98BJP4JH |
| Kind | concept |
| Writing | W0 stub |
| MSC | 41A10, 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.