相关论文: Computing the logarithmic capacity of compact sets…

We study numerical conformal mapping of multiply connected planar domains with boundaries consisting of unions of finitely many circular arcs, so called polycircular domains. We compute the conformal capacities of condensers defined by…

We introduce efficient numerical methods for generic HJM equations of interest rate theory by means of high-order weak approximation schemes. These schemes allow for QMC implementations due to the relatively low dimensional integration…

In this paper we generalize a methodology [T. E. Ouldridge, A. A. Louis, and J. P. K. Doye, J. Phys.: Condens. Matter {\bf 22}, 104102 (2010)] for dealing with the inference of bulk properties from small simulations of self-assembling…

Computational power can be measured by assigning an algebraic structure to a computational device. Here, we convert a small patch of Conway's Game of Life into a transformation semigroup. The conversion captures not only time evolution but…

We present a novel approach for accelerating convolutions during inference for CPU-based architectures. The most common method of computation involves packing the image into the columns of a matrix (im2col) and performing general matrix…

Linear programming (LP) is an extremely useful tool and has been successfully applied to solve various problems in a wide range of areas, including operations research, engineering, economics, or even more abstract mathematical areas such…

Aggregations of flexible loads can provide several power system services through demand response programs, for example load shifting and curtailment. The capabilities of demand response should therefore be represented in system operators'…

Using the specific model of a system of like charged ions confined between two planar like charged surfaces, we compare the predictions for the energy and density profile of four simulation methods available to treat the long range Coulomb…

A boundary integral equation method is presented for fast computation of the analytic capacities of compact sets in the complex plane. The method is based on using the Kerzman--Stein integral equation to compute the Szeg\"o kernel and then…

Linear programming (LP) is an extremely useful tool which has been successfully applied to solve various problems in a wide range of areas, including operations research, engineering, economics, or even more abstract mathematical areas such…

We describe a practical procedure to calculate the Coulomb matrix elements of 2D spatially separated and confined charge carriers, which are needed for detailed theoretical descriptions of important condensed matter finite systems. We…

A computer simulation has to be fast to be helpful, if it is employed to study the behavior of a multicomponent dynamic system. This paper discusses modeling concepts and algorithmic techniques useful for creating such fast simulations.…

Latent class model (LCM), which is a finite mixture of different categorical distributions, is one of the most widely used models in statistics and machine learning fields. Because of its non-continuous nature and the flexibility in shape,…

We present a dual representation of the partition function of the charged scalar field in which the complex action problem at non-zero chemical potential is absent. In this dual representation Monte Carlo simulations are possible and we…

We describe CPMC-Lab, a Matlab program for the constrained-path and phaseless auxiliary-field Monte Carlo methods. These methods have allowed applications ranging from the study of strongly correlated models, such as the Hubbard model, to…

We propose a stochastic conditional gradient method (CGM) for minimizing convex finite-sum objectives formed as a sum of smooth and non-smooth terms. Existing CGM variants for this template either suffer from slow convergence rates, or…

As nowadays Machine Learning (ML) techniques are generating huge data collections, the problem of how to efficiently engineer their storage and operations is becoming of paramount importance. In this article we propose a new lossless…

Interior point methods (IPMs) are a common approach for solving linear programs (LPs) with strong theoretical guarantees and solid empirical performance. The time complexity of these methods is dominated by the cost of solving a linear…

We propose a new multi-scale molecular dynamics simulation method which can achieve high accuracy and high sampling efficiency simultaneously without aforehand knowledge of the coarse grained (CG) potential and test it for a biomolecular…

Many forms of programmable matter have been proposed for various tasks. We use an abstract model of self-organizing particle systems for programmable matter which could be used for a variety of applications, including smart paint and…