Related papers: Parallel tempering algorithm for integration over …
The concept of Lefschetz thimble decomposition is one of the most promising possible modifications of Quantum Monte Carlo (QMC) algorithms aimed at alleviating the sign problem which appears in many interesting physical situations, e.g. in…
The theoretical information threshold for the planted clique problem is $2\log_2(N)$, however no polynomial algorithm is known to recover a planted clique of size $O(N^{1/2-\epsilon})$, $\epsilon>0$. In this paper we will apply a standard…
The sign problem of relativistic field theories at finite fermion chemical potential has been approached by deforming the domain of integration into complex field space. We present a method for selecting a deformed manifold of integration…
A common recipe to improve diffusion models at test-time so that samples score highly against a user-specified reward is to introduce the gradient of the reward into the dynamics of the diffusion itself. This procedure is often ill posed,…
The general scheme of two-level parallelization (TLP) for direct simulation Monte Carlo of unsteady gas flows on shared memory multiprocessor computers has been described. The high efficient algorithm of parallel independent runs is used on…
By combining different ideas, a general and efficient protocol to deal with discontinuous phase transitions at low temperatures is proposed. For small $T$'s, it is possible to derive a generic analytic expression for appropriate order…
We review several parallel tempering schemes and examine their main ingredients for accuracy and efficiency. The present study covers two selection methods of temperatures and several choices for the exchange of replicas, including a recent…
We propose a new parallel-in-time algorithm for solving optimal control problems constrained by discretized partial differential equations. Our approach, which is based on a deeper understanding of ParaExp, considers an overlapping…
Particle tracking in large-scale numerical simulations of turbulent flows presents one of the major bottlenecks in parallel performance and scaling efficiency. Here, we describe a particle tracking algorithm for large-scale parallel…
Parallel tempering, also known as replica exchange Monte Carlo, is studied in the context of two simple free energy landscapes. The first is a double well potential defined by two macrostates separated by a barrier. The second is a `golf…
The high cost of sequential time integration is one major constraint that limits the speedup of a time-parallel algorithm like the Parareal algorithm due to the difficulty of coarsening time steps in a stiff numerical problem. To address…
An extended ensemble Monte Carlo algorithm is proposed by introducing a violation of the detailed balance condition to the update scheme of the inverse temperature in simulated tempering. Our method, irreversible simulated tempering, is…
Parameterized artificial neural networks (ANNs) can be very expressive ansatzes for variational algorithms, reaching state-of-the-art energies on many quantum many-body Hamiltonians. Nevertheless, the training of the ANN can be slow and…
In this paper, three efficient ensemble algorithms are proposed for fast-solving the random fluid-fluid interaction model. Such a model can be simplified as coupling two heat equations with random diffusion coefficients and a friction…
We introduce a new update scheme to systematically improve the efficiency of parallel tempering simulations. We show that by adapting the number of sweeps between replica exchanges to the canonical autocorrelation time, the average…
In this study, we present a parallel topology algorithm with a suitable interpolation method for chimera simulations in CFD. The implementation is done in the unstructured Finite Volume (FV) framework and special attention is given to the…
We present an algorithm to parallelize the inverse fast multipole method (IFMM), which is an approximate direct solver for dense linear systems. The parallel scheme is based on a greedy coloring algorithm, where two nodes in the hierarchy…
We propose three semi-decoupled algorithms for efficiently solving a four-field thermoporoelastic model. The first two algorithms adopt a sequential strategy: at the initial time step, all variables are computed simultaneously using a…
A parallel algorithm for computing the finite difference solution to the elliptic equations with non-separable variables is presented. The resultant matrix is symmetric positive definite, thus the preconditioning conjugate gradient or the…
We propose a variant of the $\theta$-scheme for diffuse interface models for two-phase flow, together with three new linearization techniques for the surface tension. These involve either additional stabilizing force terms, or a fully…