Related papers: Fast convolution with free-space Green's functions
We develop new approximation algorithms and data structures for representing and computing with multivariate functions using the functional tensor-train (FT), a continuous extension of the tensor-train (TT) decomposition. The FT represents…
The linear Boltzmann equation with constant coefficients in the three-dimensional infinite space is revisited. It is known that the Green's function can be calculated via the Fourier transform in the case of isotropic scattering. In this…
An efficient implementation of the nonequilibrium Green function (NEGF) method combined with the density functional theory (DFT) using localized pseudo-atomic orbitals (PAOs) is presented for electronic transport calculations of a system…
Fast, high-order accurate algorithms for electromagnetic scattering from axisymmetric objects are of great importance when modeling physical phenomena in optics, materials science (e.g. meta-materials), and many other fields of applied…
This study presents the first experimental validation of a Hessian-free ray-Born inversion technique for quantitative reconstruction of sound speed from transmission ultrasound data. The method combines single-scattering theory with…
We consider the free space Helmholtz Green's function and split it into the sum of oscillatory and non-oscillatory (singular) components. The goal is to separate the impact of the singularity of the real part at the origin from the…
Diffuse scattering is a rich source of information about disorder in crystalline materials, which can be modelled using atomistic techniques such as Monte Carlo and molecular dynamics simulations. Modern X-ray and neutron scattering…
Efficient computation of lattice defect geometries such as point defects, dislocations, disconnections, grain boundaries, interfaces and free surfaces requires accurate coupling of displacements near the defect to the long-range elastic…
We present a quasi-linearly scaling, first order polynomial finite element method for the solution of the magnetostatic open boundary problem by splitting the magnetic scalar potential. The potential is determined by solving a Dirichlet…
Dynamical potentials appear in many advanced electronic-structure methods, including self-energies from many-body perturbation theory, dynamical mean-field theory, electronic-transport formulations, and many embedding approaches. Here, we…
We present a fast and accurate algorithm for the evaluation of nonlocal (long-range) Coulomb and dipole-dipole interactions in free space. The governing potential is simply the convolution of an interaction kernel $U(\bx)$ and a density…
In micromagnetic simulations, the demagnetization field is by far the computationally most expensive field component and often a limiting factor in large multilayer systems. We present an exact method to calculate the demagnetization field…
Recently, a new polynomial basis over binary extension fields was proposed such that the fast Fourier transform (FFT) over such fields can be computed in the complexity of order $\mathcal{O}(n\lg(n))$, where $n$ is the number of points…
The accurate and efficient evaluation of Newtonian potentials over general 2-D domains is important for the numerical solution of Poisson's equation and volume integral equations. In this paper, we present a simple and efficient high-order…
We propose an efficient algorithm for the approximation of fractional integrals by using Runge--Kutta based convolution quadrature. The algorithm is based on a novel integral representation of the convolution weights and a special…
We introduce a finite version of free probability and show the link between recent results using polynomial convolutions and the traditional theory of free probability. One tool for accomplishing this is a seemingly new transformation that…
The Fast Multipole Method (FMM) is an efficient numerical algorithm for computation of long-ranged forces in $N$-body problems within gravitational and electrostatic fields. This method utilizes multipole expansions of the Green's function…
Discrete Fourier transforms~(DFTs) over finite fields have widespread applications in digital communication and storage systems. Hence, reducing the computational complexities of DFTs is of great significance. Recently proposed cyclotomic…
The computational efficiency of many neural operators, widely used for learning solutions of PDEs, relies on the fast Fourier transform (FFT) for performing spectral computations. As the FFT is limited to equispaced (rectangular) grids,…
This paper presents a multilevel tensor compression algorithm called tensor butterfly algorithm for efficiently representing large-scale and high-dimensional oscillatory integral operators, including Green's functions for wave equations and…