Related papers: The fast Fourier Transform and fast Wavelet Transf…
We study Fourier transforms of holonomic D-modules on the complex affine line and show that their enhanced solution complexes are described by a twisted Morse theory. We thus recover and even strengthen the well-known formula for their…
The increasing demand for Fourier transforms on geometric algebras has resulted in a large variety. Here we introduce one single straight forward definition of a general geometric Fourier transform covering most versions in the literature.…
This paper is devoted to a discussion of the Discrete Fourier Transform (DFT) representation of a chaotic finite-duration sequence. This representation has the advantage that is itself a finite-duration sequence corresponding to samples…
Fourier transforms are ubiquitous mathematical tools in basic and applied sciences. We here report classical and quantum optical realizations of the discrete fractional Fourier transform, a generalization of the Fourier transform. In the…
Fast Fourier transform (FFT) based methods have turned out to be an effective computational approach for numerical homogenisation. In particular, Fourier-Galerkin methods are computational methods for partial differential equations that are…
This paper describes an extension of Fourier approximation methods for multivariate functions defined on the torus $\mathbb{T}^d$ to functions in a weighted Hilbert space $L_{2}(\mathbb{R}^d, \omega)$ via a multivariate change of variables…
Deep Learning-based Computer Vision field has recently been trying to explore larger kernels for convolution to effectively scale up Convolutional Neural Networks. Simultaneously, new paradigm of models such as Vision Transformers find it…
This article addresses the problem of two- and higher dimensional pattern matching, i.e. the identification of instances of a template within a larger signal space, which is a form of registration. Unlike traditional correlation, we aim at…
Wave turbulence in a thin elastic plate is experimentally investigated. By using a Fourier transform profilometry technique, the deformation field of the plate surface is measured simultaneously in time and space. This enables us to compute…
Efficient algorithms for computing linear convolutions based on the fast Fourier transform are developed. A hybrid approach is described that combines the conventional practice of explicit dealiasing (explicitly padding the input data with…
Recent work introduced a unified framework for steerable and directional wavelets in two and three dimensions that ensures many desirable properties, such as a multi-scale structure, fast transforms, and a flexible angular localization. We…
This paper develops fast graph Fourier transform (GFT) algorithms with O(n log n) runtime complexity for rank-one updates of the path graph. We first show that several commonly-used audio and video coding transforms belong to this class of…
An effective way to design structured coherent wave interference patterns that builds on the theory of coherent lattices, is presented. The technique combines prime number factorization in the complex plane with moir\'e theory to provide a…
We introduce a fast algorithm for generating long self-affine profiles. The algorithm, which is based on the fast wavelet transform, is faster than the conventional Fourier filtering algorithm. In addition to increased performance for large…
Wavelets, known to be useful in non-linear multi-scale processes and in multi-resolution analysis, are shown to have a q-deformed algebraic structure. The translation and dilation operators of the theory associate with any scaling equation…
We propose a novel framework for fast integral operations by uncovering hidden geometries in the row and column structures of the underlying operators. This is accomplished through the \texttt{Questionnaire} algorithm, an iterative…
The FFT algorithm that implements the discrete Fourier transform is considered one of the top ten algorithms of the $20$th century. Its main strengths are the low computational cost of $\mathcal{O}(n \log n$) and its stability. It is one of…
A many-body Fourier transformation with logarithmic scaling in the number of necessary two-site gates is implemented. The protocol is applied to study the Bethe chain as a prototype of a translationally invariant system. The resulting band…
Discrete transforms such as the discrete Fourier transform (DFT) and the discrete Hartley transform (DHT) are important tools in numerical analysis. The successful application of transform techniques relies on the existence of efficient…
In deep time series forecasting, the Fourier Transform (FT) is extensively employed for frequency representation learning. However, it often struggles in capturing multi-scale, time-sensitive patterns. Although the Wavelet Transform (WT)…