Related papers: A double Fourier sphere method for $d$-dimensional…
Two methods for fast Fourier transforms are used in a quantum context. The first method is for systems with dimension of the Hilbert space $D=d^n$ with $d$ an odd integer, and is inspired by the Cooley-Tukey formalism. The `large Fourier…
We consider an inverse problem arising in thermo-/photo- acoustic tomography that amounts to reconstructing a function $f$ from its circular or spherical means with the centers lying on a given measurement surface. (Equivalently, these…
Fourier series multiscale method, a concise and efficient analytical approach for multiscale computation, will be developed out of this series of papers. In the fourth paper, the application of the Fourier series multiscale method to the…
We construct a continuous function on the torus with almost everywhere divergence triangular sums of double Fourier series. An analogous theorem we also prove for eccentrical spherical sums.
The nonuniform discrete Fourier transform (NUDFT) and its inverse are widely used in various fields of scientific computing. In this article, we propose a novel superfast direct inversion method for type-III NUDFT. The proposed method…
We propose a multi-dimensional (M-D) sparse Fourier transform inspired by the idea of the Fourier projection-slice theorem, called FPS-SFT. FPS-SFT extracts samples along lines (1-dimensional slices from an M-D data cube), which are…
We find a formula that relates the Fourier transform of a radial function on $\mathbf{R}^n$ with the Fourier transform of the same function defined on $\mathbf{R}^{n+2}$. This formula enables one to explicitly calculate the Fourier…
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 implement an efficient method of computation of two dimensional Fourier-type integrals based on approximation of the integrand by Gaussian radial basis functions, which constitute a standard tool in approximation theory. As a result, we…
The Differential Fourier Holography (DFH) gives an exact mathematical solution of the inverse problem of diffraction in the Fraunhofer regime. After the first publication [1] the Differential Fourier Holography was successfully applied in…
We use the classical Fourier analysis to introduce analytic families of weighted differential operators on the unit sphere. These operators are polynomial functions of the usual Beltrami-Laplace operator. New inversion formulas are obtained…
In the articles [1] and [2] of D. Finch, M. Haltmeier, S. Patch and D. Rakesh inversion formulas were found in any dimension $n\geq2$ for recovering a smooth function with compact support in the unit ball from spherical means centered on…
We combine a periodization strategy for weighted $L_{2}$-integrands with efficient approximation methods in order to approximate multivariate non-periodic functions on the high-dimensional cube $\left[-\frac{1}{2},\frac{1}{2}\right]^{d}$.…
We present a super-high-efficiency approximate computing scheme for series sum and discrete Fourier transform. The summation of a series sum or a discrete Fourier transform is approximated by summing over part of the terms multiplied by…
Fourier series multiscale method, a concise and efficient analytical approach for multiscale computation, will be developed out of this series of papers. In the sixth paper, exact analysis of the wave propagation in a beam with rectangular…
The conditions for convergence of square and rectangular Fejer means of functions on the infinite dimensional torus were obtained, also a generalization of the results for the case of abstract measure spaces was formulated.
We derive and showcase a novel approach to approximating Fourier transforms in higher dimensions, focusing specifically on the case of 2D radially concentrated ('ring-like') functions. We first reduce the problem to that of evaluating the…
Consider an $s$-dimensional function being evaluated at $n$ points of a low discrepancy sequence (LDS), where the objective is to approximate the one-dimensional functions that result from integrating out $(s-1)$ variables. Here, the…
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…
The real Fourier-Mukai transform sends a section of a torus fibration to a connection over the total space of the dual torus fibration. By this method, Leung, Yau and Zaslow introduced deformed Hermitian Yang-Mills (dHYM) connections for…