## File: Chebyshev-Approximations.html

package info (click to toggle)
gsl-ref-html 2.3-1
• area: non-free
• in suites: bullseye, buster, sid
• size: 6,876 kB
• ctags: 4,574
• sloc: makefile: 35
 file content (109 lines) | stat: -rw-r--r-- 6,268 bytes parent folder | download
 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109  GNU Scientific Library – Reference Manual: Chebyshev Approximations

30 Chebyshev Approximations

This chapter describes routines for computing Chebyshev approximations to univariate functions. A Chebyshev approximation is a truncation of the series f(x) = \sum c_n T_n(x), where the Chebyshev polynomials T_n(x) = \cos(n \arccos x) provide an orthogonal basis of polynomials on the interval [-1,1] with the weight function 1 / \sqrt{1-x^2}. The first few Chebyshev polynomials are, T_0(x) = 1, T_1(x) = x, T_2(x) = 2 x^2 - 1. For further information see Abramowitz & Stegun, Chapter 22.

The functions described in this chapter are declared in the header file gsl_chebyshev.h.

Chebyshev Definitions:
Creation and Calculation of Chebyshev Series:
Auxiliary Functions for Chebyshev Series:
Chebyshev Series Evaluation:
Derivatives and Integrals:
Chebyshev Approximation Examples:
Chebyshev Approximation References and Further Reading: