Related papers: Quantitative estimates: How well does the discrete…
The Sinc approximation is a function approximation formula that attains exponential convergence for rapidly decaying functions defined on the whole real axis. Even for other functions, the Sinc approximation works accurately when combined…
Nonuniform Fourier data are routinely collected in applications such as magnetic resonance imaging, synthetic aperture radar, and synthetic imaging in radio astronomy. To acquire a fast reconstruction that does not require an online inverse…
In this paper, we study the error behavior of the nonequispaced fast Fourier transform (NFFT). This approximate algorithm is mainly based on the convenient choice of a compactly supported window function. So far, various window functions…
Fourier extension is an approximation method that alleviates the periodicity requirements of Fourier series and avoids the Gibbs phenomenon when approximating functions. We describe a similar extension approach using regular wavelet bases…
In recent years there has been a growing interest in the fractional Fourier transform driven by its large number of applications. The literature in this field follows two main routes. On the one hand, the areas where the ordinary Fourier…
The discounted central limit theorem concerns the convergence of an infinite discounted sum of i.i.d. random variables to normality as the discount factor approaches $1$. We show that, using the Fourier metric on probability distributions,…
The compensated quotient-difference (Compqd) algorithm is proposed along with some applications. The main motivation is based on the fact that the standard quotient-difference (qd) algorithm can be numerically unstable. The Compqd algorithm…
We prove Fourier restriction estimates to arbitrary compact $C^{N}$ curves for any $N > d$ in the (sharp) Drury range, using a power of the affine arclength measure as a mitigating factor. In particular, we make no nondegeneracy assumption…
In this work, we describe examples for calculating the 1-D circular convolution of signals represented by 3-qubit superpositions. The case is considered, when the discrete Fourier transform of one of the signals is known and calculated in…
The Fourier transform is naturally defined for integrable functrions. Otherwise, it should be stipulated in which sense the Fourier transform is understood. We consider some class of radial and, generally saying, nonintegrable functions.…
Spatial variables can be observed in many different forms, such as regularly sampled random fields (lattice data), point processes, and randomly sampled spatial processes. Joint analysis of such collections of observations is clearly…
Diffusive representations of fractional derivatives have proven to be useful tools in the construction of fast and memory efficient numerical methods for solving fractional differential equations. A common challenge in many of the known…
The state-of-the-art automotive radars employ multidimensional discrete Fourier transforms (DFT) in order to estimate various target parameters. The DFT is implemented using the fast Fourier transform (FFT), at sample and computational…
Random Fourier features (RFF) represent one of the most popular and wide-spread techniques in machine learning to scale up kernel algorithms. Despite the numerous successful applications of RFFs, unfortunately, quite little is understood…
The quantum Fourier transform (QFT) is a fundamental primitive in quantum computation and quantum information. In this work, we generalize the QFT for finite groups to a QFT for finite-dimensional semisimple algebras, and give efficient…
A novel algorithm is proposed for quantitative comparisons between compact surfaces embedded in the three-dimensional Euclidian space. The key idea is to identify those objects with the associated surface measures and compute a weak…
We propose a Gauss-Legendre quadrature based sampling on the rotation group for the representation of a band-limited signal such that the Fourier transform (FT) of a signal can be exactly computed from its samples. Our figure of merit is…
The paper deals with continuous and compact mappings generated by the Fourier transform between distinguished function spaces on $\mathbb{R}^n$. The degree of compactness will be measured in terms of related entropy numbers. We are more…
In this paper, exact rate of approximation of functions by linear means of Fourier series and Fourier integrals and corresponding $K$-functionals are expressed via special moduli of smoothness. . Introduction is given in $\S 1$. In $\S2$…
This article presents a convenient approach to Fourier analysis for the investigation of functions and distributions defined in $\mathbb{T}^m \times \mathbb{R}^n$. Our approach involves the utilization of a mixed Fourier transform,…