Laguerre polynomials are defined as solutions of Laguerre's differential equation:
xy'' + (1-x)y' + ny = 0Solutions corresponding to the non-negative integer n can be expressed using Rodrigues' formula
or can be constructed using the three term recurrence relation:
L0(x) = 1The recurrence relation given above is the most efficient way to calculate the Laguerre polynomial. The LaguerreCalculate subroutine uses this relation to calculate Ln(x) for any given x.
The LaguerreSum subroutine calculates the sum of Laguerre polynomials c0L0(x) + c1L1(x) + ... + cnLn(x) using Clenshaw's recurrence formula.
The LaguerreCoefficients subroutine can represent Ln(x) as a sum of powers of x: c0 + c1x + ... + cnxn.
This article is licensed for personal use only.
ALGLIB Project offers you two editions of ALGLIB:
ALGLIB Free Edition:
+delivered for free
+offers full set of numerical functionality
+extensive algorithmic optimizations
-no multithreading
-non-commercial license
ALGLIB Commercial Edition:
+flexible pricing
+offers full set of numerical functionality
+extensive algorithmic optimizations
+high performance (SMP, SIMD)
+commercial license with support plan
Links to download sections for Free and Commercial editions can be found below:
