Efficient Legendre polynomials transforms: from recurrence relations to Schoenberg's theorem
classification
🧮 math.NA
hep-th
keywords
approachefficientlegendrepolynomialsschoenbergtheoremalgebraicallow
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.