Article ID Journal Published Year Pages File Type
519667 Journal of Computational Physics 2013 11 Pages PDF
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)f(x) in Gegenbauer (also known as ultraspherical) polynomials coincide with the Fourier coefficients of a suitable integral transform of the function f(x)f(x). This allows to compute N   Gegenbauer coefficients in O(Nlog2N)O(Nlog2N) operations by means of a single Fast Fourier Transform of the integral transform of f(x)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.

Related Topics
Physical Sciences and Engineering Computer Science Computer Science Applications
Authors
, ,