Related papers: An in-place truncated Fourier transform
This paper gives a short survey of some basic results related to estimates of fractional integrals and Fourier transforms. It is closely adjoint to our previous survey papers \cite{K1998} and \cite{K2007}. The main methods used in the paper…
We investigate numerically efficient approximations of eigenspaces associated to symmetric and general matrices. The eigenspaces are factored into a fixed number of fundamental components that can be efficiently manipulated (we consider…
We present an innovative algorithm that simplifies the topology of a cross-field. Our algorithm works through macro-operations that allow us editing the graph of separatrices, which is extracted from a cross-field, while maintaining it…
We give a simple proof of Kolmogorov's theorem on the persistence of a quasiperiodic invariant torus in Hamiltonian systems. The theorem is first reduced to a well-posed inversion problem (Herman's normal form) by switching the frequency…
In relativistic quantum constraint mechanics the state of a physical system is constrained to a 3-dimensional subspace of Minkowski 4-space. Fourier transformation can be used to relate this state between constraint spaces in 4-position and…
The article presents a computationally effective algorithm for calculating the multiresolution discrete Fourier transform (MrDFT). The algorithm is based on the idea of reducing the computational complexity which was introduced by Wen and…
This paper presents a multilevel tensor compression algorithm called tensor butterfly algorithm for efficiently representing large-scale and high-dimensional oscillatory integral operators, including Green's functions for wave equations and…
Aligning partially overlapping point sets where there is no prior information about the value of the transformation is a challenging problem in computer vision. To achieve this goal, we first reduce the objective of the robust point…
We give the converse to Dirichlet's theorem on primes in arithmetic progressions by generalizing an old result of Guinand.
The stationary reflected Brownian motion in a three-quarter plane has been rarely analyzed in the probabilistic literature, in comparison with the quarter plane analogue model. In this context, our main result is to prove that the…
We study Fourier and Laplace transforms for Fourier hyperfunctions with values in a complex locally convex Hausdorff space. Since any hyperfunction with values in a wide class of locally convex Hausdorff spaces can be extended to a Fourier…
In many practical applications, spatial data are often collected at areal levels (i.e., block data) and the inferences and predictions about the variable at points or blocks different from those at which it has been observed typically…
We study the use of a learned forward operator in the inverse problem of photoacoustic tomography. The Fourier neural operator to approximate the photoacoustic wave propagation is used. Further, the inverse problem is solved using a…
Discrete transforms such as the discrete Fourier transform (DFT) or the discrete Hartley transform (DHT) furnish an indispensable tool in signal processing. The successful application of transform techniques relies on the existence of the…
Approximate methods have been considered as a means to the evaluation of discrete transforms. In this work, we propose and analyze a class of integer transforms for the discrete Fourier, Hartley, and cosine transforms (DFT, DHT, and DCT),…
Tensor completion is a natural higher-order generalization of matrix completion where the goal is to recover a low-rank tensor from sparse observations of its entries. Existing algorithms are either heuristic without provable guarantees,…
We show how an algorithm for the problem of inverting a permutation may be used to design one for the problem of unordered search (with a unique solution). Since there is a straightforward reduction in the reverse direction, the problems…
We introduce a fast and robust algorithm for finding a plane $\Gamma$ with given normal $\vec{n}_\Gamma$, which truncates an arbitrary polyhedron $\mathcal{P}$ such that the remaining sub-polyhedron admits a given volume…
Quantum computers provide a super-exponential speedup for performing a Fourier transform over the symmetric group, an ability for which practical use cases have remained elusive so far. In this work, we leverage this ability to unlock…
The Fourier operator truncated on a finite symmetric interval is considered. The limiting behavior of its spectrum is discussed as the length of the interval tends to infinity.