Related papers: Two Methods for Numerical Inversion of the Z-Trans…
This paper addresses a factorization method for imaging the support of a wave-number-dependent source function from multi-frequency data measured at a finite pair of symmetric receivers in opposite directions. The source function is given…
The Truncated Fourier Transform (TFT) is a variation of the Discrete Fourier Transform (DFT/FFT) that allows for input vectors that do NOT have length $2^n$ for $n$ a positive integer. We present the univariate version of the TFT,…
This brief note aims at condensing some results on the 32-point approximate DFT and discussing its arithmetic complexity.
The Number Theoretic Transform (NTT) can be regarded as a variant of the Discrete Fourier Transform. NTT has been quite a powerful mathematical tool in developing Post-Quantum Cryptography and Homomorphic Encryption. The Fourier Transform…
Image Representation learning via input reconstruction is a common technique in machine learning for generating representations that can be effectively utilized by arbitrary downstream tasks. A well-established approach is using…
This paper is concerned with the multi-frequency factorization method for imaging the support of a wave-number-dependent source function. It is supposed that the source function is given by the inverse Fourier transform of some…
In this paper, we provide a solution to the open problem of computing the Fourier transform of a binary function defined over $n$-bit vectors taking $m$-bit vector values. In particular, we introduce the two-modular Fourier transform (TMFT)…
The need to Fourier transform data sets with irregular sampling is shared by various domains of science. This is the case for example in astronomy or sismology. Iterative methods have been developed that allow to reach approximate…
Based on the definition of the Fourier transform in terms of the number operator of the quantum harmonic oscillator and in the corresponding definition of the fractional Fourier transform, we have obtained the discrete fractional Fourier…
Starting from a comparison of some established numerical algorithms for the computation of the eigenvalues (discrete or solitonic spectrum) of the non-Hermitian version of the Zakharov-Shabat spectral problem, this article delivers new…
The so-called non-uniform FFT (NFFT) is a family of algorithms for efficiently computing the Fourier transform of finite-length signals, whenever the time or frequency grid is nonuniformly spaced. Following the usual classification, there…
The nonlinear Fourier transform (NFT), a powerful tool in soliton theory and exactly solvable models, is a method for solving integrable partial differential equations governing wave propagation in certain nonlinear media. The NFT…
The inverse scattering transform is extended to investigate the Tzitz\'{e}ica equation. A set of sectionally analytic eigenfunctions and auxiliary eigenfunctions are introduced. We note that in this procedure, the auxiliary eigenfunctions…
We consider finite approximations of a fractal generated by an iterated function system of affine transformations on $\mathbb{R}^d$ as a discrete set of data points. Considering a signal supported on this finite approximation, we propose a…
We propose a numerical method to spline-interpolate discrete signals and then apply the integral transforms to the corresponding analytical spline functions. This represents a robust and computationally efficient technique for estimating…
This paper introduces Generalized Fourier transform (GFT) that is an extension or the generalization of the Fourier transform (FT). The Unilateral Laplace transform (LT) is observed to be the special case of GFT. GFT, as proposed in this…
An inverse nonequispaced fast Fourier transform (iNFFT) is a fast algorithm to compute the Fourier coefficients of a trigonometric polynomial from nonequispaced sampling data. However, various applications such as magnetic resonance imaging…
We investigate several approaches to address the inverse problem that arises in the limited inverse Fourier transform (L-IDFT) of quasi-distributions. The methods explored include Tikhonov regularization, the Backus-Gilbert method, the…
This paper is devoted to the efficient numerical solution of the Helmholtz equation in a two- or three-dimensional rectangular domain with an absorbing boundary condition (ABC). The Helmholtz problem is discretized by standard bilinear and…
We introduce the method of desingularization of multi-variable multiple zeta-functions (of the generalized Euler-Zagier type), under the motivation of finding suitable rigorous meaning of the values of multiple zeta-functions at…