Related papers: Improved Langevin Methods for Spin Systems
We present an approach to numerically solving the time-dependent Schroedinger equation and other parabolic equations by the split-step technique with fast Fourier transform, which suppresses the backreflection of waves from the grid…
Neumann series underlie both Krylov methods and algebraic multigrid smoothers. A low-synch modified Gram-Schmidt (MGS)-GMRES algorithm is described that employs a Neumann series to accelerate the projection step. A corollary to the backward…
We present a novel method for drawing samples from Gibbs distributions with densities of the form $\pi(x) \propto \exp(-U(x))$. The method accelerates the unadjusted Langevin algorithm by introducing an inertia term similar to Polyak's…
The Lorentzian type IIB matrix model has been studied as a promising candidate for a nonperturbative formulation of superstring theory. In particular, the emergence of (3+1)D expanding space-time was observed by Monte Carlo studies of this…
The complex Langevin method (CLM) provides a promising way to perform the path integral with a complex action using a stochastic equation for complexified dynamical variables. It is known, however, that the method gives wrong results in…
This paper presents a distributed continuous-time optimization framework aimed at overcoming the challenges posed by time-varying cost functions and constraints in multi-agent systems, particularly those subject to disturbances. By…
Several differential equation models have been proposed to explain the formation of patterns characteristic of the grid cell network. Understanding the effect of noise on these models is one of the key open questions in computational…
We present a formalism for simulating quantum dynamics of lattice spin-one systems by first introducing local hidden variables and then doing semiclassical (truncated Wigner) approximation in the extended phase space. In this way we exactly…
Boosting is a well-known method for improving the accuracy of weak learners in machine learning. However, its theoretical generalization guarantee is missing in literature. In this paper, we propose an efficient boosting method with…
We present new convergence estimates for the iterated penalty method applied to structure-preserving discretizations of linear generalized saddle point systems. The method may be viewed as an Uzawa iteration on an augmented Lagrangian…
We perform a Nf = 2 + 1 lattice QCD simulation to determine the quark spin fractions of hadrons using the Feynman-Hellmann theorem. By introducing an external spin operator to the fermion action, the matrix elements relevant for quark spin…
We extend the semi-Lagrangian discontinuous Galerkin (SLDG) method of Einkemmer to velocity grids with adaptive mesh refinement (AMR) and to three-dimensional velocity space. The original SLDG formulation assumes uniform cell widths, which…
A formulation of Langevin dynamics for discrete systems is derived as a class of generic stochastic processes. The dynamics simplify for a two-state system and suggest a network architecture which is implemented by the Langevin machine. The…
Lattice gauge theories in varying dimensions, lattice volumes, and truncations offer a rich family of targets for Hamiltonian simulation on quantum devices. In return, formulating quantum simulations can provide new ways of thinking about…
In this paper, a modified robust model predictive control scheme is proposed for linear parametric variable (LPV) and hybrid systems based on a quasi-min-max algorithm. Using a new cost function resulted in reduced unwanted disturbances…
We introduce a constructive framework to learn effective Langevin equations from stationary time series. Unlike conventional approaches that require iterative calibration to match target statistics, our construction guarantees the observed…
The Iteratively Smoothing Unigrid algorithm (ISU), a new multigrid method for computing propagators in Lattice Gauge Theory, is explained. The main idea is to compute good (i.e.\ smooth) interpolation operators in an iterative way. This…
A method is developed which speeds up averaging in quantum simulations where minus signs cause difficulties. A Langevin equation method in conjunction with a replication algorithm is used enabling one to average over a continuously varying…
Using the Sklyanin-Kharchev-Lebedev method of Separation of Variables adapted to the cyclic Baxter--Bazhanov--Stroganov or $\tau^{(2)}$-model, we derive factorized formulae for general finite-size Ising model spin matrix elements, proving a…
We introduce an acceleration algorithm for coulomb gauge fixing, using the compactly supported wavelets introduced by Daubechies. The algorithm is similar to Fourier acceleration. Our provisional numerical results for $SU(3)$ on $8^{4}$…