Related papers: Fourier transform of composed functions
Sufficient conditions are given for a function $F(p)$ to be the Laplace transform of a function $f(t)$ or a distribution $f$. No assumption on $f$ is given a priori. It is not even assumed that $f=0$ for $t<0$.
Using the Fourier transform, we obtain upper bounds for sums of eigenvalues of the free plate.
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.…
The explicit analytical expression of the Nonlinear Fourier Transform (NFT) of a finite set of data is provided. Then a simple recursion relation for the NFT is constructed as a function of the spectral parameter. These tools provide a…
Transition from Fourier series to Fourier integrals is considered and error introduced by ordinary substitution of integration for summing is estimated. Ambiguity caused by transition from discrete function to continuous one is examined and…
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 study some of the interactions between the Fourier Transform and the Riemann zeta function (and Dirichlet-Dedekind-Hecke-Tate L-functions)
In this note, a general formula is proved. It expresses the integral on the line of the product of a function $f$ and a periodic function $g$ in terms of the Fourier transform of $f$ and the Fourier coefficients of $g$. This allows the…
Consider the Fourier transform on the group $GL(2,R)$ of real $2\times 2$-matrices. We show that Fourier-images of polynomial differential operators on $GL(2,R)$ are differential-difference operators with coefficients meromorphic in…
Let $x\geq 1$ be a large integer, and let $a_0<a_1<\cdots<a_{k-1}$ be a small fixed integer $k$-tuple, and let $\mu(n)\in\{-1,0,1\}$ be the periodic Mobius function. This note shows that discrete Fourier transform analysis produces a simple…
For the Fourier transform $\mathcal{F}\mu$ of a general (non-trivial) self-similar measure $\mu$ on the real line $\mathbb{R}$, we prove a large deviation estimate \[ \lim_{c\to +0} \varlimsup_{t\to \infty}\frac{1}{t}\log…
The discrete Fourier transform of the greatest common divisor is a multiplicative function, if taken with respect to the same order of the primitive root of unity, which is a well known fact. As such, the transform can be expressed in the…
We present an efficient and very flexible numerical fast Fourier-Laplace transform, that extends the logarithmic Fourier transform (LFT) introduced by Haines and Jones [Geophys. J. Int. 92(1):171 (1988)] for functions varying over many…
Derived from the results in [Giang et al.: \emph{Convolutions for the Fourier transforms with geometric variables and applications}, Math. Nachr. 283(12) (2010), 1758--1770], in this paper, we devoted to studying the boundedness properties…
We study the family of Fourier-Laplace transforms $$ F_{\alpha,\beta}(z)= \operatorname*{F.p.} \int_{0}^{\infty} t^{\beta}\exp(\mathrm{i} t^{\alpha}-\mathrm{i} z t)\:\mathrm{d} t, \quad \operatorname*{Im} z<0, $$ for $\alpha>1$ and…
We show an exact (i.e. no smooth error terms) Fourier inversion type formula for differential operators over Riemannian manifolds. This provides a coordinate free approach for the theory of pseudo-differential operators.
We develop a method for calculating Riemann sums using Fourier analysis.
In recent years there has been a growing interest in the fractional Fourier transform driven by its large number of applications. The literature in this field follows two main routes. On the one hand, the areas where the ordinary Fourier…
It is well-known that the functions $f \in L^1(\mathbb{R}^d)$ whose translates along a lattice $\Lambda$ form a tiling, can be completely characterized in terms of the zero set of their Fourier transform. We construct an example of a…
In order to compute the Fourier transform of a function $f$ on the real line numerically, one samples $f$ on a grid and then takes the discrete Fourier transform. We derive exact error estimates for this procedure in terms of the decay and…