Related papers: A one-to-two dimensional mapping using a partial f…
In this article, we study the properties of the nonlinear Fourier spectrum in order to gain better control of the temporal support of the signals synthesized using the inverse nonlinear Fourier transform (NFT). In particular, we provide…
Quantum phase transition in the one-dimensional period-two and uniform quantum compass model are studied by using the pseudo-spin transformation method and the trace map method. The exact solutions are presented, the fidelity, the…
Fast multidimensional convolution can be performed naively in quadratic time and can often be performed more efficiently via the Fourier transform; however, when the dimensionality is large, these algorithms become more challenging. A…
Fourier transformations of several functions of one and two variables are evaluated and then used to derive some integral and series identities. It is shown that certain double Mordell integrals can be reduced to a sum of products of…
Conventional photoemission orbital tomography based on Fourier iterative method enables us to extract a projected two-dimensional (2D) molecular orbital from a 2D photoelectron momentum map (PMM) of planar $\pi$-conjugated molecules in a…
We study an exactly solvable quantum field theory (QFT) model describing interacting fermions in 2+1 dimensions. This model is motivated by physical arguments suggesting that it provides an effective description of spinless fermions on a…
Fast linear transforms are ubiquitous in machine learning, including the discrete Fourier transform, discrete cosine transform, and other structured transformations such as convolutions. All of these transforms can be represented by dense…
Let $\mathbb{Z}^2\backslash SE(2)$ denote the right coset space of the subgroup consisting of translational isometries of the orthogonal lattice $\mathbb{Z}^2$ in the non-Abelian group of planar motions $SE(2)$. This paper develops a fast…
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 paper discusses the construction of high dimensional spatial discretizations for arbitrary multivariate trigonometric polynomials, where the frequency support of the trigonometric polynomial is known. We suggest a construction based on…
Let $E$ be a finite dimensional vector space over a local field, and $F$ be its dual. For a closed subset $X$ of $E$, and $Y$ of $F$, consider the space $D^{-\xi}(E;X,Y)$ of tempered distributions on $E$ whose support are contained in $X$…
The graph fractional Fourier transform (GFRFT) for unitary graph Fourier transform (GFT) matrices can be interpreted through the scalar function $e^{j\alpha\theta}$ on the unit circle. Under the principal branch, its Fourier-series…
Pseudo-spectral method is one of the most accurate techniques for simulating turbulent flows. Fast Fourier transform (FFT) is an integral part of this method. In this paper, we present a new procedure to compute FFT in which we save…
We present the detailed process of converting the classical Fourier Transform algorithm into the quantum one by using QR decomposition. This provides an example of a technique for building quantum algorithms using classical ones. The…
We study the dynamics of the one-dimensional quasi-affine map $x\mapsto \left\lfloor \lambda x +\mu \right\rfloor$, providing a complete description of the map's periodic points, and of the limit points of every $x\in\mathbb{R}$ under the…
In this paper we propose an approximation method for high-dimensional $1$-periodic functions based on the multivariate ANOVA decomposition. We provide an analysis on the classical ANOVA decomposition on the torus and prove some important…
We provide a rigorous convergence proof demonstrating that the well-known semi-analytical Fourier cosine (COS) formula for the inverse Fourier transform of continuous probability distributions can be extended to discrete probability…
Fast Fourier Transform (FFT)-based solvers for the Poisson equation are highly efficient, exhibiting $O(N\log N)$ computational complexity and excellent parallelism. However, their application is typically restricted to simple, regular…
A new approach for solving the optical inverse problem of quantitative photoacoustic tomography is introduced, which interpolates between the well-known diffusion approximation and a radiative transfer equation based model. The proposed…
In this paper we approximate high-dimensional functions $f\colon\mathbb T^d\to\mathbb C$ by sparse trigonometric polynomials based on function evaluations. Recently it was shown that a dimension-incremental sparse Fourier transform (SFT)…