1 Orthogonal Polynomials
They can be differentiated and integrated for any value of , and are fully determined by the coefficients . For this simplicity they are frequently used to approximate more complicated or unknown functions. In approximations, the necessary degree of the polynomial is not normally defined by criteria other than the quality of the approximation.
Using polynomials as defined above tends to lead into numerical difficulties when determining the , even for small values of . It is therefore customary to stabilize results numerically by using orthogonal polynomials over an interval , defined with respect to a positive weighting function by
Orthogonal polynomials are obtained in the following way: define the scalar product.
between the functions and , where is a weight factor. Starting with the polynomials , , , etc., from the Gram-Schmidt decomposition one obtains a sequence of orthogonal polynomials , such that . The normalization factors are arbitrary. When all are equal to one, the polynomials are called orthonormal.
Some important orthogonal polynomials are:
Orthogonal polynomials of successive orders can be expressed by a recurrence relation
This relation can be used to compute a finite series
with arbitrary coefficients , without computing explicitly every polynomial (Horner’s Rule).
Chebyshev polynomials are also orthogonal with respect to discrete values :
where the depend on .
- 1 Originally from The Data Analysis Briefbook (http://rkb.home.cern.ch/rkb/titleA.htmlhttp://rkb.home.cern.ch/rkb/titleA.html)
- 2 M. Abramowitz and I.A. Stegun (Eds.), Handbook of Mathematical Functions, National Bureau of Standards, Dover, New York, 1974.
- 3 W.H. Press, S.A. Teukolsky, W.T. Vetterling, and B.P. Flannery, Numerical Recipes in C, Second edition, Cambridge University Press, 1995. (The same book exists for the Fortran language). There is also an Internet version which you can work from.
|Date of creation||2013-03-22 12:06:20|
|Last modified on||2013-03-22 12:06:20|
|Last modified by||akrowne (2)|