Related papers: A numerical method of Fourier transform based on h…
We propose an implementation of the algorithm for the fast Fourier transform (FFT) as a quantum circuit consisting of a combination of some quantum gates. In our implementation, a data sequence is expressed by a tensor product of vector…
Based on diffraction theory and the propagation of the light, Fourier optics is a powerful tool allowing the estimation of a visible-range imaging system to transfer the spatial frequency components of an object. The analyses of the imaging…
In this work we present new methods for transforming and solving finite series by using the Laplace transform. In addition we introduce both an alternative method based on the Fourier transform and a simplified approach. The latter allows a…
The results presented in this paper are refinements of some results presented in a previous paper. Three such refined results are presented. The first one relaxes one of the basic hypotheses assumed in the previous paper, and thus extends…
In this paper we explain how to use the Fast Fourier Transform (FFT) to solve partial differential equations (PDEs). We start by defining appropriate discrete domains in coordinate and frequency domains. Then describe the main limitation of…
Purpose of writing this paper is to solve a transcendental function containing a product of a variable and its double exponential by a unique method of approximation. If the value of the said product is given, then its inverse function is…
In this paper we show how to use Fourier transform methods to analyze the asymptotic behavior of kernel distribution function estimators. Exact expressions for the mean integrated squared error in terms of the characteristic function of the…
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…
We present a general diagrammatic approach to the construction of efficient algorithms for computing the Fourier transform of a function on a finite group. By extending work which connects Bratteli diagrams to the construction of Fast…
Quantum Fourier Transform (QFT) plays a principal role in the development of efficient quantum algorithms. Since the number of quantum bits that can currently built is limited, while many quantum technologies are inherently three- (or more)…
In the present article the author extends the Fourier transform to a more general class of functions; First to power-law functions with integer and half-integer exponents then to the widely used quantum statistics function (Fermi-Dirac and…
This paper provides a new approach to derive various arbitrary high order finite difference formulae for the numerical differentiation of analytic functions. In this approach, various first and second order formulae for the numerical…
We survey four instances of the Fourier analytic 'transference principle' or 'dense model lemma', which allows one to approximate an unbounded function on the integers by a bounded function with similar Fourier transform. Such a result…
Recently, we have proposed a new diffusive representation for fractional derivatives and, based on this representation, suggested an algorithm for their numerical computation. From the construction of the algorithm, it is immediately…
We prove an explicit formula for the Fourier transform of $f(u(t))$, given the Fourier transform of $f(t)$, assuming $f\in L^2(-\infty,\infty)$ and $u$ sufficiently well behaved. We illustrate its usefulness by calculating the Fourier…
In this paper a sublinear time algorithm is presented for the reconstruction of functions that can be represented by just few out of a potentially large candidate set of Fourier basis functions in high spatial dimensions, a so-called…
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…
The proposed system of integer functions is logically fully independent from the traditional mathematical analysis of the real functions, but there is a well-defined mutual correspondence between the two disciplines. The system of integer…
This paper describes the procedure to estimate the parameters in mean reversion processes with functional tendency defined by a periodic continuous deterministic function, expressed as a series of truncated Fourier. Two phases of estimation…
In this paper we propose an approximation method for high-dimensional $1$-periodic functions based on the multivariate ANOVA decomposition. We provide an analysis on the classical ANOVA decomposition on the torus and prove some important…