Main       Download       Commercial support       FAQ       Forum       About Us

Legendre polynomials

The Legendre polynomials, sometimes called Legendre functions of the first kind, are defined as solutions of Legendre's differential equation:

Solutions corresponding to the non-negative integer n can be expressed using Rodrigues' formula

or can be constructed using the three term recurrence relation:

P(x) = 1
P(x) = x
(n+1)Pn+1 (x) = (2n+1)x P(x)-nPn-1 (x)

Unit description

The recurrence relation given above is the most efficient way to calculate the Legendre polynomial. The LegendreCalculate subroutine uses this relation to calculate P(x) for any given x.

The LegendreSum subroutine calculates the sum of Legendre polynomials cP(x) + cP(x) + ... + cP(x) using Clenshaw's recurrence formula.

The LegendreCoefficients subroutine can represent P(x) as a sum of powers of x: c + cx + ... + cx n.

This article is intended for personal use only.

Download ALGLIB

C#

C# source.

Downloads page

 

C++

C++ source.

Downloads page

 

C++, multiple precision arithmetic

C++ source. MPFR/GMP is used.

GMP source is available from gmplib.org. MPFR source is available from www.mpfr.org.

Downloads page

 

FreePascal

FreePascal version.

Downloads page

 

Delphi

Delphi version.

Downloads page

 

VB.NET

VB.NET version.

Downloads page

 

VBA

VBA version.

Downloads page

 

Python

Python version (CPython and IronPython are supported).

Downloads page

 

 

ALGLIB® - numerical analysis library, 1999-2012.
ALGLIB is a registered trademark of the ALGLIB Project.