Related papers: A numerical method of Fourier transform based on h…
In this paper, we propose a numerical method of computing an integral whose integrand is a slowly decaying oscillatory function. In the proposed method, we consider a complex analytic function in the upper-half complex plane, which is…
We introduce a new numerical method for the computation of the inverse nonlinear Fourier transform and compare its computational complexity and accuracy to those of other methods available in the literature. For a given accuracy, the…
In this paper, we consider a method for fast numerical computation of the Fourier transform of a slowly decaying function with given accuracy in given ranges of the frequency. In these decades, some useful formulas for the Fourier transform…
The Arithmetic Fourier Transform is a numerical formulation for computing Fourier series and Taylor series coefficients. It competes with the Fast Fourier Transform in terms of speed and efficiency, requiring only addition operations and…
We obtain an exact formula for the Fourier transform of multiradial functions, i.e., functions of the form $\Phi(x)=\phi(|x_1|, \dots, |x_m|)$, $x_i\in \mathbf R^{n_i}$, in terms of the Fourier transform of the function $\phi$ on $\mathbf…
We find a formula that relates the Fourier transform of a radial function on $\mathbf{R}^n$ with the Fourier transform of the same function defined on $\mathbf{R}^{n+2}$. This formula enables one to explicitly calculate the 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…
This work presents a method of computing Voigt functions and their derivatives, to high accuracy, on a uniform grid. It is based on an adaptation of Fourier-transform based convolution. The relative error of the result decreases as the…
We propose a novel definition of Fourier transform, with the property that the transform of a real function is again a real function (without doubling the number of real components). We prove the inversion theorem for the novel definition,…
We study the properties of different type of transforms by means of operational methods and discuss the relevant interplay with many families of special functions. We consider in particular the binomial transform and its generalizations. A…
Integral transforms are invaluable mathematical tools to map functions into spaces where they are easier to characterize. We introduce the hyperdimensional transform as a new kind of integral transform. It converts square-integrable…
The Fourier transform is naturally defined for integrable functrions. Otherwise, it should be stipulated in which sense the Fourier transform is understood. We consider some class of radial and, generally saying, nonintegrable functions.…
This algorithm is designed to perform numerical transforms to convert data from the temporal domain into the spectral domain. This algorithm obtains the spectral magnitude and phase by studying the Coefficient of Determination of a series…
Although being powerful, the differential transform method yet suffers from a drawback which is how to compute the differential transform of nonlinear non-autonomous functions that can limit its applicability. In order to overcome this…
The paper develops a method for discrete computational Fourier analysis of functions defined on quasicrystals and other almost periodic sets. A key point is to build the analysis around the emerging theory of quasicrystals and diffraction…
The solution of a nonlinear diffusion equation is numerically investigated using the generalized Fourier transform method. This equation includes fractal dimensions and power-law dependence on the radial variable and on the diffusion…
The Additive Transform of an arithmetic function represents a novel approach to examining the interplay between multiplicative arithmetic function and additive functions. This transform concept introduces a method to systematically generate…
In this paper, we first establish an evaluation formula to calculate Wiener integrals of functionals on Wiener space. We then apply our evaluation formula to carry out very easily calculating for the analytic Fourier-Feynman transform of…
We present a new general theory of function-based hypergraph transformations on finite families of finite hypergraphs. A function-based hypergraph transformation formalises the action of structurally modifying hypergraphs from a family in a…
In this paper we show that a methodology based on a sampling with the Gaussian function of kind $h\,{e^{ - {{\left( {t/c} \right)}^2}}}/\left( {{c}\sqrt \pi } \right)$, where ${c}$ and $h$ are some constants, leads to the Fourier transform…