UCL Discovery
UCL home » Library Services » Electronic resources » UCL Discovery

Effective computation of matrix elements between polynomial basis functions

Kozin, I.N.; Tennyson, J.; Law, M.M.; (2005) Effective computation of matrix elements between polynomial basis functions. Computer Physics Communications , 165 (1) pp. 10-14. 10.1016/j.cpc.2003.12.007. Green open access

[thumbnail of 343.pdf]
Preview
PDF
343.pdf

Download (143kB)

Abstract

Two methods of evaluating matrix elements of a function in a polynomial basis are considered: the expansion method, where the function is expanded in the basis and the integrals are evaluated analytically, and the numerical method, where the integration is performed directly using numerical quadrature. A reduced grid is proposed for the latter which makes use of the symmetry of the basis. Comparison of the two methods is presented in the context of evaluation of matrix elements in a non-direct product basis. If high accuracy of all matrix elements is required then the expansion method is the best choice. If however the accuracy of high order matrix elements is not important (as in variational ro-vibrational calculations where one is typically interested only in the lowest eigenstates), then the method based on the reduced grid offers sufficient accuracy and is much quicker than the expansion method.

Type: Article
Title: Effective computation of matrix elements between polynomial basis functions
Open access status: An open access version is available from UCL Discovery
DOI: 10.1016/j.cpc.2003.12.007
Publisher version: http://dx.doi.org/10.1016/j.cpc.2003.12.007
Language: English
UCL classification: UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences > Dept of Physics and Astronomy
URI: https://discovery.ucl.ac.uk/id/eprint/1321
Downloads since deposit
0Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item