Mathematical Methods (10/24.539)

VIII. Special Functions

Legendre’s Equation and Legendre Polynomials (in more detail)

As an illustration of the kind of manipulations necessary to develop and work with the special functions identified previously, let's expand somewhat our discussion of Legendre's equation and Legendre polynomials. The development and manipulations of the other special functions are handled in a similar manner (especially the various polynomial relationships - Hermite and Laguerre polynomials, for example).

Solution via Power Series

Recall that Legendre’s equation is given by

Since eqn. (8.11) is analytic around x0 = 0, we can use the standard power series method to determine y(x). For this case , let

and upon substitution of this form and its appropriate derivative relationships into the original equation, we get the recurrence relation

where a0 and a1 are arbitrary constants and . Therefore, we can write the solution to Legendre's equation as

where

and

These series converge for .

Standard Form for Legendre Polynomials

Now, in many applications, n in eqn. (8.11) will be a non-negative integer. But, when this is true, the above expressions [i.e. eqns. (8.15) and (8.16)] reduce to polynomials of order n. In particular, y1(x) is a polynomial of order n if n is even, and y2(x) is a polynomial of order n if n is odd. These polynomials, multiplied by some constants, are called Legendre Polynomials.

To put the polynomials into standard form, let's solve the above recurrence relation for am, giving

where

Now, instead of writing all the non-vanishing coefficients in terms of a0 or a1, let’s write them in terms of the coefficient of the highest power of x (i.e. an). In particular, choosing an as

gives

for all n where the domain of interest is .

To put the desired polynomials into final form, note that using eqn. (8.17) with m = n-2 gives

and, after some manipulation, this can be written as

Performing similar manipulations (i.e. some more magic) with m = n-4, eqn. (8.17) can also be written as

This procedure can be continued to develop a general relationship for, or

and

where M = n/2 or M = (n-1)/2, which whichever is an integer.

Note: The above steps, although not completely rigorous, show the basic idea for putting the general solution into standard form. The details here are not overly important, but eqns. (8.19) - (8.21) are indeed important, and they give the so-called Legendre Polynomials in standard form. The particular form given here is somewhat arbitrary, but it is consistent with most of the literature on this subject.

Some Low Order Legendre Polynomials

Putting specific values into eqns. (8.20) and (8.21) gives (recall that ):

n

m

Pn(x)

0

0

1

0

2

0, 1

3

0, 1

Etc. (but the algebra gets tedious)

Some Important Relationships

Note that Rodrique’s Formula can also be used to generate explicit formulae for the low order Legendre polynomials. In particular, given Rodrique's formula,

we can develop the low order polynomials as follows:

n

Pn(x)

0

1

2

3

Etc. (but this also becomes rather tedious)

The best way to generate explicit formulae for the Legendre polynomials is to use one of the many Recurrence Relations that are available (see your text or a good reference book on mathematical functions for a tabulation of these relationships - the well-known Handbook of Mathematical Functions by Abramowitz and Stegun is one excellent source, for example). These recurrence relationships are particularly useful for computer evaluation of Legendre polynomials and their derivatives. In particular, two such relations that are widely used are:

and

To illustrate the use of eqn. (8.23), let's develop an explicit expression for P3(x). To do this we simply let n = 2 in the recurrence relationship, or

Thus,

Since Pn(x) is simply a polynomial of order n, we can easily find first or higher-order derivative information. For example, is given by

A recurrence formula, however, is very handy for computer implementation. Using eqn. (8.24), we can generate this same result with

or as before.

As indicated previously, the most important special feature of the so-called Special Functions is their Orthogonality Property (see subsection on Orthogonal Functions). For the Legendre polynomials this relationship is written as

where is the Kronecker delta function.

Let’s derive this orthogonality relationship formally to show the basic procedure that is used for most developments of this type. Since Pm(x) and Pn(x) satisfy Legendre’s equation, we have for

Now multiply eqn. (8.28) by Pn(x) and eqn. (8.29) by Pm(x) and subtract the resultant expressions giving

but

Therefore, the above expression reduces to

Focusing again on the left hand side of this last expression, we see that

Therefore,

Finally, integrating this expression over the domain of interest gives

Note that the first part of this expression vanishes because the term evaluated at the limits goes identically to zero. Thus, since , the above expression reduces to

This is a statement of orthogonality for .

Developing a general expression for the normalization (i.e. for the case where m = n) is not very straightforward at all and there are a number of approaches that can be used (all of which are tedious). The approach chosen here starts with the Generating Function for Legendre polynomials,

Squaring both sides of eqn. (8.32) gives

Now integrating this expression gives

where the last equality is a result of the orthogonality relationship in eqn. (8.31).

Working on the left hand side of this expression, we have with

that

But for t2 < 1, the term containing the natural log function can be rewritten in terms of an infinite series expansion as

Therefore, the integral becomes

Finally, we have the result

and equating like coefficients, we see that

which is the desired normalization for the orthogonality relation for Legendre polynomials when m = n.

Application Notes

The primary purpose of the above developments is simply to demonstrate several important relations for a particular set of orthogonal polynomials. Similar manipulations can be performed for the other orthogonal functions (Hermite polynomials, Laguerre polynomials, etc.) and the reader is encouraged to seek out further details as needed for a particular application. Note that the choice of the specific orthogonal polynomial for a given application is often dictated by the domain of interest.

For Legendre polynomials, for example, the functions are orthogonal over an interval and this range makes them particularly suitable for problems involving spherical coordinates. In particular, Legendre polynomials are used extensively where the directional dependence of some quantity is treated explicitly - such as particle transport problems. Often, one of the direction variables, say , ranges from 0 to (i.e. ) and a simple change of variables, , has varying between ; the domain of interest for Legendre polynomials.

For example, say some quantity, , is a function of the direction variable . Then,

and one can write in terms of Legendre polynomials, or

where, in practice, the infinite series is truncated to a finite number of terms, giving an approximate relationship for . The first part of eqn. (8.35) is just a Generalized Fourier Series (or sometimes called a Fourier-Legendre series) representation for the function . The truncation to a finite number of terms represents the usual approximation made in most practical applications.

The expansion coefficients in eqn. (8.35) can be found by multiplying both sides of the expression by and integrating to give

Finally, one simply uses the orthogonality property of the Legendre polynomials and solves for an, which gives

or

One computes and stores the an's given basic information about , and then, when needed, is reconstructed using eqn. (8.35).

Note: In neutron and photon transport analyses, is the macroscopic scattering cross section as a function of the scattering angle (a cross section is related to the probability that a particular interaction will occur). This quantity is computed, on the fly, as part of the transport computations, and it is the expansion coefficients that are actually stored in the cross section library used in the code calculations. Most discrete ordinates transport codes (like the ANISN or DORT codes, for example) use a low order expansion for (i.e. N = 3 or 5). For example, if N = 5 in a given calculation, we refer to the cross section representation as a P5 approximation (which implies that a set of Legendre polynomials up to 5th order are used to represent the functional dependence of the cross sections with scattering angle). This approach gives good results and it saves a considerable amount of computational time and memory (relative to the use of the exact behavior of each material).

10/24.539 Lecture Notes by Dr. J. R. White, UMass-Lowell (updated October 1998).

Return to Online Courses