The adaptive biasing force algorithm with non-conservative forces and related topics - Archive ouverte HAL Access content directly
Journal Articles ESAIM: Mathematical Modelling and Numerical Analysis Year : 2022

The adaptive biasing force algorithm with non-conservative forces and related topics

Abstract

We propose a study of the Adaptive Biasing Force method’s robustness under generic (possibly non-conservative) forces. We first ensure the flat histogram property is satisfied in all cases. We then introduce a fixed point problem yielding the existence of a stationary state for both the Adaptive Biasing Force and Projected Adapted Biasing Force algorithms, relying on generic bounds on the invariant probability measures of homogeneous diffusions. Using classical entropy techniques, we prove the exponential convergence of both biasing force and law as time goes to infinity, for both the Adaptive Biasing Force and the Projected Adaptive Biasing Force methods.
Fichier principal
Vignette du fichier
m2an210039.pdf (570.4 Ko) Télécharger le fichier
Origin : Publication funded by an institution

Dates and versions

hal-03591908 , version 1 (28-02-2022)

Identifiers

Cite

Tony Lelièvre, Lise Maurin, Pierre Monmarché. The adaptive biasing force algorithm with non-conservative forces and related topics. ESAIM: Mathematical Modelling and Numerical Analysis, 2022, 56 (2), pp.529-564. ⟨10.1051/m2an/2022010⟩. ⟨hal-03591908⟩
174 View
25 Download

Altmetric

Share

Gmail Facebook X LinkedIn More