title: A Highly-Efficient Implementation of the Doktorov Recurrence Equations for Franck-Condon Calculations.
abstract: In this paper, a new algorithm for computing Franck-Condon overlaps using the Doktorov recurrence equations is proposed. One of the major computational stresses of using the recurrence equations arises from searching data structures for overlaps that are stored in memory. The proposed algorithm alleviates this problem by tracking, throughout the algorithm, the locations in memory of overlaps that are required to use the recurrence relations. The tracking procedure helps to significantly reduce the run time of the algorithm compared to existing implementations.
authors.affiliation: Institute for Computational Engineering and Sciences, The University of Texas at Austin , Austin, Texas 78712, United States.
authors.forename: Scott M
authors.initials: SM
authors.lastname: Rabidoux
authors.affiliation: Texas Advanced Computing Center , Austin, Texas 78758, United States.
authors.forename: Victor
authors.initials: V
authors.lastname: Eijkhout
authors.affiliation: Department of Chemistry, The University of Texas at Austin , Austin, Texas 78712, United States.
authors.forename: John F
authors.initials: JF
authors.lastname: Stanton