PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: No information on entry rating
orthogonal polynomials (Definition)

Orthogonal Polynomials

Polynomials of degree $ n$ are analytic functions that can be written in the form

$\displaystyle p_n(x) = a_0 + a_1 x + a_2 x^2 + \cdots + a_n x^n $

They can be differentiated and integrated for any value of $ x$, and are fully determined by the $ n+1$ coefficients $ a_0 \ldots a_n$ . For this simplicity they are frequently used to approximate more complicated or unknown functions. In approximations, the necessary degree $ n$ 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 $ a_i$, even for small values of $ n$. It is therefore customary to stabilize results numerically by using orthogonal polynomials over an interval $ [a,b]$, defined with respect to a positive weight function $ W(x) > 0$ by

$\displaystyle \int_a^b p_n(x)p_m(x) W(x) dx = 0 \;$   for$\displaystyle \; n \ne m $

Orthogonal polynomials are obtained in the following way: define the scalar product.

$\displaystyle (f,g) = \int_a^b f(x)g(x)W(x) dx $

between the functions $ f$ and $ g$, where $ W(x)$ is a weight factor. Starting with the polynomials $ p_0(x)=1$, $ p_1(x)=x$, $ p_2(x)=x^2$, etc., from the Gram-Schmidt decomposition one obtains a sequence of orthogonal polynomials $ q_0(x),q_1(x),\ldots$, such that $ (q_m,q_n)=N_n \delta_{mn}$. The normalization factors $ N_n$ are arbitrary. When all $ N_i$ 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

$\displaystyle p_n = (A_n + B_n x) p_{n-1} + C_n p_{n-2} $

This relation can be used to compute a finite series

$\displaystyle a_0 p_0 + a_1 p_1 + \cdots + a_np_n $

with arbitrary coefficients $ a_i$, without computing explicitly every polynomial $ p_j$ (Horner's Rule).

Chebyshev polynomials $ T_n(x)$ are also orthogonal with respect to discrete values $ x_i$:

$\displaystyle \sum_i T_n(x_i)T_m(x_i) = 0 \;$   for$\displaystyle \; n < m \le M $

where the $ x_i$ depend on $ M$.

For more information, see [2,3].

Bibliography

1
Originally from The Data Analysis Briefbook (http://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.



"orthogonal polynomials" is owned by akrowne.
(view preamble)

View style:

See Also: orthogonal matrices, orthonormal set

Keywords:  orthogonality

Attachments:
Christoffel-Darboux formula (Theorem) by rspuzio
Log in to rate this entry.
(view current ratings)

Cross-references: information, discrete, orthogonal, Horner's rule, series, finite, relation, recurrence relation, orders, Hermite polynomials, Chebyshev polynomials, Legendre polynomials, orthonormal, sequence, Gram-Schmidt decomposition, factor, scalar product, weight, positive, interval, even, necessary, approximations, functions, coefficients, analytic functions, degree, polynomials
There are 6 references to this entry.

This is version 6 of orthogonal polynomials, born on 2002-01-04, modified 2005-04-24.
Object id is 1220, canonical name is OrthogonalPolynomials.
Accessed 9338 times total.

Classification:
AMS MSC33D45 (Special functions :: Basic hypergeometric functions :: Basic orthogonal polynomials and functions )
 42C05 (Fourier analysis :: Nontrigonometric Fourier analysis :: Orthogonal functions and polynomials, general theory)

Pending Errata and Addenda
None.
[ View all 6 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)