Related papers: A Fast Summation Method for Oscillatory Lattice Su…
Electromagnetic scattering on a sphere is one of the most fundamental problems, which has a closed form analytical solution in the form of Mie series. Being initially formulated for a plane incident wave, the formalism can be extended to…
The optimization version of the cavity method for single instances, called Max-Sum, has been applied in the past to the Minimum Steiner Tree Problem on Graphs and variants. Max-Sum has been shown experimentally to give asymptotically…
We present a high-order accurate boundary-based solver for three-dimensional (3D) frequency-domain scattering from a doubly-periodic grating of smooth axisymmetric sound-hard or transmission obstacles. We build the one-obstacle solution…
In this work, we show the first worst-case to average-case reduction for the classical $k$-SUM problem. A $k$-SUM instance is a collection of $m$ integers, and the goal of the $k$-SUM problem is to find a subset of $k$ elements that sums to…
We consider the problem of finding lower bounds on the number of unlabeled $n$-element lattices in some lattice family. We show that if the family is closed under vertical sum, exponential lower bounds can be obtained from vertical sums of…
The current paper investigates the bounded distance decoding (BDD) problem for ensembles of lattices whose generator matrices have sub-Gaussian entries. We first prove that, for these ensembles the BDD problem is NP-hard in the worst case.…
Given n positive integers, the Modular Subset Sum problem asks if a subset adds up to a given target t modulo a given integer m. This is a natural generalization of the Subset Sum problem (where m=+\infty) with ties to additive…
We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address…
Perturbative calculations in field theory at finite temperature involve sums over the Matsubara frequencies. Besides the usual difficulties that appear in perturbative computations, these sums give rise to some new obstacles that are…
We present a fast direct solver for boundary integral equations on complex surfaces in three dimensions using an extension of the recently introduced recursive strong skeletonization scheme. For problems that are not highly oscillatory, our…
We compute the Gross-Llewellyn Smith sum rule, i.e. the lowest odd moment of the parity-violating structure function, $F_3$, of the nucleon from a lattice QCD calculation of the Compton amplitude. Our calculations are performed on $48^3…
In this paper we present a convergence analysis for the Nystrom method proposed in [Jour. Comput. Phys. 169 pp. 2921-2934, 2001] for the solution of the combined boundary integral equation formulations of sound-soft acoustic scattering…
We introduce a method for proving Sum-of-Squares (SoS)/ Lasserre hierarchy lower bounds when the initial problem formulation exhibits a high degree of symmetry. Our main technical theorem allows us to reduce the study of the positive…
This proposal relates to the design, analysis and application of a novel numerical scheme for the solution of axisymmetric scattering problems. To this end, a procedure is introduced to iteratively evaluate the solution of the…
A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…
We apply boundary integral equations for the first time to the two-dimensional scattering of time-harmonic waves from a smooth obstacle embedded in a continuously-graded unbounded medium. In the case we solve the square of the wavenumber…
Translation from the Latin original, "Inventio summae cuiusque seriei ex dato termino generali" (1735). E47 in the Enestrom index. In this paper Euler derives the Euler-Maclaurin summation formula, by expressing y(x-1) with the Taylor…
We propose a special computational device which uses light rays for solving the subset-sum problem. The device has a graph-like representation and the light is traversing it by following the routes given by the connections between nodes.…
Leonhard Euler likely developed his summation formula in 1732, and soon used it to estimate the sum of the reciprocal squares to 14 digits --- a value mathematicians had been competing to determine since Leibniz's astonishing discovery that…
We present a novel method for computing slow manifolds and their fast fibre bundles in geometric singular perturbation problems. This coordinate-independent method is inspired by the parametrisation method introduced by Cabr\'e, Fontich and…