Laguerre polynomials are defined as solutions of Laguerre'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:

Unit description

The recurrence relation given above is the most efficient way to calculate the Laguerre polynomial. The LaguerreCalculate subroutine uses this relation to calculate L_n (x) for any given x.

The LaguerreSum subroutine calculates the sum of Laguerre polynomials c₀ L₀ (x) + c₁ L₁ (x) + ... + c_n L_n (x) using Clenshaw's recurrence formula.

The LaguerreCoefficients subroutine can represent L_n (x) as a sum of powers of x: c₀  + c₁ x + ... + c_n x ⁿ.

Report a bug

C#

C# 1.0 source.
laguerre.csharp.zip - Laguerre polynomials

C++

C++ source.
laguerre.cpp.zip - Laguerre polynomials
ablas.zip - optimized basic linear algebra subroutines with SSE2 support (for C++ sources only)

Delphi

Delphi source.
Can be compiled under FPC (in Delphi compatibility mode).
laguerre.delphi.zip - Laguerre polynomials

Visual Basic 6

Visual Basic 6 source.
laguerre.vb6.zip - Laguerre polynomials

Zonnon ^beta

Zonnon source.
Zonnon is an experimental language developed at ETH Zurich.
See www.zonnon.ethz.ch for more information.
laguerre.zonnon.zip - Laguerre polynomials