In this paper, we introduce a trajectory-based nonadiabatic dynamics algorithm which aims to correct the well-known overcoherence problem in Tully's popular fewest-switches surface hopping algorithm. Our simultaneous-trajectory surface hopping algorithm propagates a separate classical trajectory on each energetically accessible adiabatic surface. The divergence of these trajectories generates decoherence, which collapses the particle wavefunction onto a single adiabatic state. Decoherence is implemented without the need for any parameters, either empirical or adjustable. We apply our algorithm to several model problems and find a significant improvement over the traditional algorithm.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1063/1.3575588 | DOI Listing |
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!