Calculation of Global, High-Dimensional Potential Energy Surface Fits in Sum-of-Products Form Using Monte-Carlo Methods

Markus Schröder () and Hans-Dieter Meyer ()
Additional contact information
Markus Schröder: Universität Heidelberg, Physikalisch-Chemisches Institut
Hans-Dieter Meyer: Universität Heidelberg, Physikalisch-Chemisches Institut

A chapter in High Performance Computing in Science and Engineering ' 17, 2018, pp 121-139 from Springer

Abstract: Abstract We have implemented a Monte-Carlo version of the well-known potfit algorithm. With potfit one can transform high-dimensional potential energy surfaces sampled on a grid into a sum-of-products form. More precisely, an fth order general tensor can be transformed into Tucker form. Using Monte-Carlo methods we avoid high-dimensional integrals that are needed to obtain optimal fits and simultaneously introduce importance sampling. The Tucker form is well suited for further use within the Heidelberg MCTDH package for solving the time-dependent as well as the time-independent Schrödinger equation of molecular systems. We demonstrate the power of the Monte-Carlo potfit algorithm by globally fitting the 15-dimensional potential energy surface of the Zundel cation (H5O 2 + $$_2^+$$ ) and subsequently calculating the lowest vibrational eigenstates of the molecule.

Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-68394-2_7

Ordering information: This item can be ordered from
http://www.springer.com/9783319683942

DOI: 10.1007/978-3-319-68394-2_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().