Abstract
We present a simple and fast algorithm for the computation of the Gegenbauer transform, which is known to be very useful in the development of spectral methods for the numerical solution of ordinary and partial differential equations of physical interest. We prove that the coefficients of the expansion of a function f(x) in Gegenbauer (also known as ultraspherical) polynomials coincide with the Fourier coefficients of a suitable integral transform of the function f(x). This allows to compute N Gegenbauer coefficients in O(Nlog2N) operations by means of a single Fast Fourier Transform of the integral transform of f(x). We also show that the inverse Gegenbauer transform is expressible as the Abel-type transform of a suitable Fourier series. This fact produces a novel algorithm for the fast evaluation of Gegenbauer expansions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
