TOPICS
Search

Orthogonal Polynomials


Orthogonal polynomials are classes of polynomials {p_n(x)} defined over a range [a,b] that obey an orthogonality relation

 int_a^bw(x)p_m(x)p_n(x)dx=delta_(mn)c_n,
(1)

where w(x) is a nonnegative weighting function, p_n has polynomial degree n, c_n>0, and delta_(mn) is the Kronecker delta. If c_n=1, then the polynomials are not only orthogonal, but orthonormal.

Orthogonal polynomials have very useful properties in the solution of mathematical and physical problems. Just as Fourier series provide a convenient method of expanding a periodic function in a series of linearly independent terms, orthogonal polynomials provide a natural way to solve, expand, and interpret solutions to many types of important differential equations. Orthogonal polynomials are especially easy to generate using Gram-Schmidt orthonormalization.

A table of common orthogonal polynomials is given below, where w(x) is the weighting function and

 c_n=int_a^bw(x)[p_n(x)]^2dx
(2)

(Abramowitz and Stegun 1972, pp. 774-775).

In the above table,

 h_n=(2^(alpha+beta+1))/(2n+alpha+beta+1)(Gamma(n+alpha+1)Gamma(n+beta+1))/(n!Gamma(n+alpha+beta+1)),
(3)

where Gamma(z) is a gamma function.

More generally, orthogonality may be defined by a positive measure mu on the real line with finite moments of all orders, not concentrated on any finite set. The measure need not be given by a weighting function. The corresponding monic polynomials P_n satisfy

 P_(n+1)(x)=(x-b_n)P_n(x)-beta_nP_(n-1)(x),
(4)

where P_(-1)=0, P_0=1, b_n is real, and beta_n>0 for n>=1, with beta_0=0. Favard's theorem supplies the converse. After normalization, this recurrence relation is represented by a Jacobi matrix. Its finite leading blocks have the zeros of the orthogonal polynomials as their eigenvalues, giving the nodes of Gaussian quadrature.

Orthogonality alone does not guarantee a complete orthogonal system in all square-integrable functions. For a finite positive measure on a bounded interval, polynomials are dense in L^2(mu), so the normalized sequence is complete. On unbounded intervals, additional hypotheses are needed. These distinctions matter when interpreting expansions in orthogonal polynomials as generalized Fourier series.

For the following properties, normalize the leading coefficients to be positive.

The roots of orthogonal polynomials possess many rather surprising and useful properties. For instance, let x_1<x_2<...<x_n be the roots of the p_n(x) with x_0=a and x_(n+1)=b. Then each interval [x_nu,x_(nu+1)] for nu=0, 1, ..., n contains exactly one root of p_(n+1)(x). Between two roots of p_n(x) there is at least one root of p_m(x) for m>n.

Let c be an arbitrary real constant, then the polynomial

 p_(n+1)(x)-cp_n(x)
(5)

has n+1 distinct real roots. If c>0 (c<0), these roots lie in the interior of [a,b], with the exception of the greatest (least) root which lies in [a,b] only for

 c<=(p_(n+1)(b))/(p_n(b))    (c>=(p_(n+1)(a))/(p_n(a))).
(6)

The following decomposition into partial fractions holds

 (p_n(x))/(p_(n+1)(x))=sum_(nu=0)^n(l_nu)/(x-xi_nu),
(7)

where {xi_nu} are the roots of p_(n+1)(x) and

l_nu=(p_n(xi_nu))/(p_(n+1)^'(xi_nu))
(8)
=(p_(n+1)^'(xi_nu)p_n(xi_nu)-p_n^'(xi_nu)p_(n+1)(xi_nu))/([p_(n+1)^'(xi_nu)]^2)>0.
(9)

Another interesting property is obtained by letting {p_n(x)} be the orthonormal set of polynomials associated with the distribution dalpha(x) on [a,b]. Then the convergents R_n/S_n of the continued fraction

 1/(A_1x+B_1)-(C_2)/(A_2x+B_2)-(C_3)/(A_3x+B_3)-...-(C_n)/(A_nx+B_n)+...
(10)

are given by

R_n=R_n(x)
(11)
=c_0^(-3/2)sqrt(c_0c_2-c_1^2)int_a^b(p_n(x)-p_n(t))/(x-t)dalpha(t)
(12)
S_n=S_n(x)=sqrt(c_0)p_n(x),
(13)

where n=0, 1, ... and

 c_n=int_a^bx^ndalpha(x).
(14)

Furthermore, the roots of the orthogonal polynomials p_n(x) associated with the distribution dalpha(x) on the interval [a,b] are real and distinct and are located in the interior of the interval [a,b].

The Jacobi polynomial, Laguerre polynomial, and Hermite polynomial families and their special cases, in their ranges of real orthogonality, also have a common differential structure. Write sigma(x)=s_2x^2+s_1x+s_0 and tau(x)=t_1x+t_0. In monic normalization, they satisfy

 sigma(x)P_n^('')(x)+tau(x)P_n^'(x)-n[(n-1)s_2+t_1]P_n(x)=0
(15)

for nonnegative integers n (NIST, §18.8). For n>=2, let q_n and r_n be the coefficients of x^(n-1) and x^(n-2) in P_n(x), respectively. Then

 sigma(x)P_n^'(x)=(ns_2x+ns_1-s_2q_n)P_n(x)+(s_2q_n^2-s_1q_n-2s_2r_n+ns_0)P_(n-1)(x).
(16)

See also

Charlier Polynomial, Chebyshev Polynomial of the First Kind, Chebyshev Polynomial of the Second Kind, Christoffel-Darboux Formula, Christoffel-Darboux Identity, Christoffel-Darboux Kernel, Christoffel Function, Complete Biorthogonal System, Complete Orthogonal System, d-Orthogonal Polynomial, Favard's Theorem, Ferrers' Function, Fundamental Theorem of Gaussian Quadrature, Gaussian Quadrature, Gegenbauer Polynomial, Gram-Schmidt Orthonormalization, Hahn Polynomial, Hermite Polynomial, Jack Polynomial, Jacobi Matrix, Jacobi Polynomial, Krawtchouk Polynomial, Laguerre Polynomial, Legendre Polynomial, Meixner-Pollaczek Polynomial, Orthogonal Functions, Pollaczek Polynomial, Spherical Harmonic, Stieltjes-Wigert Polynomial, Zernike Polynomial

Explore with Wolfram|Alpha

References

Abramowitz, M. and Stegun, I. A. (Eds.). "Orthogonal Polynomials." Ch. 22 in Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, 9th printing. New York: Dover, pp. 771-802, 1972.Arfken, G. "Orthogonal Polynomials." Mathematical Methods for Physicists, 3rd ed. Orlando, FL: Academic Press, pp. 520-521, 1985.Brezinski, C. Padé-Type Approximation and General Orthogonal Polynomials. Basel, Switzerland: Birkhäuser, 1980. https://doi.org/10.1007/978-3-0348-6558-6.Chihara, T. S. An Introduction to Orthogonal Polynomials. New York: Gordon and Breach, 1978.Gautschi, W.; Golub, G. H.; and Opfer, G. (Eds.) Applications and Computation of Orthogonal Polynomials, Conference at the Mathematical Research Institute Oberwolfach, Germany, March 22-28, 1998. Basel, Switzerland: Birkhäuser, 1999.Iyanaga, S. and Kawada, Y. (Eds.). "Systems of Orthogonal Functions." Appendix A, Table 20 in Encyclopedic Dictionary of Mathematics. Cambridge, MA: MIT Press, p. 1477, 1980.Koekoek, R. and Swarttouw, R. F. The Askey-Scheme of Hypergeometric Orthogonal Polynomials and its q-Analogue. Delft, Netherlands: Technische Universiteit Delft, Faculty of Technical Mathematics and Informatics Report 98-17, 1-168, 1998.National Institute of Standards and Technology. "Differential Equations." §18.8 in NIST Digital Library of Mathematical Functions. https://dlmf.nist.gov/18.8.National Institute of Standards and Technology. "General Orthogonal Polynomials." §18.2 in NIST Digital Library of Mathematical Functions. https://dlmf.nist.gov/18.2.National Institute of Standards and Technology. "Recurrence Relations and Derivatives." §18.9 in NIST Digital Library of Mathematical Functions. https://dlmf.nist.gov/18.9.Nevai, P. (Ed.). Orthogonal Polynomials: Theory and Practice. Dordrecht, Netherlands: Kluwer, 1990. https://doi.org/10.1007/978-94-009-0501-6.Nikiforov, A. F.; Uvarov, V. B.; and Suslov, S. S. Classical Orthogonal Polynomials of a Discrete Variable. New York: Springer-Verlag, 1992.Sansone, G. Orthogonal Functions. New York: Dover, 1991.Stahl, H. and Totik, V. General Orthogonal Polynomials. Cambridge, England: Cambridge University Press, 1992. https://doi.org/10.1017/CBO9780511759420.Szegö, G. Orthogonal Polynomials, 4th ed. Providence, RI: Amer. Math. Soc., pp. 44-47 and 54-55, 1975.Trott, M. "General Properties of Orthogonal Polynomials." §2.1 in The Mathematica GuideBook for Symbolics. New York: Springer-Verlag, 2006. https://doi.org/10.1007/0-387-28815-5. https://www.mathematicaguidebooks.org/.

Referenced on Wolfram|Alpha

Orthogonal Polynomials

Cite this as:

Weisstein, Eric W. "Orthogonal Polynomials." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/OrthogonalPolynomials.html

Subject classifications