Orthogonal fast spherical Bessel transform on uniform grid

Fast spherical Bessel transform via fast Fourier transform and recurrence formula

We propose a new method for the numerical evaluation of the spherical Bessel transform. A formula is derived for the transform by using an integral representation of the spherical Bessel function and by changing the integration variable. The resultant algorithm consists of a set of the Fourier transforms and numerical integrations over a linearly spaced grid of variable k in Fourier space. Beca...

Modeling of speech signals based on Bessel-like orthogonal transform

In this paper a novel modeling technique for speech signals, based on the source-filter model of speech production and on orthogonal transform theory, is presented. The proposed approach models the impulse response of such filter, by projection onto a basis of damped Bessel functions, which have been chosen for their similarity to the signal to be modeled. In such a way an orthogonal transform ...

Update of spherical Bessel transform: FFTW and OpenMP

A Fast Spherical Filter with Uniform Resolution

for transforming Legendre polynomial expansions, but it appears not to generalize to the spherical case. This paper introduces a fast algorithm for obtaining a uniform resolution representation of a function known at a latitude– Swarztrauber [12] has reviewed other transformation algolongitude grid on the surface of a sphere, equivalent to a triangular, rithms. isotropic truncation of the spher...

A fast spherical harmonics transform algorithm

The spectral method with discrete spherical harmonics transform plays an important role in many applications. In spite of its advantages, the spherical harmonics transform has a drawback of high computational complexity, which is determined by that of the associated Legendre transform, and the direct computation requires time of O(N3) for cut-off frequency N . In this paper, we propose a fast a...