Related papers: The fast Fourier Transform and fast Wavelet Transf…
Modeling turbulent flows by a random Fourier decomposition is a classical procedure in order to use simplified models of turbulence in heat transport and other applications. We carefully investigate the Fourier time series of…
The graph Fourier transform (GFT) is an important tool for graph signal processing, with applications ranging from graph-based image processing to spectral clustering. However, unlike the discrete Fourier transform, the GFT typically does…
In this article we introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be…
The pseudo-polar Fourier transform is a specialized non-equally spaced Fourier transform, which evaluates the Fourier transform on a near-polar grid, known as the pseudo-polar grid. The advantage of the pseudo-polar grid over other…
Motivated by the classical studies on transformations of conjugate nets, we develop the general geometric theory of transformations of their discrete analogues: the multidimensional quadrilateral lattices, i.e. lattices x: Z^N -> R^M, whose…
In this study, we introduce and explore a delay differential equation that lends itself to explicit solutions in the Fourier-transformed space. Through the careful alignment of the initial function, we can construct a highly accurate…
Random Fourier features provide a way to tackle large-scale machine learning problems with kernel methods. Their slow Monte Carlo convergence rate has motivated the research of deterministic Fourier features whose approximation error can…
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…
It is demonstrated that the wavelets can be used to considerably speed up simulations of the wave packet propagation in multiscale systems. Extremely high efficiency is obtained in the representation of both bound and continuum states. The…
We define the notion of the Fourier transform for the rook monoid (also called the symmetric inverse semigroup) and provide two efficient divide-and-conquer algorithms (fast Fourier transforms, or FFTs) for computing it. This paper marks…
We use Fourier methods to prove that if $n > 1$ translates of sublattices of $Z^d$ tile $Z^d$, and all the sublattices are Cartesian products of arithmetic progressions, then two of the tiles must be translates of each other. This is a…
The paper develops theory of covariant transform, which is inspired by the wavelet construction. It was observed that many interesting types of wavelets (or coherent states) arise from group representations which are not square integrable…
Finding a computationally efficient algorithm for the inverse continuous wavelet transform is a fundamental topic in applications. In this paper, we show the convergence of the inverse wavelet transform.
Pressing questions in cosmology such as the nature of dark matter and dark energy can be addressed using large galaxy surveys, which measure the positions, properties and redshifts of galaxies in order to map the large-scale structure of…
In recent years twisted bi-layers of 2D materials became very popular in the field due to the possibility to totally change their electronic properties by simple rotation. At the same time, in the wide field of photonic crystals, this idea…
The prevalence of convolution in applications within signal processing, deep neural networks, and numerical solvers has motivated the development of numerous fast convolution algorithms. In many of these problems, convolution is performed…
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classical computing there is another class of unitary transforms,…
The plane wave method is most widely used for solving the Kohn-Sham equations in first-principles materials science computations. In this procedure, the three-dimensional (3-dim) trial wave functions' fast Fourier transform (FFT) is a…
In recent years directional multiscale transformations like the curvelet- or shearlet transformation have gained considerable attention. The reason for this is that these transforms are - unlike more traditional transforms like wavelets -…
Model sets are projections of certain lattice subsets. It was realised by Moody that dynamical properties of such sets are induced from the torus associated with the lattice. We follow and extend this approach by studying dynamics on the…