Related papers: Parallelized Stochastic Cutoff Method for Long-Ran…
We generalize the multilevel Monte Carlo (MLMC) method of Giles to the simulation of systems of particles that interact via a mean field. When the number of particles is large, these systems are described by a McKean-Vlasov process - a…
We are interested in parallelizing the Least Angle Regression (LARS) algorithm for fitting linear regression models to high-dimensional data. We consider two parallel and communication avoiding versions of the basic LARS algorithm. The two…
When solving stochastic partial differential equations (SPDEs) driven by additive spatial white noise, the efficient sampling of white noise realizations can be challenging. Here, we present a new sampling technique that can be used to…
We propose an information-theoretic approach to analyze the long-time behavior of numerical splitting schemes for stochastic dynamics, focusing primarily on Parallel Kinetic Monte Carlo (KMC) algorithms.Established methods for numerical…
We describe a parallel algorithm for solving the time-independent 3d Schrodinger equation using the finite difference time domain (FDTD) method. We introduce an optimized parallelization scheme that reduces communication overhead between…
Time-parallel methods can reduce the wall clock time required for the accurate numerical solution of differential equations by parallelizing across the time-dimension. In this paper, we present and test the convergence behavior of a…
The paper proposes an approach for the efficient model order reduction of dynamic contact problems in linear elasticity. Instead of the augmented Lagrangian method that is widely used for mechanical contact problems, we prefer here the…
The Direct Simulation Monte Carlo (DSMC) method is widely employed for simulating rarefied nonequilibrium gas flows. With advances in aerospace engineering and micro/nano-scale technologies, gas flows exhibit the coexistence of rarefied and…
Due to manufacturing defects or wear and tear, industrial components may have uncertainties. In order to evaluate the performance of machined components, it is crucial to quantify the uncertainty of the scattering surface. This brings up an…
We propose a parallel version of the cross interpolation algorithm and apply it to calculate high-dimensional integrals motivated by Ising model in quantum physics. In contrast to mainstream approaches, such as Monte Carlo and quasi Monte…
In this paper we consider sequential joint state and static parameter estimation given discrete time observations associated to a partially observed stochastic partial differential equation (SPDE). It is assumed that one can only estimate…
Monte Carlo (MC) methods for numerical integration seem to be embarassingly parallel on first sight. When adaptive schemes are applied in order to enhance convergence however, the seemingly most natural way of replicating the whole job on…
We have developed an efficient Monte Carlo algorithm, which accelerates slow Monte Carlo dynamics in quasi-one-dimensional Ising spin systems. The loop algorithm of the quantum Monte Carlo method is applied to the classical spin models with…
In many hierarchical inverse problems, not only do we want to estimate high- or infinite-dimensional model parameters in the parameter-to-observable maps, but we also have to estimate hyperparameters that represent critical assumptions in…
We present the speedup from a novel parallel implementation of the multicanonical method on the example of a lattice gas in two and three dimensions. In this approach, all cores perform independent equilibrium runs with identical weights,…
In image processing, solving inverse problems is the task of finding plausible reconstructions of an image that was corrupted by some (usually known) degradation operator. Commonly, this process is done using a generative image model that…
In this paper we propose a parallel coordinate descent algorithm for solving smooth convex optimization problems with separable constraints that may arise e.g. in distributed model predictive control (MPC) for linear network systems. Our…
We develop coarse-graining schemes for stochastic many-particle microscopic models with competing short- and long-range interactions on a d-dimensional lattice. We focus on the coarse-graining of equilibrium Gibbs states and using cluster…
We propose new sequential sorting operations by adapting techniques and methods used for designing parallel sorting algorithms. Although the norm is to parallelize a sequential algorithm to improve performance, we adapt a contrarian…
Markov Chain Monte Carlo methods are algorithms used to sample probability distributions, commonly used to sample the Boltzmann distribution of physical/chemical models (e.g., protein folding, Ising model, etc.). This allows us to study…