Related papers: BFACF-style algorithms for polygons in the body-ce…
We explore a novel simulation route for Plasma Wakefield Acceleration (PWFA) by using the computational method known as the Lattice Boltzmann Method (LBM). LBM is based on a discretization of the continuum kinetic theory while assuring the…
In this paper we define the algebraic entropy test for face-centered quad equations, which are equations defined on vertices of a quadrilateral plus an additional interior vertex. This notion of algebraic entropy is applied to a recently…
We prove upper bounds on the order of convergence of lattice based algorithms for numerical integration in function spaces of dominating mixed smoothness on the unit cube with homogeneous boundary condition. More precisely, we study…
While studying some properties of linear operators in a Euclidean Jordan algebra, Gowda, Sznajder and Tao have introduced generalized lattice operations based on the projection onto the cone of squares. In two recent papers of the authors…
Global radial basis function (RBF) collocation methods with inifinitely smooth basis functions for partial differential equations (PDEs) work in general geometries, and can have exponential convergence properties for smooth solution…
I discuss the recent progress toward computing few-body observables using numerical lattice techniques. The focus is overwhelmingly on the latest results from lattice QCD calculations. I present preliminary results from a lattice…
We propose a new stochastic L-BFGS algorithm and prove a linear convergence rate for strongly convex and smooth functions. Our algorithm draws heavily from a recent stochastic variant of L-BFGS proposed in Byrd et al. (2014) as well as a…
The boundary knot method (BKM) is a recent boundary-type radial basis function (RBF) collocation scheme for general PDEs. Like the method of fundamental solution (MFS), the RBF is employed to approximate the inhomogeneous terms via the dual…
We present algorithms for classifying rational polygons with fixed denominator and number of interior lattice points. Our approach is to first describe maximal polygons and then compute all subpolygons, where we eliminate redundancy by a…
We propose learning deep models that are monotonic with respect to a user-specified set of inputs by alternating layers of linear embeddings, ensembles of lattices, and calibrators (piecewise linear functions), with appropriate constraints…
The development of improved algorithms for QCD on the lattice has enabled us to do calculations at small quark masses and get control over the chiral extrapolation. Also finer lattices have become possible, however, a severe slowing down…
In this paper we consider the problem of constructing numerical algorithms for approximating of convex compact bodies in d-dimensional Euclidean space by polytopes with any given accuracy. It is well known that optimal with respect to the…
The technique that was used to build the EigCG algorithm for sparse symmetric linear systems is extended to the nonsymmetric case using the BiCG algorithm. We show that, similarly to the symmetric case, we can build an algorithm that is…
Lattice rules are among the most prominently studied quasi-Monte Carlo methods to approximate multivariate integrals. A rank-1 lattice rule to approximate an $s$-dimensional integral is fully specified by its generating vector $\mathbf{z}…
A Coulomb lattice-gas model with a host lattice screening mechanism is adapted to describe the ordering phenomena in alkali-metal fullerides of body-centered-cubic structure. It is assumed that the electric charge of an alkali ion residing…
We study the folding of the regular two-dimensional triangular lattice embedded in the regular three-dimensional Face-Centred Cubic lattice, a discrete model for the crumpling of membranes. Possible folds are complete planar folds, folds…
Finite lattice models are a prototype for strongly correlated quantum systems and capture essential properties of condensed matter systems. With the dramatic progress in ultracold atoms in optical lattices, finite fermionic Hubbard systems…
This study presents a generalised least squares based method for fitting polygons and ellipses to data points. The method is based on a trigonometric fitness function that approximates a unit shape accurately, making it applicable to…
In their paper `A new algorithm for recognizing the unknot', in Geometry and Topology', 2 (1998) n. 9, 175-220, the first author and Michael Hirsch presented a then new algorithm for recognizing the unknot. The first part of the algorithm…
Lattice QCD can contribute to the search for new physics in b -> s decays by providing first-principle calculations of B -> K(*) form factors. Preliminary results are presented here which complement sum rule determinations by being done at…