![]() |

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:
P0 (x) = 1The recurrence relation given above is the most efficient way to calculate the Legendre polynomial. The LegendreCalculate subroutine uses this relation to calculate Pn (x) for any given x.
The LegendreSum subroutine calculates the sum of Legendre polynomials c0 P0 (x) + c1 P1 (x) + ... + cn Pn (x) using Clenshaw's recurrence formula.
The LegendreCoefficients subroutine can represent Pn (x) as a sum of powers of x: c0 + c1 x + ... + cn x n.
This article is intended for personal use only.
C# source.
C++ source.
C++ source. MPFR/GMP is used.
GMP source is available from gmplib.org. MPFR source is available from www.mpfr.org.
FreePascal version.
Delphi version.
VB.NET version.
VBA version.
Python version (CPython and IronPython are supported).
|
ALGLIB® - numerical analysis library, 1999-2012. |