Related papers: Efficient method for localized functions using dom…
This article presents a new high-order accurate algorithm for finding a particular solution to a linear, constant-coefficient partial differential equation (PDE) by means of a convolution of the volumetric source function with the Green's…
We introduce a method based on semidefinite programming that produces rigorous two-sided bounds on ground state energy densities and correlation functions of translation-invariant classical spin models on infinite lattices. In this method,…
With tens of petaflops supercomputers already in operation and exaflops machines expected to appear within the next 10 years, efficient parallel computational methods are required to take advantage of such extreme-scale machines. In this…
We describe a spectral method for the numerical solution of the Vlasov-Poisson system where the velocity space is decomposed by means of an Hermite basis, and the configuration space is discretized via a Fourier decomposition. The novelty…
Meshing of geometric domains having curved boundaries by affine simplices produces a polytopial approximation of those domains. The resulting error in the representation of the domain limits the accuracy of finite element methods based on…
This paper presents a novel boundary-optimized fast Fourier extension algorithm for efficient approximation of non-periodic functions. The proposed methodology constructs periodic extensions through strategic utilization of boundary…
When using Laguerre and Hermite spectral methods to numerically solve PDEs in unbounded domains, the number of collocation points assigned inside the region of interest is often insufficient, particularly when the region is expanded or…
In this paper we approximate high-dimensional functions $f\colon\mathbb T^d\to\mathbb C$ by sparse trigonometric polynomials based on function evaluations. Recently it was shown that a dimension-incremental sparse Fourier transform (SFT)…
State-of-the-art methods for Convolutional Sparse Coding usually employ Fourier-domain solvers in order to speed up the convolution operators. However, this approach is not without shortcomings. For example, Fourier-domain representations…
A collection of algorithms is described for numerically computing with smooth functions defined on the unit sphere. Functions are approximated to essentially machine precision by using a structure-preserving iterative variant of Gaussian…
It is a challenge to manage infinite- or high-dimensional data in situations where storage, transmission, or computation resources are constrained. In the simplest scenario when the data consists of a noisy infinite-dimensional signal, we…
We pose and solve the analogue of Slepian's time-frequency concentration problem in the two-dimensional plane, for applications in the natural sciences. We determine an orthogonal family of strictly bandlimited functions that are optimally…
In many practical applications, spatial data are often collected at areal levels (i.e., block data) and the inferences and predictions about the variable at points or blocks different from those at which it has been observed typically…
In this paper, we present a numerical algorithm for the accurate and efficient computation of the convolution of the frequency domain layered media Green's function with a given density function. Instead of compressing the convolution…
Many interesting and fundamentally practical optimization problems, ranging from optics, to signal processing, to radar and acoustics, involve constraints on the Fourier transform of a function. It is well-known that the {\em fast Fourier…
Understanding extreme non-locality in many-body quantum systems can help resolve questions in thermostatistics and laser physics. The existence of symmetry selection rules for Hamiltonians with non-decaying terms on infinite-size lattices…
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…
The fractional Schr\"{o}dinger equation (FSE) on the real line arises in a broad range of physical settings and their numerical simulation is challenging due to the nonlocal nature and the power law decay of the solution at infinity. In…
We present numerical methods based on the fast Fourier transform (FFT) to solve convolution integral equations on a semi-infinite interval (Wiener-Hopf equation) or on a finite interval (Fredholm equation). We extend and improve a FFT-based…
In this paper, we propose a fast and accurate numerical method based on Fourier transform to solve Kolmogorov forward equations of symmetric scalar L\'evy processes. The method is based on the accurate numerical formulas for Fourier…