Related papers: Fast Computation of Voigt Functions via Fourier Tr…
In this paper, we propose a fast and accurate numerical method based on Fourier transform to solve Kolmogorov forward equations of symmetric scalar L\'evy processes. The method is based on the accurate numerical formulas for Fourier…
Let (G, V) be a prehomogeneous vector space, let O be any G(F_q)-invariant subset of V(F_q), and let f be the characteristic function of O. In this paper we develop a method for explicitly and efficiently evaluating the Fourier transform of…
The $N$-point discrete Fourier transform (DFT) is a cornerstone for several signal processing applications. Many of these applications operate in real-time, making the computational complexity of the DFT a critical performance indicator to…
We prove an explicit formula for the Fourier transform of $f(u(t))$, given the Fourier transform of $f(t)$, assuming $f\in L^2(-\infty,\infty)$ and $u$ sufficiently well behaved. We illustrate its usefulness by calculating the Fourier…
In this work we develop a new algorithm for the efficient computation of the Voigt/complex error function. In particular, in this approach we propose a two-domain scheme where the number of the interpolation grid-points is dependent on the…
In this work we show how to perform a rapid computation of the Voigt/complex error over a single domain by vectorized interpolation. This approach enables us to cover the entire set of the parameters $x,y \in \mathbb{R}$ required for the…
We present a novel class of methods to compute functions of matrices or their action on vectors that are suitable for parallel programming. Solving appropriate simple linear systems of equations in parallel (or computing the inverse of…
The Discrete Fourier Transform (DFT) is essential for various applications ranging from signal processing to convolution and polynomial multiplication. The groundbreaking Fast Fourier Transform (FFT) algorithm reduces DFT time complexity…
Recently, the numerical schemes of the Fokker-Planck equations describing anomalous diffusion with two internal states have been proposed in [Nie, Sun and Deng, arXiv: 1811.04723], which use convolution quadrature to approximate the…
In the paper it is shown that there exist infinite classes of fast DFT algorithms having multiplicative complexity lower than O(NlogN), i.e. smaller than their arithmetical complexity. The derivation starts with nesting of Discrete Fourier…
We revisit the Fourier transform of a Hankel function, of considerable importance in the theory of knife edge diffraction. Our approach is based directly upon the underlying Bessel equation, which admits manipulation into an alternate…
Efficient algorithms for computing linear convolutions based on the fast Fourier transform are developed. A hybrid approach is described that combines the conventional practice of explicit dealiasing (explicitly padding the input data with…
The Fast Fourier Transform (FFT) is a computationally intensive digital signal processing (DSP) function widely used in applications such as imaging, software-defined radio, wireless communication, instrumentation. In this paper, a…
We present a systematic, algebraically based, design methodology for efficient implementation of computer programs optimized over multiple levels of the processor/memory and network hierarchy. Using a common formalism to describe the…
Discrete cosine transform (DCT) and other Fourier-related transforms have broad applications in scientific computing. However, off-the-shelf high-performance multi-dimensional DCT (MD DCT) libraries are not readily available in parallel…
This paper is a companion paper to [G4], where sharp estimates are proven for Fourier transforms of compactly supported functions built out of two-dimensional real-analytic functions. The theorems of [G4] are stated in a rather general…
Important problems across multiple disciplines involve computations on the semiring $(\times, \max)$ (or its equivalents, the negated version $(\times, \min)$), the log-transformed version $(+, \max)$, or the negated log-transformed version…
Image computation is a fundamental tool for performance assessment of astronomical instrumentation, usually implemented by Fourier transform techniques. We review the numerical implementation, evaluating a direct implementation of the…
An integrated photonic circuit architecture to perform a modified-convolution operation based on the Discrete Fractional Fourier Transform (DFrFT) is introduced. This is accomplished by utilizing two nonuniformly-coupled waveguide lattices…
The Quantum Fourier Transform offers an interesting way to perform arithmetic operations on a quantum computer. We review existing Quantum Fourier Transform adders and multipliers and propose some modifications that extend their…