The very first MCTDH program was written by Uwe Manthe as part of his PhD work in Heidelberg. This was put together as the Heidelberg MCTDH Package by Hans-Dieter Meyer, Graham Worth, Andreas Jäckle and Michael Beck. Over the years several graduate students, post-docs and visitors made contributions to the MCTDH package. In chronological order:
M. Ehara, M.-C. Heitz, A. Raab, S. Wefing, S. Sukiasyan, C. Cattarius, F. Gatti, F. Otto, M. Nest, A. Markmann, M. R. Brill, O. Vendrell, M. Schröder, D. Pelaez-Ruiz, Phillip S. Thomas, Ying-Chih Chiang, and David Mendive-Tapia
The first version of the Heidelberg ML-MCTDH code was written by Oriol Vendrell in 2011.
We are very, very grateful to all of them!
When citing the Heidelberg MCTDH package in the literature, the following citation should be used:
G. A. Worth, M. H. Beck, A. Jäckle, and H.-D. Meyer.
The MCTDH Package, Version 8.2, (2000).
H.-D. Meyer, Version 8.3 (2002), Version 8.4 (2007).
O. Vendrell and H.-D. Meyer Version 8.5 (2013).
Versions 8.5 and 8.6 contain the ML-MCTDH algorithm.
See http://mctdh.uni-hd.de for a description of the Heidelberg MCTDH package.
Current version: 8.6.2 (2022).
(Rather than
A comprehensive description of the main methods incorporated in the program is in the following review which should be cited as well:
The original paper on the MCTDH algorithm is:
If the ML-MCTDH method is used, the following paper on the Heidelberg ML implementation should be cited:
A book and further review articles on the methods are:
The software in the Heidelberg MCTDH package is copyright
© 1996 -- 2022 Hans-Dieter Meyer, Graham A. Worth, Andreas Jäckle, Michael H. Beck, and Oriol Vendrell.
Permission is granted to use and copy this software and its documentation. Further distribution requires the agreement of the authors. Permission to modify the software is granted. The authors would welcome if additions and bug fixes are made available to them for inclusion in future releases of the package.
This software is provided "as-is" and without warranty of any kind.