Related papers: Approximating the Analytic Fourier Transform with …
In analogy with the Poisson summation formula, we identify when the fractional Fourier transform, applied to a Dirac comb in dimension one, gives a discretely supported measure. We describe the resulting series of complex multiples of delta…
In this work, we propose an algorithm for a filter based on the Fast Fourier Transform (FFT), which, due to its characteristics, allows for an efficient computational implementation, ease of use, and minimizes amplitude variation in the…
It is known that the computation of the Voigt/complex error function is problematic for highly accurate and rapid computation at small imaginary argument $y << 1$, where $y = \operatorname{Im} \left[ z \right]$. In this paper we consider an…
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…
This paper focuses on the equivalent expression of fractional integrals/derivatives with an infinite series. A universal framework for fractional Taylor series is developed by expanding an analytic function at the initial instant or the…
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…
The Fast Reciprocal Square Root Algorithm is a well-established approximation technique consisting of two stages: first, a coarse approximation is obtained by manipulating the bit pattern of the floating point argument using integer…
The fast multipole method (FMM) has had great success in reducing the computational complexity of solving the boundary integral form of the Helmholtz equation. We present a formulation of the Helmholtz FMM that uses Fourier basis functions…
We introduce a numerical method for the approximation of functions which are analytic on compact intervals, except at the endpoints. This method is based on variable transforms using particular parametrized exponential and…
Efficient algorithms for computing linear convolutions based on the fast Fourier transform are developed. A hybrid approach is described that combines the conventional practice of explicit dealiasing (explicitly padding the input data with…
Spread options are a fundamental class of derivative contract written on multiple assets, and are widely used in a range of financial markets. There is a long history of approximation methods for computing such products, but as yet there is…
In this paper, we develop a fast and accurate pseudospectral method to approximate numerically the half Laplacian $(-\Delta)^{1/2}$ of a function on $\mathbb{R}$, which is equivalent to the Hilbert transform of the derivative of the…
We propose a method based on sinc series approximations for computing the Rayleigh-Sommerfeld and Fresnel diffraction integrals of optics. The diffraction integrals are given in terms of a convolution, and our proposed numerical approach is…
Estimation of the Discrete-Time Fourier Transform (DTFT) at points of a finite domain arises in many imaging applications. A new approach to this task, the Golden Angle Linogram Fourier Domain (GALFD), is presented, together with a…
Variational formulations of reconstruction in computed tomography have the notable drawback of requiring repeated evaluations of both the forward Radon transform and either its adjoint or an approximate inverse transform which are…
It is suggest that a new fractal model for the Yang-Fourier transforms of discrete approximation based on local fractional calculus and the Discrete Yang-Fourier transforms are investigated in detail.
The pseudo-polar Fourier transform is a specialized non-equally spaced Fourier transform, which evaluates the Fourier transform on a near-polar grid, known as the pseudo-polar grid. The advantage of the pseudo-polar grid over other…
Fourier series of smooth, non-periodic functions on $[-1,1]$ are known to exhibit the Gibbs phenomenon, and exhibit overall slow convergence. One way of overcoming these problems is by using a Fourier series on a larger domain, say $[-T,T]$…
In this paper, we relate the framework of mod-$\phi$ convergence to the construction of approximation schemes for lattice-distributed random variables. The point of view taken here is that of Fourier analysis in the Wiener algebra, allowing…
We express the Riemann zeta function $\zeta\left(s\right)$ of argument $s=\sigma+i\tau$ with imaginary part $\tau$ in terms of three absolutely convergent series. The resulting simple algorithm allows to compute, to arbitrary precision,…