Adaptive force biasing algorithms: new convergence results and tensor approximations of the bias

07/20/2020
by   Virginie Ehrlacher, et al.
0

A modification of the Adaptive Biasing Force method is introduced, in which the free energy is approximated by a sum of tensor products of one-dimensional functions. This enables to handle a larger number of reaction coordinates than the classical algorithm. We prove the algorithm is well-defined and prove the long-time convergence toward a regularized version of the free energy for an idealized version of the algorithm. Numerical experiments demonstrate that the method is able to capture correlations between reaction coordinates.

READ FULL TEXT

page 32

page 35

page 36

research
02/15/2022

A numerical energy minimisation approach for semilinear diffusion-reaction boundary value problems based on steady state iterations

We present a novel energy-based numerical analysis of semilinear diffusi...
research
09/07/2021

A second-order accurate, operator splitting scheme for reaction-diffusion systems in an energetic variational formulation

A second-order accurate in time, positivity-preserving, and unconditiona...
research
12/16/2021

Randomized regularized extended Kaczmarz algorithms for tensor recovery

Randomized regularized Kaczmarz algorithms have recently been proposed t...
research
08/27/2019

Fast multipole method for 3-D Laplace equation in layered media

In this paper, a fast multipole method (FMM) is proposed for 3-D Laplace...
research
05/17/2019

Tensor Ring Decomposition: Energy Landscape and One-loop Convergence of Alternating Least Squares

In this work, we study the tensor ring decomposition and its associated ...
research
08/01/2017

Intrinsic Frequency Analysis and Fast Algorithms

Intrinsic Frequency (IF) has recently been introduced as an ample signal...

Please sign up or login with your details

Forgot password? Click here to reset