Efficient Legendre polynomials transforms: from recurrence relations to Schoenberg's theorem

2017/09/17 by Enrico Onofri, Onofri, Enrico
Computer Science · Engineering · #Control Systems and Identification #Digital Filter Design and Implementation #FOS: Mathematics #FOS: Physical sciences #High Energy Physics - Theory (hep-th) #Numerical Analysis (math.NA) #Numerical Methods and Algorithms

paper · pdf · doi:10.48550/arxiv.1709.06082

openalex publication_date 2017/09/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We report results on various techniques which allow to compute the expansion into Legendre (or in general Gegenbauer) polynomials in an efficient way. We describe in some detail the algebraic/symbolic approach already presented in Ref.1 and expand on an alternative approach based on a theorem of Schoenberg.

Related

• Generating Functions for Lacunary Legendre and Legendre-like Polynomials
• Legendre Polynomials and Their Use for Karhunen-Loève Expansion
• Rapidly Computing Sparse Legendre Expansions via Sparse Fourier Transforms
• A new and efficient method for the computation of Legendre coefficients
• The scaling properties and the multiple derivative of Legendre\n polynomials