In mathematics, the classical orthogonal polynomials are the most widely used
orthogonal polynomials
In mathematics, an orthogonal polynomial sequence is a family of polynomials such that any two different polynomials in the sequence are orthogonal to each other under some inner product.
The most widely used orthogonal polynomials are the cl ...
: the
Hermite polynomials
In mathematics, the Hermite polynomials are a classical orthogonal polynomial sequence.
The polynomials arise in:
* signal processing as Hermitian wavelets for wavelet transform analysis
* probability, such as the Edgeworth series, as well ...
,
Laguerre polynomials In mathematics, the Laguerre polynomials, named after Edmond Laguerre (1834–1886), are solutions of Laguerre's equation:
xy'' + (1 - x)y' + ny = 0
which is a second-order linear differential equation. This equation has nonsingular solutions only ...
,
Jacobi polynomials
In mathematics, Jacobi polynomials (occasionally called hypergeometric polynomials) P_n^(x)
are a class of classical orthogonal polynomials. They are orthogonal with respect to the weight
(1-x)^\alpha(1+x)^\beta on the interval 1,1/math>. The ...
(including as a special case the
Gegenbauer polynomials,
Chebyshev polynomials
The Chebyshev polynomials are two sequences of polynomials related to the cosine and sine functions, notated as T_n(x) and U_n(x). They can be defined in several equivalent ways, one of which starts with trigonometric functions:
The Chebys ...
, and
Legendre polynomials
In physical science and mathematics, Legendre polynomials (named after Adrien-Marie Legendre, who discovered them in 1782) are a system of complete and orthogonal polynomials, with a vast number of mathematical properties, and numerous applicat ...
).
They have many important applications in such areas as mathematical physics (in particular, the theory of
random matrices),
approximation theory
In mathematics, approximation theory is concerned with how functions can best be approximated with simpler functions, and with quantitatively characterizing the errors introduced thereby. Note that what is meant by ''best'' and ''simpler'' wil ...
,
numerical analysis
Numerical analysis is the study of algorithms that use numerical approximation (as opposed to symbolic manipulations) for the problems of mathematical analysis (as distinguished from discrete mathematics). It is the study of numerical methods th ...
, and many others.
Classical orthogonal polynomials appeared in the early 19th century in the works of
Adrien-Marie Legendre
Adrien-Marie Legendre (; ; 18 September 1752 – 9 January 1833) was a French mathematician who made numerous contributions to mathematics. Well-known and important concepts such as the Legendre polynomials and Legendre transformation are nam ...
, who introduced the Legendre polynomials. In the late 19th century, the study of
continued fraction
In mathematics, a continued fraction is an expression obtained through an iterative process of representing a number as the sum of its integer part and the reciprocal of another number, then writing this other number as the sum of its integ ...
s to solve the
moment problem by
P. L. Chebyshev and then
A.A. Markov
AA, Aa, Double A, or Double-A may refer to:
Arts, entertainment and media
* ''America's Army'', a 2002 computer game published by the U.S. Army
* '' Ancient Anguish'', a computer game in existence since 1992
* Aa!, a J-Pop musical group
* Dou ...
and
T.J. Stieltjes led to the general notion of orthogonal polynomials.
For given
polynomial
In mathematics, a polynomial is an expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An ex ...
s
and
the classical orthogonal polynomials
are characterized by being solutions of the differential equation
:
with to be determined constants
.
There are several more general definitions of orthogonal classical polynomials; for example, use the term for all polynomials in the
Askey scheme
In mathematics, the Askey scheme is a way of organizing orthogonal polynomials of hypergeometric or basic hypergeometric type into a hierarchy. For the classical orthogonal polynomials discussed in , the Askey scheme was first drawn by and by , ...
.
Definition
In general, the orthogonal polynomials
with respect to a weight
satisfy
:
The relations above define
up to multiplication by a number. Various normalisations are used to fix the constant, e.g.
:
The classical orthogonal polynomials correspond to the following three families of weights:
:
The standard normalisation (also called ''standardization'') is detailed below.
Jacobi polynomials
For
the Jacobi polynomials are given by the formula
:
They are normalised (standardized) by
:
and satisfy the orthogonality condition
:
The Jacobi polynomials are solutions to the differential equation
:
Important special cases
The Jacobi polynomials with
are called the
Gegenbauer polynomials (with parameter
)
For
, these are called the
Legendre polynomials
In physical science and mathematics, Legendre polynomials (named after Adrien-Marie Legendre, who discovered them in 1782) are a system of complete and orthogonal polynomials, with a vast number of mathematical properties, and numerous applicat ...
(for which the interval of orthogonality is
minus;1, 1and the weight function is simply 1):
:
For
, one obtains the
Chebyshev polynomials
The Chebyshev polynomials are two sequences of polynomials related to the cosine and sine functions, notated as T_n(x) and U_n(x). They can be defined in several equivalent ways, one of which starts with trigonometric functions:
The Chebys ...
(of the second and first kind, respectively).
Hermite polynomials
The Hermite polynomials are defined by
:
They satisfy the orthogonality condition
:
and the differential equation
:
Laguerre polynomials
The generalised Laguerre polynomials are defined by
:
(the classical Laguerre polynomials correspond to
.)
They satisfy the orthogonality relation
:
and the differential equation
:
Differential equation
The classical orthogonal polynomials arise from a differential equation of the form
:
where ''Q'' is a given quadratic (at most) polynomial, and ''L'' is a given linear polynomial. The function ''f'', and the constant ''λ'', are to be found.
:(Note that it makes sense for such an equation to have a polynomial solution.
:Each term in the equation is a polynomial, and the degrees are consistent.)
This is a
Sturm–Liouville type of equation. Such equations generally have singularities in their solution functions f except for particular values of ''λ''. They can be thought of as
eigenvector/eigenvalue problems: Letting ''D'' be the
differential operator,
, and changing the sign of ''λ'', the problem is to find the eigenvectors (eigenfunctions) f, and the
corresponding eigenvalues ''λ'', such that f does not have singularities and ''D''(''f'') = ''λf''.
The solutions of this differential equation have singularities unless ''λ'' takes on
specific values. There is a series of numbers ''λ''
0, ''λ''
1, ''λ''
2, ... that led to a series of polynomial solutions ''P''
0, ''P''
1, ''P''
2, ... if one of the following sets of conditions are met:
# ''Q'' is actually quadratic, ''L'' is linear, ''Q'' has two distinct real roots, the root of ''L'' lies strictly between the roots of ''Q'', and the leading terms of ''Q'' and ''L'' have the same sign.
# ''Q'' is not actually quadratic, but is linear, ''L'' is linear, the roots of ''Q'' and ''L'' are different, and the leading terms of ''Q'' and ''L'' have the same sign if the root of ''L'' is less than the root of ''Q'', or vice versa.
# ''Q'' is just a nonzero constant, ''L'' is linear, and the leading term of ''L'' has the opposite sign of ''Q''.
These three cases lead to the Jacobi-like, Laguerre-like, and Hermite-like polynomials, respectively.
In each of these three cases, we have the following:
* The solutions are a series of polynomials ''P''
0, ''P''
1, ''P''
2, ..., each ''P''
''n'' having degree ''n'', and corresponding to a number λ
''n''.
* The interval of orthogonality is bounded by whatever roots ''Q'' has.
* The root of ''L'' is inside the interval of orthogonality.
* Letting
, the polynomials are orthogonal under the weight function
* ''W''(''x'') has no zeros or infinities inside the interval, though it may have zeros or infinities at the end points.
* ''W''(''x'') gives a finite inner product to any polynomials.
* ''W''(''x'') can be made to be greater than 0 in the interval. (Negate the entire differential equation if necessary so that ''Q''(''x'') > 0 inside the interval.)
Because of the constant of integration, the quantity ''R''(''x'') is determined only up to an arbitrary positive multiplicative constant. It will be used only in homogeneous differential equations
(where this doesn't matter) and in the definition of the weight function (which can also be
indeterminate.) The tables below will give the "official" values of ''R''(''x'') and ''W''(''x'').
Rodrigues' formula
Under the assumptions of the preceding section,
''P''
''n''(''x'') is proportional to
This is known as
Rodrigues' formula
In mathematics, Rodrigues' formula (formerly called the Ivory–Jacobi formula) is a formula for the Legendre polynomials independently introduced by , and . The name "Rodrigues formula" was introduced by Heine in 1878, after Hermite pointed out ...
, after
Olinde Rodrigues
Benjamin Olinde Rodrigues (6 October 1795 – 17 December 1851), more commonly known as Olinde Rodrigues, was a French banker, mathematician, and social reformer. In mathematics Rodrigues is remembered for Rodrigues' rotation formula for vectors, ...
. It is often written
:
where the numbers ''e''
''n'' depend on the standardization. The standard values of ''e''
''n'' will be given in the tables below.
The numbers ''λ''''n''
Under the assumptions of the preceding section, we have
:
(Since ''Q'' is quadratic and ''L'' is linear,
and
are constants, so these are just numbers.)
Second form for the differential equation
Let
:
Then
:
Now multiply the differential equation
:
by ''R''/''Q'', getting
:
or
:
This is the standard Sturm–Liouville form for the equation.
Third form for the differential equation
Let
Then
:
Now multiply the differential equation
:
by ''S''/''Q'', getting
:
or
:
But
, so
:
or, letting ''u'' = ''Sy'',
:
Formulas involving derivatives
Under the assumptions of the preceding section, let ''P'' denote the ''r''-th derivative of ''P''
''n''.
(We put the "r" in brackets to avoid confusion with an exponent.)
''P'' is a polynomial of degree ''n'' − ''r''. Then we have the following:
* (orthogonality) For fixed r, the polynomial sequence ''P'', ''P'', ''P'', ... are orthogonal, weighted by
.
* (generalized
Rodrigues' formula) ''P'' is proportional to
* (differential equation) ''P'' is a solution of
, where λ
''r'' is the same function as λ
''n'', that is,
* (differential equation, second form) ''P'' is a solution of
There are also some mixed recurrences. In each of these, the numbers ''a'', ''b'', and ''c'' depend on ''n''
and ''r'', and are unrelated in the various formulas.
*
*
*
There are an enormous number of other formulas involving orthogonal polynomials
in various ways. Here is a tiny sample of them, relating to the Chebyshev,
associated Laguerre, and Hermite polynomials:
*
*
*
Orthogonality
The differential equation for a particular ''λ'' may be written (omitting explicit dependence on x)
:
multiplying by
yields
:
and reversing the subscripts yields
:
subtracting and integrating:
:
but it can be seen that
:
so that:
:
If the polynomials ''f'' are such that the term on the left is zero, and
for
, then the orthogonality relationship will hold:
:
for
.
Derivation from differential equation
All of the polynomial sequences arising from the differential equation above are equivalent, under scaling and/or shifting of the domain, and standardizing of the polynomials, to more restricted classes. Those restricted classes are exactly "classical orthogonal polynomials".
* Every Jacobi-like polynomial sequence can have its domain shifted and/or scaled so that its interval of orthogonality is
minus;1, 1 and has ''Q'' = 1 − ''x''
2. They can then be standardized into the Jacobi polynomials
. There are several important subclasses of these: Gegenbauer, Legendre, and two types of Chebyshev.
* Every Laguerre-like polynomial sequence can have its domain shifted, scaled, and/or reflected so that its interval of orthogonality is
, and has ''Q'' = ''x''. They can then be standardized into the Associated Laguerre polynomials
. The plain Laguerre polynomials
are a subclass of these.
* Every Hermite-like polynomial sequence can have its domain shifted and/or scaled so that its interval of orthogonality is
, and has Q = 1 and L(0) = 0. They can then be standardized into the Hermite polynomials
.
Because all polynomial sequences arising from a differential equation in the manner
described above are trivially equivalent to the classical polynomials, the actual classical
polynomials are always used.
Jacobi polynomial
The Jacobi-like polynomials, once they have had their domain shifted and scaled so that
the interval of orthogonality is
minus;1, 1 still have two parameters to be determined.
They are
and
in the Jacobi polynomials,
written
. We have
and
.
Both
and
are required to be greater than −1.
(This puts the root of L inside the interval of orthogonality.)
When
and
are not equal, these polynomials
are not symmetrical about ''x'' = 0.
The differential equation
:
is Jacobi's equation.
For further details, see
Jacobi polynomials
In mathematics, Jacobi polynomials (occasionally called hypergeometric polynomials) P_n^(x)
are a class of classical orthogonal polynomials. They are orthogonal with respect to the weight
(1-x)^\alpha(1+x)^\beta on the interval 1,1/math>. The ...
.
Gegenbauer polynomials
When one sets the parameters
and
in the Jacobi polynomials equal to each other, one obtains the Gegenbauer or ultraspherical polynomials. They are written
, and defined as
:
We have
and
.
The parameter
is required to be greater than −1/2.
(Incidentally, the standardization given in the table below would make no sense for ''α'' = 0 and ''n'' ≠ 0, because it would set the polynomials to zero. In that case, the accepted standardization sets
instead of the value given in the table.)
Ignoring the above considerations, the parameter
is closely related to the derivatives of
:
:
or, more generally:
:
All the other classical Jacobi-like polynomials (Legendre, etc.) are special cases of the Gegenbauer polynomials, obtained by choosing a value of
and choosing a standardization.
For further details, see
Gegenbauer polynomials.
Legendre polynomials
The differential equation is
:
This is Legendre's equation.
The second form of the differential equation is:
:
The
recurrence relation
In mathematics, a recurrence relation is an equation according to which the nth term of a sequence of numbers is equal to some combination of the previous terms. Often, only k previous terms of the sequence appear in the equation, for a paramete ...
is
:
A mixed recurrence is
:
Rodrigues' formula is
:
For further details, see
Legendre polynomials
In physical science and mathematics, Legendre polynomials (named after Adrien-Marie Legendre, who discovered them in 1782) are a system of complete and orthogonal polynomials, with a vast number of mathematical properties, and numerous applicat ...
.
Associated Legendre polynomials
The
Associated Legendre polynomials
In mathematics, the associated Legendre polynomials are the canonical solutions of the general Legendre equation
\left(1 - x^2\right) \frac P_\ell^m(x) - 2 x \frac P_\ell^m(x) + \left \ell (\ell + 1) - \frac \rightP_\ell^m(x) = 0,
or equivalentl ...
, denoted
where
and
are integers with
, are defined as
:
The ''m'' in parentheses (to avoid confusion with an exponent) is a parameter. The ''m'' in brackets denotes the ''m''-th derivative of the Legendre polynomial.
These "polynomials" are misnamed—they are not polynomials when ''m'' is odd.
They have a recurrence relation:
:
For fixed ''m'', the sequence
are orthogonal over
minus;1, 1 with weight 1.
For given ''m'',
are the solutions of
:
Chebyshev polynomials
The differential equation is
:
This is
Chebyshev's equation.
The recurrence relation is
:
Rodrigues' formula is
:
These polynomials have the property that, in the interval of orthogonality,
:
(To prove it, use the recurrence formula.)
This means that all their local minima and maxima have values of −1 and +1, that is, the polynomials are "level". Because of this, expansion of functions in terms of Chebyshev polynomials is sometimes used for
polynomial approximations in computer math libraries.
Some authors use versions of these polynomials that have been shifted so that the interval of orthogonality is
, 1or
minus;2, 2
There are also Chebyshev polynomials of the second kind, denoted
We have:
:
For further details, including the expressions for the first few
polynomials, see
Chebyshev polynomials
The Chebyshev polynomials are two sequences of polynomials related to the cosine and sine functions, notated as T_n(x) and U_n(x). They can be defined in several equivalent ways, one of which starts with trigonometric functions:
The Chebys ...
.
Laguerre polynomials
The most general Laguerre-like polynomials, after the domain has been shifted and scaled, are the Associated Laguerre polynomials (also called generalized Laguerre polynomials), denoted
. There is a parameter
, which can be any real number strictly greater than −1. The parameter is put in parentheses to avoid confusion with an exponent. The plain Laguerre polynomials are simply the
version of these:
:
The differential equation is
:
This is Laguerre's equation.
The second form of the differential equation is
:
The recurrence relation is
:
Rodrigues' formula is
:
The parameter
is closely related to the derivatives of
:
:
or, more generally:
:
Laguerre's equation can be manipulated into a form that is more useful in applications:
:
is a solution of
:
This can be further manipulated. When
is an integer, and
:
:
is a solution of
:
The solution is often expressed in terms of derivatives instead of associated Laguerre polynomials:
:
This equation arises in quantum mechanics, in the radial part of the solution of the
Schrödinger equation
The Schrödinger equation is a linear partial differential equation that governs the wave function of a quantum-mechanical system. It is a key result in quantum mechanics, and its discovery was a significant landmark in the development of th ...
for a one-electron atom.
Physicists often use a definition for the Laguerre polynomials that is larger, by a factor of
, than the definition used here.
For further details, including the expressions for the first few polynomials, see
Laguerre polynomials In mathematics, the Laguerre polynomials, named after Edmond Laguerre (1834–1886), are solutions of Laguerre's equation:
xy'' + (1 - x)y' + ny = 0
which is a second-order linear differential equation. This equation has nonsingular solutions only ...
.
Hermite polynomials
The differential equation is
:
This is Hermite's equation.
The second form of the differential equation is
:
The third form is
:
The recurrence relation is
:
Rodrigues' formula is
:
The first few Hermite polynomials are
:
:
:
:
:
One can define the associated Hermite functions
:
Because the multiplier is proportional to the square root of the weight function, these functions
are orthogonal over
with no weight function.
The third form of the differential equation above, for the associated Hermite functions, is
:
The associated Hermite functions arise in many areas of mathematics and physics.
In quantum mechanics, they are the solutions of Schrödinger's equation for the harmonic oscillator.
They are also eigenfunctions (with eigenvalue (−''i''
''n'') of the
continuous Fourier transform
A Fourier transform (FT) is a mathematical transform that decomposes functions into frequency components, which are represented by the output of the transform as a function of frequency. Most commonly functions of time or space are transformed, ...
.
Many authors, particularly probabilists, use an alternate definition of the Hermite polynomials, with a weight function of
instead of
. If the notation ''He'' is used for these Hermite polynomials, and ''H'' for those above, then these may be characterized by
:
For further details, see
Hermite polynomials
In mathematics, the Hermite polynomials are a classical orthogonal polynomial sequence.
The polynomials arise in:
* signal processing as Hermitian wavelets for wavelet transform analysis
* probability, such as the Edgeworth series, as well ...
.
Characterizations of classical orthogonal polynomials
There are several conditions that single out the classical orthogonal polynomials from the others.
The first condition was found by Sonine (and later by Hahn), who showed that (up to linear changes of variable) the classical orthogonal polynomials are the only ones such that their derivatives are also orthogonal polynomials.
Bochner characterized classical orthogonal polynomials in terms of their recurrence relations.
Tricomi characterized classical orthogonal polynomials as those that have a certain analogue of the
Rodrigues formula.
Table of classical orthogonal polynomials
The following table summarises the properties of the classical orthogonal polynomials.
{, border="1" cellspacing="0" cellpadding="5" style="margin:1em auto;"
, -----
! Name, and conventional symbol
!
Chebyshev
Pafnuty Lvovich Chebyshev ( rus, Пафну́тий Льво́вич Чебышёв, p=pɐfˈnutʲɪj ˈlʲvovʲɪtɕ tɕɪbɨˈʂof) ( – ) was a Russian mathematician and considered to be the founding father of Russian mathematics.
Chebysh ...
,
!
Chebyshev
Pafnuty Lvovich Chebyshev ( rus, Пафну́тий Льво́вич Чебышёв, p=pɐfˈnutʲɪj ˈlʲvovʲɪtɕ tɕɪbɨˈʂof) ( – ) was a Russian mathematician and considered to be the founding father of Russian mathematics.
Chebysh ...
(second kind),
!
Legendre,
!
Hermite
Charles Hermite () FRS FRSE MIAS (24 December 1822 – 14 January 1901) was a French mathematician who did research concerning number theory, quadratic forms, invariant theory, orthogonal polynomials, elliptic functions, and algebra.
Hermite p ...
,
, -----
, Limits of orthogonality
,
,
,
,
, -----
, Weight,
,
,
,
,
, -----
, Standardization
,
,
,
, Lead term
, -----
, Square of norm
,
,
,
,
, -----
, Leading term
[The leading coefficient ''k''''n'' of ]
,
,
,
,
, -----
, Second term,
,
,
,
,
, -----
,
,
,
,
,
, -----
,
,
,
,
,
, -----
,
,
,
,
,
, -----
, Constant in diff. equation,
,
,
,
,
, -----
, Constant in Rodrigues' formula,
,
,
,
,
, -----
, Recurrence relation,
,
,
,
,
, -----
, Recurrence relation,
,
,
,
,
, -----
, Recurrence relation,
,
,
,
,
{, border="1" cellspacing="0" cellpadding="5" style="margin:1em auto;"
, -----
! Name, and conventional symbol
!
Associated Laguerre,
!
Laguerre,
, -----
, Limits of orthogonality
,
,
, -----
, Weight,
,
,
, -----
, Standardization
, Lead term
, Lead term
, -----
, Square of norm,
,
,
, -----
, Leading term,
,
,
, -----
, Second term,
,
,
, -----
,
,
,
, -----
,
,
,
, -----
,
,
,
, -----
, Constant in diff. equation,
,
,
, -----
, Constant in Rodrigues' formula,
,
,
, -----
, Recurrence relation,
,
,
, -----
, Recurrence relation,
,
,
, -----
, Recurrence relation,
,
,
{, border="1" cellspacing="0" cellpadding="5" style="margin:1em auto;"
, -----
! Name, and conventional symbol
!
Gegenbauer,
!
Jacobi,
, -----
, Limits of orthogonality
,
,
, -----
, Weight,
,
,
, -----
, Standardization
,
if
,
, -----
, Square of norm,
,
,
, -----
, Leading term,
,
,
, -----
, Second term,
,
,
, -----
,
,
,
, -----
,
,
,
, -----
,
,
,
, -----
, Constant in diff. equation,
,
,
, -----
, Constant in Rodrigues' formula,
,
,
, -----
, Recurrence relation,
,
,
, -----
, Recurrence relation,
,
,
, -----
, Recurrence relation,
,
,
See also
*
Appell sequence
In mathematics, an Appell sequence, named after Paul Émile Appell, is any polynomial sequence \_ satisfying the identity
:\frac p_n(x) = np_(x),
and in which p_0(x) is a non-zero constant.
Among the most notable Appell sequences besides th ...
*
Askey scheme
In mathematics, the Askey scheme is a way of organizing orthogonal polynomials of hypergeometric or basic hypergeometric type into a hierarchy. For the classical orthogonal polynomials discussed in , the Askey scheme was first drawn by and by , ...
of hypergeometric orthogonal polynomials
*
Polynomial sequences of binomial type
*
Biorthogonal polynomials In mathematics, a biorthogonal polynomial is a polynomial that is orthogonal to several different measures. Biorthogonal polynomials are a generalization of orthogonal polynomials and share many of their properties. There are two different concepts ...
*
Generalized Fourier series
*
Secondary measure
*
Sheffer sequence
In mathematics, a Sheffer sequence or poweroid is a polynomial sequence, i.e., a sequence of polynomials in which the index of each polynomial equals its degree, satisfying conditions related to the umbral calculus in combinatorics. They are na ...
*
Umbral calculus
In mathematics before the 1970s, the term umbral calculus referred to the surprising similarity between seemingly unrelated polynomial equations and certain "shadowy" techniques used to "prove" them. These techniques were introduced by John Bliss ...
Notes
References
*
*
*
*
*
*
*
*
*{{Cite book , last1=Szegő , first1=Gábor , title=Orthogonal Polynomials , url=https://books.google.com/books?id=3hcW8HBh7gsC , publisher= American Mathematical Society , series=Colloquium Publications , isbn=978-0-8218-1023-1 , mr=0372517 , year=1939 , volume=XXIII
Articles containing proofs
Orthogonal polynomials
Special hypergeometric functions
zh:正交多項式