Related papers: Discrete Fourier Transform Approximations Based on…
To investigate neural network parameters, it is easier to study the distribution of parameters than to study the parameters in each neuron. The ridgelet transform is a pseudo-inverse operator that maps a given function $f$ to the parameter…
In this paper, we use the Approximation Formula for the Fourier transform of the solution set of lattice points on k-spheres and methods of Bourgain and Ionescu to refine the l^p(Z^d)-boundedness results for discrete k- spherical maximal…
Fourier representations play a central role in operator learning methods for partial differential equations and are increasingly being explored in quantum machine learning architectures. The classical fast Fourier transform (FFT),…
Fourier transform is an essential ingredient in Shor's factoring algorithm. In the standard quantum circuit model with the gate set $\{\U(2), \textrm{CNOT}\}$, the discrete Fourier transforms $F_N=(\omega^{ij})_{N\times N},i,j=0,1,..., N-1,…
Tukey depth regions are important notions in nonparametric multivariate data analysis. A $\tau$-th Tukey depth region $\mathcal{D}_{\tau}$ is the set of all points that have at least depth $\tau$. While the Tukey depth regions are easily…
We consider the problem of approximating two, possibly unrelated probability distributions from a single complex-valued function $\psi$ and its Fourier transform. We show that this problem always has a solution within a specified degree of…
The Arithmetic Fourier Transform is a numerical formulation for computing Fourier series and Taylor series coefficients. It competes with the Fast Fourier Transform in terms of speed and efficiency, requiring only addition operations and…
The Fourier Transform is one of the most important linear transformations used in science and engineering. Cooley and Tukey's Fast Fourier Transform (FFT) from 1964 is a method for computing this transformation in time $O(n\log n)$. From a…
In this work, we develop a method for rational approximation of the Fourier transform (FT) based on the real and imaginary parts of the complex error function \[ w(z) = e^{-z^2}(1 - {\rm{erf}}(-iz)) = K(x,y) + iL(x,y), \qquad z = x + iy, \]…
The ability to represent complex high dimensional probability distributions in a compact form is one of the key insights in the field of graphical models. Factored representations are ubiquitous in machine learning and lead to major…
We present a general diagrammatic approach to the construction of efficient algorithms for computing a Fourier transform on a semisimple algebra. This extends previous work wherein we derive best estimates for the computation of a Fourier…
The purpose of this paper is to introduce several new convolution operators, generated by some known probability densities. By using the inverse Fourier transform and taking inverse steps (in the analogues of the classical procedures used…
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an n-dimensional signal. We show: * An O(k log n)-time randomized algorithm for the case where the input signal has at most k non-zero…
We propose a new integral based on Taylor measures, study its properties extensively, and we illustrate that it includes many concepts from mathematics as special cases. In particular, the new integral emerges as a generalization of the…
By viewing the nonuniform discrete Fourier transform (NUDFT) as a perturbed version of a uniform discrete Fourier transform, we propose a fast, stable, and simple algorithm for computing the NUDFT that costs $\mathcal{O}(N\log…
A discrete rotation algorithm can be apprehended as a parametric application $f\_\alpha$ from $\ZZ[i]$ to $\ZZ[i]$, whose resulting permutation ``looks like'' the map induced by an Euclidean rotation. For this kind of algorithm, to be…
For a real sequence of length of m = nl, we may deduce its congruence derivative sequence with length of l. The discrete Fourier transform of original sequence can be calculated by the discrete Fourier transform of the congruence derivative…
We give an new arithmetic algorithm to compute the generalized Discrete Fourier Transform (DFT) over finite groups $G$. The new algorithm uses $O(|G|^{\omega/2 + o(1)})$ operations to compute the generalized DFT over finite groups of Lie…
Discrete analogs of the classical Fourier-Jacobi transform are introduced and investigated. It involves series and integrals with respect to parameters of the Gauss hypergeometric function ${}_2F_1(a+in/2,a-in/2;\ c; -x^2 ), \ x >0, n \in…
A discrete Fourier analysis on the dodecahedron is studied, from which results on a tetrahedron is deduced by invariance. The results include Fourier analysis in trigonometric functions, interpolation and cubature formulas on these domains.…