Related papers: Fast Fourier Transforms for Spherical Gauss-Laguer…
A set of exactly computable orthonormal basis functions that are useful in computations involving constituent quarks is presented. These basis functions are distinguished by the property that they fall off algebraically in momentum space…
Computing the Fourier transform of a $q$-ary function $f:\mathbb{Z}_{q}^n\rightarrow \mathbb{R}$, which maps $q$-ary sequences to real numbers, is an important problem in mathematics with wide-ranging applications in biology, signal…
Uniform asymptotic expansions involving exponential and Airy functions are obtained for Laguerre polynomials $L_{n}^{(\alpha)}(x)$, as well as complementary confluent hypergeometric functions. The expansions are valid for $n$ large and…
The Fast Fourier Transform (FFT) over a finite field $\mathbb{F}_q$ computes evaluations of a given polynomial of degree less than $n$ at a specifically chosen set of $n$ distinct evaluation points in $\mathbb{F}_q$. If $q$ or $q-1$ is a…
For smooth finite fields $F_q$ (i.e., when $q-1$ factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomial operations, such as multiplication, division,…
Higher spatial resolution and larger imaging scene are always the goals pursued by advanced space-borne SAR system.High resolution and wide swath SAR imaging can provide more information about the illuminated scene of interest on one…
We present a new algorithm for the computation of the inverse Abel transform, a problem which emerges in many areas of physics and engineering. We prove that the Legendre coefficients of a given function coincide with the Fourier…
Using the existence of infinite numbers $k$ in the non-Archimedean ring of Robinson-Colombeau, we define the hyperfinite Fourier transform (HFT) by considering integration extended to $[-k,k]^{n}$ instead of $(-\infty,\infty)^{n}$. In order…
We review properties of confluent functions and the closely related Laguerre polynomials, and determine their bilinear integrals. As is well-known, these integrals are convergent only for a limited range of parameters. However, when one…
The one-dimensional (1D) fractional Fourier transform (FRFT) generalizes the Fourier transform, offering significant advantages in the time-frequency analysis of non-stationary signals. While various 2D extensions exist, such as the 2D…
We demonstrate a fast spin-s spherical harmonic transform algorithm, which is flexible and exact for band-limited functions. In contrast to previous work, where spin transforms are computed independently, our algorithm permits the…
Our main result provides a closed expression for the completely bounded Fourier multiplier norm of the spherical functions on the generalized Lorentz groups. As a corollary, we find that there is no uniform bound on the completely bounded…
The definition for the Slater-type orbitals is generalized. Transformation between an orthonormal basis function and the Slater-type orbital with non-integer principal quantum numbers is investigated. Analytical expressions for the linear…
We derive bilateral estimates for the constants appearing in the Fourier transform restricted theorems on the Euclidean sphere for the ordinary and especially radial functions belonging to the Lebesgue-Riesz spaces as well as belonging to…
In this paper a new class of radial basis functions based on hyperbolic trigonometric functions will be introduced and studied. We focus on the properties of their generalised Fourier transforms with asymptotics. Therefore we will compute…
The increasing demand for Fourier transforms on geometric algebras has resulted in a large variety. Here we introduce one single straight forward definition of a general geometric Fourier transform covering most versions in the literature.…
We propose an algorithm for the orthogonal fast discrete spherical Bessel transform on an uniform grid. Our approach is based upon the spherical Bessel transform factorization into the two subsequent orthogonal transforms, namely the fast…
The fractional Fourier transform (FrFT), which is a generalization of the Fourier transform, has become the focus of many research papers in recent years because of its applications in electrical engineering and optics. In this paper, we…
We propose a novel error analysis framework for scaled generalized Laguerre and generalized Hermite approximations.This framework can be regarded as an analogue of the Nyquist-Shannon sampling theorem: It characterizes the spatial and…
We present the 2-point function from Fast and Accurate Spherical Bessel Transformation (2-FAST) algorithm for a fast and accurate computation of integrals involving one or two spherical Bessel functions. These types of integrals occur when…