Laguerre Polynomials


Also found in: Wikipedia.

Laguerre polynomials

[lə′ger ‚päl·ə′nō·mē·əlz]
(mathematics)
A sequence of orthogonal polynomials which solve Laguerre's differential equation for positive integral values of the parameter.

Laguerre Polynomials

 

(named after the French mathematician E. Laguerre, 1834–86), a special system of polynomials of successively increasing degree. For n = 0, 1, 2, … the Laguerre polynomials Ln(x) can be defined by the formula

The first few Laguerre polynomials are

L0(x) = 1, L1(x) = x – 1, l2(x) = x2 – 4x + 2

L3(x) = x3 – 9x2 + 18x – 6

The Laguerre polynomials are orthogonal on the half-line x ≥ 0 with respect to the weight function e–x and are solutions of the differential equation

xyn + (1 – x)y + ny = 0

The Laguerre polynomials are recursively defined by the formula

Ln+1(x) = (x – 2n – 1)Ln(x) – n2Ln–1(x)

REFERENCE

Lebedev, N. N. Spetsial’nye funktsii i ikh prilozheniia, 2nd ed. Moscow-Leningrad, 1963.
Mentioned in ?
References in periodicals archive ?
84 (15)] for Laguerre polynomials written in a slightly different form
In this paper, we focus on the computation of the VO-F integrals and derivatives of the modified generalized Laguerre polynomials. Applications of the constructed computations are illustrated to compute the VO-F Caputo derivative.
For both cases of Freud measures with [alpha] = 2 (generalized Hermite polynomials), and generalized Freud measures with [alpha] = 1 (generalized Laguerre polynomials), explicit forms for the recurrence coefficients are known.
Appendix A recalls some results concerning the Laguerre polynomials and Appendix B proves some combinatorial identities that we used in the proofs of lemmas and theorems.
The Adomian decomposition technique is improved via Chebyshevpolynomials in [9,10], with Legendre polynomials [11] and with Laguerre polynomials [12].
(iii) Laguerre Polynomials. For [alpha] > -1, the Laguerre polynomials {[L.sup.[alpha].sub.k]} are defined as the orthogonal polynomials associated with the Gamma measure on (0, [infinity]), [[mu].sub.[alpha](dx) = [[chi].sub.(0,[infinity])](x)([x.sup.[alpha][e.sup.-x]/[GAMMA]([alpha] + 1))dx, that is,
Association of Rodrigues Representation with Generalized Laguerre Polynomials
These polynomials can be expressed in terms of the generalized Laguerre polynomials as follows:
In order to eliminate the CFL stability condition, some unconditionally stable FDTD methods have been developed such as alternating-direction implicit (ADI) method [3], Crank-Nicolson method [4], locally one-dimensional method [5], and Weighted Laguerre Polynomials (WLP) FDTD method [6].
In the past thirty years, a series of unconditionally stable methods spring up in computational electromagnetic field, such as Crank-Nicolson FDTD (CN-FDTD) method [1], Alternating-Direction Implicit FDTD (ADI-FDTD) method [2], and Weighted Laguerre polynomials FDTD (WLP-FDTD) method [3].
Roy, "Model reduction in the time-domain using Laguerre polynomials and Krylov methods," in in Proceedings of the Design, Automation and Test in Europe Conference and Exhibition (DATE '02), pp.
are the Laguerre polynomials. Bernstein theorem identifies a real analytic function on the closed unit disk as the restriction of an analytic function defined on an open disk of radius R > 1 by computing R from the sequence of minimal errors generated from optimal polynomials approximates.