Abstract
The quasi-potential is a key function in the Large Deviation Theory. It characterizes the difficulty of the escape from the neighborhood of an attractor of a stochastic non-gradient dynamical system due to the influence of small white noise. It also gives an estimate of the invariant probability distribution in the neighborhood of the attractor up to the exponential order. We present a new family of methods for computing the quasi-potential on a regular mesh named the ordered line integral methods (OLIMs). In comparison with the first proposed quasi-potential finder based on the ordered upwind method (OUM) (Cameron in Phys D Nonlinear Phenom 241:1532–1550, 2012), the new methods are 1.5–4 times faster, can produce error two to three orders of magnitude smaller, and may exhibit faster convergence. Similar to the OUM, OLIMs employ the dynamical programming principle. Contrary to it, they (1) have an optimized strategy for the use of computationally expensive triangle updates leading to a notable speed-up, and (2) directly solve local minimization problems using quadrature rules instead of solving the corresponding Hamilton–Jacobi-type equation by the first order finite difference upwind scheme. The OLIM with the right-hand quadrature rule is equivalent to OUM. The use of higher order quadrature rules in local minimization problems dramatically boosts up the accuracy of OLIMs. We offer a detailed discussion on the origin of numerical errors in OLIMs and propose rules-of-thumb for the choice of the important parameter, the update factor, in the OUM and OLIMs. Our results are supported by extensive numerical tests on two challenging 2D examples.
Similar content being viewed by others
Notes
Actually, in our codes, the maximal update length for the one-point update is Kh, while it is \(Kh + \sqrt{h_1^2+h_2^2}\) for the triangle update.
There is an error in Eq. (89) in [1]. It should be \(U=\tfrac{1}{2}(r^2-1)^2\).
References
Cameron, M.K.: Finding the quasipotential for nongradient SDEs. Phys. D Nonlinear Phenom. 241, 1532–1550 (2012)
Chen, Z., Freidlin, M.: Smoluchowski–Kramers approximation and exit problems. Stoch. Dyn. 5(4), 569–585 (2005)
Conte, S.D., de Boor, Carl: Elementary Numerical Analysis: An Algorithmic Approach, 3rd edn. McGraw-Hill Book Company, New York (1980)
Crandall, M.G., Lions, P.L.: Viscosity solutions of Hamilton–Jacobi–Bellman equations. Trans. Am. Math. Soc. 277, 1–43 (1983)
Freidlin, M.I., Wentzell, A.D.: Random Perturbations of Dynamical Systems, 3rd edn. Springer, Berlin (2012)
Grafke, T., Grauer, R., Schaefer, T.: The instanton method and its numerical implementation in fluid mechanics. J. Phys. A Math. Theor. 48(33), 333001 (2015)
Heymann, M., Vanden-Eijnden, E.: Pathways of maximum likelihood for rare events in non-equilibrium systems, application to nucleation in the presence of shear. Phys. Rev. Lett. 100(14), 140601 (2007)
Heymann, M., Vanden-Eijnden, E.: The geometric minimum action method: a least action principle on the space of curves. Commun. Pure Appl. Math. 61(8), 1052–1117 (2008)
Hurewicz, W.: Lectures on Ordinary Differential Equations. Dover Publications, New York (1990). (Originally, this book was published by the M.I.T. Press, Cambridge, Mass, in 1958)
https://www.math.umd.edu/~mariakc/software-and-datasets.html
Ishii, H.: A simple direct proof of uniqueness for solutions of the Hamilton–Jacobi equations of eikonal type. Proc. Am. Math. Soc. 100(2), 247–251 (1987)
Lv, Cheng, Li, Xiaoguang, Li, Fangting, Li, Tiejun: Constructing the energy landscape for genetic switching system driven by intrinsic noise. PLoS ONE 9(2), e88167 (2014)
Maier, R.S., Stein, D.L.: A scaling theory of bifurcations in the symmetric weak-noise escape problem. J. Stat. Phys. 83(3–4), 291357 (1996)
Nolting, B.C., Abbot, K.C.: Balls, cups, and quasi-potentials: quantifying stability in stochastic systems. Ecology 97(4), 850–864 (2016)
Nolting, B., Moore, C., Stieha, C., Cameron, M., Abbott, K.: QPot: an R package for stochastic differential equation quasi-potential analysis. R J. 8(2), 19–38 (2016)
Sethian, J.A., Vladimirsky, A.: Ordered upwind methods for static Hamilton–Jacobi equations. Proc. Natl. Acad. Sci. USA 98(20), 11069–11074 (2001)
Sethian, J.A., Vladimirsky, A.: Ordered upwind methods for static Hamilton–Jacobi equations: theory and algorithms. SIAM J. Numer. Anal. 41(1), 325–363 (2003)
Stewart, J.W.: Afternotes on Numerical Analysis. SIAM, Philadelphia (1996)
Wilkinson, J.: Two algorithms based on successive linear interpolation. Computer Science, Stanford University, Technical Report CS-60 (1967)
Zhou, Xiang, Ren, Weiqing, Weinan, E.: Adaptive minimum action method for the study of rare events. J. Chem. Phys. 128, 104111 (2008)
Zhou, Xiang, Weinan, E.: Study of noise-induced transitions in the Lorenz system using the minimum action method. Commun. Math. Sci. 8(2), 341–355 (2010)
Acknowledgements
We thank Professor A. Vladimirsky for a valuable discussion. This work was supported in part by the NSF Grant DMS1554907.
Author information
Authors and Affiliations
Corresponding author
Appendices
Appendix A: The Freidlin–Wentzell Action Versus the Geometric Action
The Freidlin-Wentzell action functional for SDE (1) is defined on the set of absolutely continuous paths \(\phi (t)\) by [5]
The original definition of the quasi-potential [5] with respect to a compact set A (an attractor of \(\dot{\mathbf {x}}=\mathbf {b}(\mathbf {x})\)) at a point \(\mathbf {x}\) is
The minimization with respect to the travel-time T can be performed analytically [5, 7, 8] resulting at the geometric action \(S(\psi )\). Let \(\phi (t)\) be a fixed absolutely continuous path \(\phi (t)\). Expanding \(\Vert \cdot \Vert ^2\) in Eq. (A-1) and using the inequality \(y^2 + z^2 \ge 2yz\) for all nonnegative real numbers y and z, we get:
The inequality in Eq. (A-3) becomes an equality if and only if \(\Vert \dot{\phi }\Vert = \Vert \mathbf {b}(\phi )\Vert \). Let \(\chi \) be the path obtained from \(\phi \) by a reparametrization such that \(\Vert \dot{\chi }\Vert = \Vert \mathbf {b}(\chi )\Vert \). Then
Note that \(T_{\chi }\) can be infinite. The integral in right-hand side of Eq. (A-5) is invariant with respect to the parametrization of the path \(\chi \). Hence, we can pick the most convenient one, for example, the arclength parametrization, and denote the reparametrized path by \(\psi \). Hence,
where L is the length of the paths \(\chi \) and \(\psi \) (corresponding to the same curve). For computation of the quasi-potential, it is more convenient to deal with the geometric action \(S(\psi )\) than with the Freidlin-Wentzell action \(S_T(\phi )\).
Appendix B: The Triangle Updates for the OLIMs
OLIM-R
OLIM-R performs the triangle update by solving the following minimization problem
Taking the derivative of the function to be minimized
with respect to s and setting it to zero, we obtain the following equation for s:
Regrouping terms and taking squares we obtain the following quadratic equation for s:
We solve Eq. (B-3), select its root \(s^{*}\), if any, on the interval [0, 1], and verify that it is also the root of Eq. (B-2). In the case of success, the triangle update returns
Otherwise, it returns \(\mathsf{Q}_{{\varDelta }}(\mathbf {x}_1,\mathbf {x}_0,\mathbf {x}) =+\infty \).
OLIM-MID
OLIM-MID performs the triangle update by solving the following minimization problem
Taking the derivative of
with respect to s and setting it to zero, we obtain the following equation for s:
The hybrid nonlinear solver [19, 20] is used for finding a root \(s^{*}\) of Eq. (B-8) in the interval [0, 1]. In the case of success, the triangle update returns
Otherwise, it returns \(\mathsf{Q}_{{\varDelta }}(\mathbf {x}_1,\mathbf {x}_0,\mathbf {x}) =+\infty \).
OLIM-TR
OLIM-TR performs the triangle update by solving the following minimization problem
Taking the derivative of
with respect to s and setting it to zero we obtain the following equation for s:
The hybrid nonlinear solver [19, 20] is used for finding a root \(s^{*}\) of Eq. (B-10) in the interval [0, 1]. In the case of success, the triangle update returns
Otherwise, it returns \(\mathsf{Q}_{{\varDelta }}(\mathbf {x}_1,\mathbf {x}_0,\mathbf {x}) =+\infty \).
OLIM-SIM
OLIM-SIM performs the triangle update by solving the following minimization problem
Taking the derivative of
with respect to s and setting it to zero, we obtain the following equation for s:
The hybrid nonlinear solver [19, 20] is used for finding a root \(s^{*}\) of Eq. (B-12) in the interval [0, 1]. In the case of success, the triangle update returns
Otherwise, it returns \(\mathsf{Q}_{{\varDelta }}(\mathbf {x}_1,\mathbf {x}_0,\mathbf {x}) =+\infty \).
Appendix C: Proof of Theorem 1
Proof
Without the loss of generality we assume that \(\mathbf {x}_1\) is the origin.
Step 1. Show that u is a solution of Eq. (17) if and only if \(u - u_1= \Vert \mathbf {x}\Vert (U_{\xi }\cos (\alpha ) + U_{\eta }\sin (\alpha ))\) where (see Fig. 13) \(\alpha \) (\(0<\alpha <\pi \)) is the angle between the vectors \(\mathbf {x}_0\) and \(\mathbf {x}\), \(U_{\xi } = \Vert \mathbf {x}_0\Vert ^{-1}(u_0-u_1)\), and \(U_{\eta }\) is a solution of
which is Eq. (3) written in the \((\xi ,\eta )\)-coordinates at the point \(\mathbf {x}\).
First observe that both Eqs. (17) and (19) are invariant with respect to translations. Therefore, we shift \(\mathbf {x}_1\) to the origin as shown in Fig. 13 without changing their solutions.
Second, Eq. (17) is invariant with respect to orthogonal transformations. Indeed, the multiplication of \(\mathbf {x}\) and \(\mathbf {x}_0\) by an orthogonal matrix O converts Eq. (16) to
Hence the matrix P in Eq. (17) changes to \(PO^T\) and \(\mathbf {b}\) becomes \(O\mathbf {b}\) leading to the equation
which is equivalent to Eq. (17). Hence, we apply an orthogonal transformation to map the original coordinate system onto the \((\xi ,\eta )\) system in which \(\mathbf {x}_0 \) lies on the positive \(\xi \)-semiaxis and the \(\eta \)-coordinate of \(\mathbf {x}\) is positive:
where \(\alpha \) (\(0<\alpha <\pi \)) is the angle between vectors \(\mathbf {x}_0\) and \(\mathbf {x}\) as shown in Fig. 13.
Finally, if u is a solution of Eq. (17) then
Hence, if u is the solution of Eq. (17), then \(U_{\xi }\) is exactly \((u_0-u_1)/\Vert \mathbf {x}_0\Vert \) which shows that it is independent of u. Hence Eq. (17) can be rewritten as an equation Eq. (C-1) for \(U_{\eta }\).
Step 2. Find geometric conditions guaranteeing the existence of solution(s) of Eq. (C-1) satisfying the consistency check and determine the selection rule if it has two solutions.
Equation (3) implies that \(\nabla U\) is orthogonal to \(2\mathbf {b}+ \nabla U\). Therefore, the locus of the vectors \(\nabla U\) satisfying Eq. (3) is the circle [1] shown in Fig. 13. This circle passes through the origin and has center at the end of the vector \(-\mathbf {b}\) originating from the origin. Since \(\Vert \nabla U\Vert ^2 = U_{\xi }^2 + U_{\eta }^2\), Eq. (3) has a solution if and only if the line normal to the \(\xi \)-axis and passing through the point \((U_{\xi },0)\) (the red dashed line in Fig. 13) intersects the circle. The MAP is collinear to the vector \(\mathbf {b}+\nabla U\) [1]. The consistency condition requires that the MAP passing through the point \(\mathbf {x}\) crosses the interval \([\mathbf {x}_1,\mathbf {x}_0]\). This means that the angle between the vector \(\mathbf {b}+\nabla U\) and the positive \(\xi \)-semiaxis should be not less than the angle \(\alpha \) between the vector \(\mathbf {x}-\mathbf {x}_1\equiv \mathbf {x}\) and the positive \(\xi \)-semiaxis, and not greater than the angle between the vector \(\mathbf {x}-\mathbf {x}_0\) and the positive \(\xi \)-semiaxis. Drawing rays parallel to \(\mathbf {x}\) and \(\mathbf {x}-\mathbf {x}_0\) from the center of the circle and then dropping normals from their intersections with the circle to the \(\xi \)-axis as shown in Fig. 13, we obtain the interval on the \(\xi \)-axis where \(U_{\xi }\) should belong in order to make the solution \(U_{\eta }\) of Eq. (C-1) satisfy the consistency condition. This interval bounded by the endpoints of the thin brown and green-blue dashed lines in Fig. 13. Note that the consistency condition can be satisfied only by the larger root of Eq. (C-1), i.e., we should select the root
Step 3. Find the solution of the minimization problem (19) and show that, if the minimizer \(s^{*}\in (0,1)\) then it coincides with \(u = \Vert \mathbf {x}\Vert (U_{\xi }\cos (\alpha ) + U_{\eta }\sin (\alpha ))\), where \(U_{\xi } = (u_0-u_1)/\Vert \mathbf {x}\Vert \) and \(U_{\eta }\) is given by Eq. (C-4).
Consider the function to be minimized in Eq. (19) rewritten for \(\mathbf {x}_1\) shifted to the origin:
where \(\gamma \) is the angle between the vectors \(\mathbf {b}\) and \(\mathbf {x}-s\mathbf {x}_0\). The point \(s\mathbf {x}_0\), and hence the value of s, is uniquely determined by the angle \(\gamma \) (Fig. 13):
Moreover, since \(\cot (\gamma -\beta )\) is a monotone function on the interval \(0<\gamma - \beta < \pi \), there is a one-to-one correspondence between \(-\infty< s<\infty \) and \(\beta< \gamma < \beta + \pi \). Therefore, the function \(f(s) =: F(\gamma (s))\), \(\beta< \gamma < \beta + \pi \), where
If \((s^{*},f(s^{*}))\) is a minimum of f(s), then there is a unique minimum \((\gamma ^{*},F(\gamma ^{*})=f(s^{*}))\) of \(F(\gamma )\).
Let us minimize \(F(\gamma )\). Its derivative is given by:
Setting it to zero, cancelling the positive constant \(\Vert \mathbf {x}\Vert \sin (\alpha )/\sin ^2(\gamma - \beta )\), regrouping the terms, and applying trigonometric formulas, we obtain the following equation for \(\gamma \):
Hence, the optimal angle \(\gamma \) satisfies:
Let us denote by \(\gamma ^{*}\) the solution of Eq. (C-9) lying in the interval \((\beta ,\beta + \pi )\). To check whether \(\gamma ^{*}\) is a maximizer or a minimizer, we evaluate the second derivative of \(F(\gamma )\) at \(\gamma ^{*}\) and find:
as the angle \(\gamma - \beta \in (0,\pi )\) by construction. Hence the optimal \(\gamma \) is the minimizer of F. Next, we recall Eq. (3): \(\Vert \nabla U\Vert + 2\mathbf {b}\cdot \nabla U=0\). Adding \(\Vert \mathbf {b}\Vert ^2\) to both sides, we obtain \(\Vert \nabla U + \mathbf {b}\Vert ^2 = \Vert \mathbf {b}\Vert ^2\). Then Eq. (C-9) and the equality \(\Vert \nabla U + \mathbf {b}\Vert =\Vert \mathbf {b}\Vert \) imply
Therefore,
On the other hand, from Eq. (C-9) we obtain:
Plugging Eq. (C-13) into Eq. (C-12) we get
which coincides with Eq. (C-4).
Finally, the solution of the minimization problem (19)
is achieved either at \(s^{*}\) if \(0\le s^{*}\le 1\), or at the endpoints \(s=0\) or \(s=1\). Hence, if \(0< s^{*} < 1\), then the solution of the minimization problem (19) coincides with the one of the finite difference scheme (17), and the latter meets the consistency conditions. Conversely, the solution of the finite difference scheme (17) satisfying the consistency conditions coincides with the one of the minimization problem (19), and the corresponding minimizer \(s^{*}\in [0,1]\). \(\square \)
Rights and permissions
About this article
Cite this article
Dahiya, D., Cameron, M. Ordered Line Integral Methods for Computing the Quasi-Potential. J Sci Comput 75, 1351–1384 (2018). https://doi.org/10.1007/s10915-017-0590-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10915-017-0590-9
Keywords
- Quasi-potential
- Ordered line integral methods
- Ordered upwind method
- Accuracy
- CPU time
- Update radius
- Hierarchical update strategy