On the computation of discrete Legendre polynomial coefficients

DOI10.1007/BF00986240zbMATH Open0778.33005OpenAlexW3013620894MaRDI QIDQ1801481FDOQ1801481

Authors: Maurice F. Aburdene 

Publication date: 17 August 1993

Published in: Multidimensional Systems and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00986240

Recommendations

• Recursive computation of discrete Legendre polynomial coefficients
• A fast and simple algorithm for the computation of Legendre coefficients
• On fast algorithms for the evaluation of Legendre coefficients
• A fast FFT-based discrete Legendre transform
• A Fast Algorithm for the Evaluation of Legendre Expansions

zbMATH Keywords

Legendre polynomials

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Title not available (Why is that?)
• The Fast Computation of Dolph‐Chebyshev Coefficients
• Computing the associated Legendre polynomials through a matrix-eigenvalue algorithm
• Recursive computation of discrete Legendre polynomial coefficients
• Unification of Legendre, Laguerre, Hermite, and binomial discrete transforms using Pascal's matrix
• Title not available (Why is that?)

This page was built for publication: On the computation of discrete Legendre polynomial coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801481)