Related papers: Fast convolution with free-space Green's functions
Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. In this paper, we pay special attention to the description of complex-data FFT. We analyze two common descriptions of…
In this article, we develop a new method to approximate numerically the fractional Laplacian of functions defined on $\mathbb R$, as well as some more general singular integrals. After mapping $\mathbb R$ into a finite interval, we…
Exploratory variational pseudopotential density functional calculations are performed for the electronic properties of many-electron systems in the 3D cartesian coordinate grid (CCG). The atom-centered localized gaussian basis set,…
In the nonequilibrium Green's function approach, the approximation of the correlation self-energy at the second-Born level is of particular interest, since it allows for a maximal speed-up in computational scaling when used together with…
In the paper it is shown that there exist infinite classes of fast DFT algorithms having multiplicative complexity lower than O(NlogN), i.e. smaller than their arithmetical complexity. The derivation starts with nesting of Discrete Fourier…
We developed fast direct solver for 3D Helmholtz and Maxwell equations in layered medium. The algorithm is based on the ideas of cyclic reduction for separable matrices. For the grids with major uniform part (within the survey domain in the…
Radiative corrections to an atom are calculated near a half-space that has arbitrarily-shaped small depositions upon its surface. The method is based on calculation of the classical Green's function of the macroscopic Maxwell equations near…
This paper presents a novel {\em Interpolated Factored Green Function} method (IFGF) for the accelerated evaluation of the integral operators in scattering theory and other areas. Like existing acceleration methods in these fields, the IFGF…
We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time--space complexity is roughly quadratic in the logarithm of the…
A stochastic method is described for estimating Green's functions (GF's), appropriate to linear advection-diffusion-reaction transport problems, evolving in arbitrary geometries. By allowing straightforward construction of approximate,…
The non-equilibrium Green's function (NEGF) approach offers a practical framework for simulating various phenomena in mesoscopic systems. As the dimension of electronic devices shrinks to just a few nanometers, the need for new…
In this paper we consider the problem of approximating function evaluations $f(\boldsymbol x_j)$ at given nonequispaced points $\boldsymbol x_j$, $j=1,\dots N$, of a bandlimited function from given values $\hat{f}(\boldsymbol k)$,…
One of the most efficient ways to produce unconditional simulations is with the kernel convolution using fast Fourier transform (FFT) [1]. However, when data is located on a surface, this approach is not efficient because data needs to be…
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…
Vector spherical harmonics on the unit sphere of $\mathbb{R}^3$ have broad applications in geophysics, quantum mechanics and astrophysics. In the representation of a tangent vector field, one needs to evaluate the expansion and the Fourier…
A variety of problems in acoustic and electromagnetic scattering require the evaluation of impedance or layered media Green's functions. Given a point source located in an unbounded half-space or an infinitely extended layer, Sommerfeld and…
Nonuniform Fourier data are routinely collected in applications such as magnetic resonance imaging, synthetic aperture radar, and synthetic imaging in radio astronomy. To acquire a fast reconstruction that does not require an online inverse…
Bayesian inference, while foundational to probabilistic reasoning, is often hampered by the computational intractability of posterior distributions, particularly through the challenging evidence integral. Conventional approaches like Markov…
The prevalence of convolution in applications within signal processing, deep neural networks, and numerical solvers has motivated the development of numerous fast convolution algorithms. In many of these problems, convolution is performed…
We consider the Green's functions associated to a scalar field propagating on a curved, ultra-static background, in the presence of modified dispersion relations. The usual proper-time deWitt-Schwinger procedure to obtain a series…