The discrete (or finite) Legendre transform (DLT) evaluates a Legendre series expansion at Legendre nodes on [−1,1].

The discrete Legendre transformation is investigated in a space of complex-valued sequences of exponential growth and its dual.

2 мая 2015 г. · The algorithm combines a recently developed fast transform for converting between Legendre and Chebyshev coefficients with a Taylor series expansion.

The finite Legendre transform (fLT) transforms a mathematical function defined on the finite interval into its Legendre spectrum.

The discrete Legendre transformation is investigated in a space of complex-val- ued sequences of exponential growth and its dual. Inversion and uniqueness.

This is a minimal Python package for fast discrete Legendre transforms (DLTs). The implementation uses a recursive version of the matrix relations by Alpert & ...

The discrete transformation (LF)(x) = f(x) = ∑∞n = 0((2n + 1)/2)Pn(x)F(n), where thePn(x)'s denote the well-known Legendre polynomials, is an isomorphism ...

Продолжительность: 16:41
Опубликовано: 25 дек. 2020 г.

Abstract: This paper presents a parallel implementation of the discrete Legendre transform using SIMD machines, MasPar MP-1 and MP-2.

The Legendre transform is used to convert functions of one quantity (such as position, pressure, or temperature) into functions of the conjugate quantity. Involution (mathematics) · Convex conjugate · Conjugate variables