The geometric minimum action method for computing minimum energy paths

Eric Vanden Eijnden, Matthias Heymann

Research output: Contribution to journalArticle

Abstract

An algorithm is proposed to calculate the minimum energy path (MEP). The algorithm is based on a variational formulation in which the MEP is characterized as the curve minimizing a certain functional. The algorithm performs this minimization using a preconditioned steepest-descent scheme with a reparametrization step to enforce a constraint on the curve parametrization.

Original languageEnglish (US)
Article number061103
JournalJournal of Chemical Physics
Volume128
Issue number6
DOIs
StatePublished - 2008

Fingerprint

descent
curves
energy
formulations
optimization

ASJC Scopus subject areas

  • Atomic and Molecular Physics, and Optics

Cite this

The geometric minimum action method for computing minimum energy paths. / Vanden Eijnden, Eric; Heymann, Matthias.

In: Journal of Chemical Physics, Vol. 128, No. 6, 061103, 2008.

Research output: Contribution to journalArticle

@article{8e91ac4566d246f5a03e09cc201aa993,
title = "The geometric minimum action method for computing minimum energy paths",
abstract = "An algorithm is proposed to calculate the minimum energy path (MEP). The algorithm is based on a variational formulation in which the MEP is characterized as the curve minimizing a certain functional. The algorithm performs this minimization using a preconditioned steepest-descent scheme with a reparametrization step to enforce a constraint on the curve parametrization.",
author = "{Vanden Eijnden}, Eric and Matthias Heymann",
year = "2008",
doi = "10.1063/1.2833040",
language = "English (US)",
volume = "128",
journal = "Journal of Chemical Physics",
issn = "0021-9606",
publisher = "American Institute of Physics Publising LLC",
number = "6",

}

TY - JOUR

T1 - The geometric minimum action method for computing minimum energy paths

AU - Vanden Eijnden, Eric

AU - Heymann, Matthias

PY - 2008

Y1 - 2008

N2 - An algorithm is proposed to calculate the minimum energy path (MEP). The algorithm is based on a variational formulation in which the MEP is characterized as the curve minimizing a certain functional. The algorithm performs this minimization using a preconditioned steepest-descent scheme with a reparametrization step to enforce a constraint on the curve parametrization.

AB - An algorithm is proposed to calculate the minimum energy path (MEP). The algorithm is based on a variational formulation in which the MEP is characterized as the curve minimizing a certain functional. The algorithm performs this minimization using a preconditioned steepest-descent scheme with a reparametrization step to enforce a constraint on the curve parametrization.

UR - http://www.scopus.com/inward/record.url?scp=39449102156&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=39449102156&partnerID=8YFLogxK

U2 - 10.1063/1.2833040

DO - 10.1063/1.2833040

M3 - Article

C2 - 18282021

AN - SCOPUS:39449102156

VL - 128

JO - Journal of Chemical Physics

JF - Journal of Chemical Physics

SN - 0021-9606

IS - 6

M1 - 061103

ER -