Related papers: A Fast Summation Method for Oscillatory Lattice Su…
We present an application of the standard Langevin dynamics to the problem of weak coupling perturbative expansions for Lattice QCD. This method can be applied to the computation of the most general observables. In this preliminary work we…
In this paper we introduce a new fix point iteration scheme for solving nonlinear electromagnetic scattering problems. The method is based on a spectral formulation of Maxwell's equations called the Bidirectional Pulse Propagation…
To analyze nonlinear dynamic systems, we developed a new technique based on the square matrix method. We propose this technique called the \convergence map" for generating particle stability diagrams similar to the frequency maps widely…
Discrete-velocity approximations represent a popular way for computing the Boltzmann collision operator. The direct numerical evaluation of such methods involve a prohibitive cost, typically $O(N^{2d+1})$ where $d$ is the dimension of the…
Lattice sums of cuboidal lattices, which connect the face-centered with the mean-centered and the body-centered cubic lattices through parameter dependent lattice vectors, are evaluated by decomposing them into two separate lattice sums…
In this paper, we consider lasso problems with zero-sum constraint, commonly required for the analysis of compositional data in high-dimensional spaces. A novel algorithm is proposed to solve these problems, combining a tailored active-set…
We prove an Euler-Maclaurin formula for double polygonal sums and, as a corollary, we obtain approximate quadrature formulas for integrals of smooth functions over polygons with integer vertices. Our Euler-Maclaurin formula is in the spirit…
The numerical solution of spectral fractional diffusion problems in the form ${\mathcal A}^\alpha u = f$ is studied, where $\mathcal A$ is a selfadjoint elliptic operator in a bounded domain $\Omega\subset {\mathbb R}^d$, and $\alpha \in…
An accurate and efficient numerical simulation approach to electromagnetic wave scattering from two-dimensional, randomly rough, penetrable surfaces is presented. The use of the M\"uller equations and an impedance boundary condition for a…
We improve the error terms of some estimates related to counting lattices from recent work of L. Fukshansky, P. Guerzhoy and F. Luca (2017). This improvement is based on some analytic techniques, in particular on bounds of exponential sums…
A fast and spectrally accurate Ewald summation method for the evaluation of stokeslet, stresslet and rotlet potentials of three-dimensional Stokes flow is presented. This work extends the previously developed Spectral Ewald method for…
We develop efficient algorithms for estimating low-degree moments of unknown distributions in the presence of adversarial outliers. The guarantees of our algorithms improve in many cases significantly over the best previous ones, obtained…
This paper investigates the behavior of the Min-Sum message passing scheme to solve systems of linear equations in the Laplacian matrices of graphs and to compute electric flows. Voltage and flow problems involve the minimization of…
Counting integer points in large convex bodies with smooth boundaries containing isolated flat points is oftentimes an intermediate case between balls (or convex bodies with smooth boundaries having everywhere positive curvature) and cubes…
In the present paper we describe a simple black box algorithm for efficiently and accurately solving scattering problems related to the scattering of time-harmonic waves from radially-symmetric potentials in two dimensions. The method uses…
In recent years twisted bi-layers of 2D materials became very popular in the field due to the possibility to totally change their electronic properties by simple rotation. At the same time, in the wide field of photonic crystals, this idea…
The merging of succinct data structures is a well established technique for the space efficient construction of large succinct indexes. In the first part of the paper we propose a new algorithm for merging succinct representations of de…
We develop fast approximation algorithms for the minimum-cost version of the Bounded-Degree MST problem (BD-MST) and its generalization the Crossing Spanning Tree problem (Crossing-ST). We solve the underlying LP to within a $(1+\epsilon)$…
This paper introduces an efficient algorithm for computing the general oscillatory matrix functions. These computations are crucial for solving second-order semi-linear initial value problems. The method is exploited using the scaling and…
We present the first explicit connection between quantum computation and lattice problems. Namely, we show a solution to the Unique Shortest Vector Problem (SVP) under the assumption that there exists an algorithm that solves the hidden…