2008
DOI: 10.1063/1.2830717
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive minimum action method for the study of rare events

Abstract: An adaptive minimum action method is proposed for computing the most probable transition paths between stable equilibria in metastable systems that do not necessarily have an underlying energy function, by minimizing the action functional associated with such transition paths. This new algorithm uses the moving mesh strategy to adaptively adjust the grid points over the time interval of transition. Numerical examples are presented to demonstrate the efficiency of the adaptive minimum action method.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
132
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
6
2
1

Relationship

2
7

Authors

Journals

citations
Cited by 106 publications
(134 citation statements)
references
References 31 publications
2
132
0
Order By: Relevance
“…In order to capture the correct optimal path, the selection of a large enough time interval [0, t * ] is essential 22,23 . If the absorbing boundary is far from the origin so that the energy differences between points on the boundary and origin are much larger than k B T , the optimal path is not sensitive to the value of t * as long as t * is reasonably large.…”
Section: -Dimensional Casementioning
confidence: 99%
“…In order to capture the correct optimal path, the selection of a large enough time interval [0, t * ] is essential 22,23 . If the absorbing boundary is far from the origin so that the energy differences between points on the boundary and origin are much larger than k B T , the optimal path is not sensitive to the value of t * as long as t * is reasonably large.…”
Section: -Dimensional Casementioning
confidence: 99%
“…In practice, we need to use finite values. A nice thing is that the error due to finite truncation drops very fast (nearly exponentially) with increasing T 2 − T 1 [39]. In our computations for the Lorenz system, we tested different transition times and numbers of mesh points to ensure that our numerical results are robust.…”
Section: The Minimum Action Methodsmentioning
confidence: 99%
“…If the dynamical system is a gradient system, the minimum action path has a simpler geometric characterization (the minimum energy path, or "MEP") and a simplified algorithm, the string method developed in [3,4], works better for this case. There have been some recent improvements of MAM: the adaptive minimum action method ("aMAM", [39]) and the geometric minimum action method ("gMAM", [40]). Both are designed to overcome the difficulties associated with representing the optimal path using the physical time.…”
Section: The Minimum Action Methodsmentioning
confidence: 99%
“…The objective is to find the optimal mesh using carefully chosen monitor functions, as the iteration proceeds. This is very simple, but it proves to be quite effective, see [9].…”
Section: The Adaptive Minimum Action Methodsmentioning
confidence: 99%