Related papers: Fast convolution with free-space Green's functions
Disk self-gravity could play an important role in the dynamic evolution of interaction between disks and embedded protoplanets. We have developed a fast and accurate solver to calculate the disk potential and disk self-gravity forces for…
A fast method for the computation of layer potentials that arise in acoustic scattering is introduced. The principal idea is to split the singular kernel into a smooth and a local part. The potential due to the smooth part is computed…
Integral transforms are invaluable mathematical tools to map functions into spaces where they are easier to characterize. We introduce the hyperdimensional transform as a new kind of integral transform. It converts square-integrable…
We present a fast algorithm for evaluating the (non-smooth) solution of the free-space two-dimensional (2D) scalar wave equation with many point sources, each with a high-frequency band-limited time signature. Such an algorithm is key to an…
This paper presents a full-spectrum Green function methodology (which is valid, in particular, at and around Wood-anomaly frequencies) for evaluation of scattering by periodic arrays of cylinders of arbitrary cross section-with application…
We introduce two efficient algorithms for computing the partial Fourier transforms in one and two dimensions. Our study is motivated by the wave extrapolation procedure in reflection seismology. In both algorithms, the main idea is to…
The graph Laplacian is a standard tool in data science, machine learning, and image processing. The corresponding matrix inherits the complex structure of the underlying network and is in certain applications densely populated. This makes…
We demonstrate an efficient nonequilibrium Green's function transport calculation procedure based on the real-space finite-difference method. The direct inversion of matrices for obtaining the self-energy terms of electrodes is…
The works presented in this habilitation concern the algorithmics of polynomials. This is a central topic in computer algebra, with numerous applications both within and outside the field - cryptography, error-correcting codes, etc. For…
A new method for calculation of band structure has been proposed based on the Green's function theory and local sampling. Potential energy in the Hamiltonian of Schrodinger's equation is approximated with a series of sampled Dirac delta…
In this paper, new representations of the Green's function for an acoustic d-dimensional half-space problem with impedance boundary conditions are presented. The main features of the new representation are: a) in addition to additive terms…
We present the 2-point function from Fast and Accurate Spherical Bessel Transformation (2-FAST) algorithm for a fast and accurate computation of integrals involving one or two spherical Bessel functions. These types of integrals occur when…
We study the capability of the Fast Fourier Transform (FFT) to accelerate exact and approximate matrix multiplication without using Strassen-like divide-and-conquer. We present a simple exact algorithm running in $O(n^{2.89})$ time, which…
Fast multidimensional convolution can be performed naively in quadratic time and can often be performed more efficiently via the Fourier transform; however, when the dimensionality is large, these algorithms become more challenging. A…
The graph fractional Fourier transform (GFRFT) for unitary graph Fourier transform (GFT) matrices can be interpreted through the scalar function $e^{j\alpha\theta}$ on the unit circle. Under the principal branch, its Fourier-series…
We propose a matrix-free finite element (FE) homogenization scheme that is considerably more efficient than generic FE implementations. The efficiency of our scheme follows from a preconditioned well-scaled reformulation allowing for the…
The Fourier transforms of polyhedral cones can be used, via Brion's theorem, to compute various geometric quantities of polytopes, such as volumes, moments, and lattice-point counts. We present a novel method of computing these conic…
The rapid and accurate evaluation of convolutions with singular kernels plays crucial roles in a wide range of scientific and engineering applications. Building on the recently introduced Truncated Fourier Filtering method for smooth…
In this paper, we summarize the technique of using Green functions to solve electrostatic problems. We start by deriving the electric potential in terms of a Green function and a charge distribution. We then provide a variety of example…
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place convolutions, the memory requirements are identical with the…