Abstract
In a recent publication [J. Chem. Phys. 127, 084102 (2007)], the nearly variational DEWE approach (DEWE denotes Discrete variable representation of the Watson Hamiltonian using the Eckart frame and an Exact inclusion of a potential energy surface expressed in arbitrarily chosen coordinates) was developed to compute a large number of (ro)vibrational eigenpairs for medium-sized semirigid molecules having a single well-defined minimum. In this publication, memory, CPU, and hard disk usage requirements of DEWE, and thus of any DEWE-type approach, are carefully considered, analyzed, and optimized. Particular attention is paid to the sparse matrix-vector multiplication, the most expensive part of the computation, and to rate-determining steps in the iterative Lanczos eigensolver, including spectral transformation, reorthogonalization, and restart of the iteration. Algorithmic improvements are discussed in considerable detail. Numerical results are presented for the vibrational band origins of the (12)CH(4) and (12)CH(2)D(2) isotopologues of the methane molecule. The largest matrix handled on a personal computer during these computations is of the size of (4x10(8))x(4x10(8)). The best strategy for determining vibrational eigenpairs depends largely on the actual details of the required computation. Nevertheless, for a usual scenario requiring a large number of the lowest eigenpairs of the Hamiltonian matrix the combination of the thick-restart Lanczos method, shift-fold filtering, and periodic reorthogonalization appears to result in the computationally most feasible approach.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.