Related papers: Revisiting the Fast Fourier Transform in Rocq
Within the expansive domain of optical sciences, achieving the precise characterization of light beams stands as a fundamental pursuit, pivotal for various applications, including telecommunications and imaging technologies. This study…
We calculate the Fourier transform of a spherically symmetric exponential function. Our evaluation is much simpler than the known one. We use the polar coordinates and reduce the Fourier transform to the integral of a rational function of…
A q-version of the Fourier transformation and some of its properties are discussed.
Our approach to higher order Fourier analysis is to study the ultra product of finite (or compact) Abelian groups on which a new algebraic theory appears. This theory has consequences on finite (or compact) groups usually in the form of…
The transformer model is known to be computationally demanding, and prohibitively costly for long sequences, as the self-attention module uses a quadratic time and space complexity with respect to sequence length. Many researchers have…
In this paper we present a new fast and deterministic algorithm for the inverse discrete cosine transform of type II that reconstructs the input vector $\mathbf{x}\in\mathbb{R}^{N}$, $N=2^{J-1}$, with short support of length $m$ from its…
We present a computationally efficient algorithm for stable numerical differentiation from noisy, uniformly-sampled data on a bounded interval. The method combines multi-interval Fourier extension approximations with an adaptive domain…
Static analyzers based on abstract interpretation are complex pieces of software implementing delicate algorithms. Even if static analysis techniques are well understood, their implementation on real languages is still error-prone. This…
The Fourier inversion of phased coherent diffraction patterns offers images without the resolution and depth-of-focus limitations of lens-based tomographic systems. We report on our recent experimental images inverted using recent…
We show that the discrete complex, and numerous hypercomplex, Fourier transforms defined and used so far by a number of researchers can be unified into a single framework based on a matrix exponential version of Euler's formula…
We propose an alternative definition for a Tsallis entropy composition-inspired Fourier transform, which we call "$\tau_q$-Fourier transform". We comment about the underlying "covariance" on the set of algebraic fields that motivates its…
The Fock transform recently introduced by the authors in a previous paper is applied to investigate convergence of generalized functional sequences of a discrete-time normal martingale $M$. A necessary and sufficient condition in terms of…
Solutions to differential equations, which are used to model physical systems, are computed numerically by solving a set of discretized equations. This set of discretized equations is reduced to a large linear system, whose solution is…
Termination is an important property of programs; notably required for programs formulated in proof assistants. It is a very active subject of research in the Turing-complete formalism of term rewriting systems, where many methods and tools…
We propose a simpler derivation of the probability density function of Feller Diffusion using the Fourier Transform and solving the resulting equation via the Method of Characteristics. We also discuss simulation algorithms and confirm key…
The conventional Quantum Fourier Transform, with exponential speedup compared to the classical Fast Fourier Transform, has played an important role in quantum computation as a vital part of many quantum algorithms (most prominently, the…
Secure signal processing is becoming a de facto model for preserving privacy. We propose a model based on the Fully Homomorphic Encryption (FHE) technique to mitigate security breaches. Our framework provides a method to perform a Fast…
This report presents a formalisation of Sylow's theorems done in {\sc Coq}. The formalisation has been done in a couple of weeks on top of Georges Gonthier's {\sc ssreflect} \cite{ssreflect}. There were two ideas behind formalising Sylow's…
It is demonstrated is this letter that linear multistep methods for integrating ordinary differential equations can be used to develop a family of fast forward scattering algorithms with higher orders of convergence. Excluding the cost of…
In this work, we are interested by the $q$-Bessel Fourier transform with a new approach. Many important results of this $q$-integral transform are proved with a new constructive demonstrations and we establish in particular the associated…