Related papers: A Fast Summation Method for Oscillatory Lattice Su…
We consider wave propagation problems over 2-dimensional domains with piecewise-linear boundaries, possibly including scatterers. We assume that the wave speed is constant, and that the initial conditions and forcing terms are radially…
This paper presents a numerical compression strategy for the boundary integral equation of acoustic scattering in two dimensions. These equations have oscillatory kernels that we represent in a basis of wave atoms, and compress by…
Clustering is a fundamental primitive in unsupervised learning which gives rise to a rich class of computationally-challenging inference tasks. In this work, we focus on the canonical task of clustering d-dimensional Gaussian mixtures with…
We obtain asymptotic formulae with optimal error terms for the number of lattice points under and near a dilation of the standard parabola, the former improving upon an old result of Popov. These results can be regarded as achieving the…
The Conjugate Gradient method (CGM) is known to be the fastest generic iterative method for solving linear systems with symmetric sign definite matrices. In this paper, we modify this method so that it could find fundamental solitary waves…
We present a spectrally accurate method for the rapid evaluation of free-space Stokes potentials, i.e. sums involving a large number of free space Green's functions. We consider sums involving stokeslets, stresslets and rotlets that appear…
We present in this paper first-order alternating linearization algorithms based on an alternating direction augmented Lagrangian approach for minimizing the sum of two convex functions. Our basic methods require at most $O(1/\epsilon)$…
The left-right operator splitting method is studied for the efficient calculation of acoustic fields scattered by arbitrary rough surfaces. Here the governing boundary integral is written as a sum of left- and right-going components, and…
We present a general approach to rounding semidefinite programming relaxations obtained by the Sum-of-Squares method (Lasserre hierarchy). Our approach is based on using the connection between these relaxations and the Sum-of-Squares proof…
In this short note, we present an easy to implement and fast algorithm for the computation of the steady solitary gravity wave solution of the free surface Euler equations in irrotational motion. First, the problem is reformulated in a…
We give a precise estimate for the number of lattice points in certain bounded subsets of $\mathbb{R}^{n}$ that involve `hyperbolic spikes' and occur naturally in multiplicative Diophantine approximation. We use Wilkie's o-minimal structure…
Continuum and lattice methods are used to investigate systematic issues in the sum rule determination of $V_{us}$ using inclusive hadronic $\tau$ decay data. Results for $V_{us}$ employing assumptions for $D>4$ OPE contributions used in…
Combining sum factorization, weighted quadrature, and row-based assembly enables efficient higher-order computations for tensor product splines. We aim to transfer these concepts to immersed boundary methods, which perform simulations on a…
In this paper, motivated by diffraction of traveling light waves, a simple mathematical model is proposed, both for the multivariate super-resolution problem and the problem of blind-source separation of real-valued exponential sums. This…
In this work, the lattice Boltzmann method (LBM) is assessed as a time-domain numerical approach for electromagnetic wave scattering. Owing to its explicit formulation and suitability for parallel computation on structured grids, LBM…
Lagarias and Odlyzko (J.~ACM~1985) proposed a polynomial time algorithm for solving ``\emph{almost all}'' instances of the Subset Sum problem with $n$ integers of size $\Omega(\Gamma_{\text{LO}})$, where $\log_2(\Gamma_{\text{LO}}) > n^2…
An efficient hybrid numerical method for multiple scattering calculations is proposed. We use the well established doubling--adding method to find the reflection function of the lowermost homogeneous slab comprising the atmosphere of our…
We introduce and study a novel tensor approach for fast and accurate assembled summation of a large number of lattice-allocated potentials represented on 3D $N\times N \times N$ grid with the computational requirements only \emph{weakly…
The main topics of this paper is to shown a Fast Mie Algorithm FMA as the best way to use the Mie scattering theory for cross section calculation. This fast algorithm used recursion for summing a long timed sum of cylindrical functions.
We extend the classical Euler-Maclaurin expansion to sums over multidimensional lattices that involve functions with algebraic singularities. This offers a tool for the precise quantification of the effect of microscopic discreteness on…