Related papers: A Fast Summation Method for Oscillatory Lattice Su…
An accurate and fast method is presented for scattering of electromagnetic waves from an array of time-modulated graphene ribbons. We derive a time-domain integral equation for induced surface currents under subwavelength approximation.…
We study the conditions under which one is able to efficiently apply variance-reduction and acceleration schemes on finite sum optimization problems. First, we show that, perhaps surprisingly, the finite sum structure by itself, is not…
Let $k$ and $n$ be positive integers. Define $R(n,k)$ to be the minimum positive value of $$ | e_i \sqrt{s_1} + e_2 \sqrt{s_2} + ... + e_k \sqrt{s_k} -t | $$ where $ s_1, s_2, ..., s_k$ are positive integers no larger than $n$, $t$ is an…
Laguerre's rootfinding algorithm is highly recommended although most of its properties are known only by empirical evidence. In view of this, we prove the first sufficient convergence criterion. It is applicable to simple roots of…
In this paper, we present the Stroboscopic Averaging Method (SAM), recently introduced in [7,8,10,12], which aims at numerically solving highly-oscillatory differential equations. More specifically, we first apply SAM to the Schr\"odinger…
Wigner limits are given formally as the difference between a lattice sum, associated to a positive definite quadratic form, and a corresponding multiple integral. To define these limits, which arose in work of Wigner on the energy of static…
Consider the design based situation where an $r$-regular set is sampled on a random lattice. A fast algorithm for estimating the integrated mean curvature based on this observation is to use a weighted sum of $2\times \dotsm \times 2$…
In this paper, we use a straightforward numerical method to solve scattering models in one-dimensional lattices based on a tight-binding band structure. We do this by using the wave packet approach to scattering, which presents a more…
The Euclidean algorithm is the oldest algorithms known to mankind. Given two integral numbers $a_1$ and $a_2$, it computes the greatest common divisor (gcd) of $a_1$ and $a_2$ in a very elegant way. From a lattice perspective, it computes a…
We consider global efficiency of algorithms for minimizing a sum of a convex function and a composition of a Lipschitz convex function with a smooth map. The basic algorithm we rely on is the prox-linear method, which in each iteration…
In this paper we introduce a method for solving linear and nonlinear scattering problems for wave equations using a new hybrid approach. This new approach consists of a reformulation of the governing equations into a form that can be solved…
We present a general class of unbiased improved estimators for physical observables in lattice gauge theory computations which significantly reduces statistical errors at modest computational cost. The error reduction techniques, referred…
Topographs, introduced by Conway in 1997, are infinite trivalent planar trees used to visualize the values of binary quadratic forms. In this work, we study series whose terms are indexed by the vertices of a topograph and show that they…
The Fast Multipole Method (FMM) provides a highly efficient computational tool for solving constant coefficient partial differential equations (e.g. the Poisson equation) on infinite domains. The solution to such an equation is given as the…
A combination of continuum and lattice methods is used to investigate systematic issues in the finite-energy-sum-rule determination of $V_{us}$ based on flavor-breaking combinations of hadronic $\tau$ decay data. Results for $V_{us}$…
A numerical method for solving the equations modeling acoustic scattering is presented. The method is capable of handling several dozen scatterers, each of which is several wave-lengths long, on a personal work station. Even for geometries…
We describe a novel optimization method for finite sums (such as empirical risk minimization problems) building on the recently introduced SAGA method. Our method achieves an accelerated convergence rate on strongly convex smooth problems.…
Smoothing is essential to many oceanographic, meteorological and hydrological applications. The interval smoothing problem updates all desired states within a time interval using all available observations. The fixed-lag smoothing problem…
Counting integer solutions of linear constraints has found interesting applications in various fields. It is equivalent to the problem of counting lattice points inside a polytope. However, state-of-the-art algorithms for this problem…
We show that the possibility to address and image single sites of an optical lattice, now an experimental reality, allows to measure the frequency-resolved local particle and hole spectra of a wide variety of one- and two-dimensional…