arrow
Return

Efficient Solution of the Electronic Eigenvalue Problem Using Wavepacket Propagation

delete2018-02-02
delete4
delete
OA
AI
S
Simon P. Neville
M
Michael S. Schuurman *
DOI:10.1021/acs.jctc.7b01258delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
We report how imaginary time wavepacket propagation may be used to efficiently calculate the lowest-lying eigenstates of the electronic Hamiltonian. This approach, known as the relaxation method in the quantum dynamics community, represents a fundamentally different approach to the solution of the electronic eigenvalue problem in comparison to traditional iterative subspace diagonalization schemes such as the Davidson and Lanczos methods. In order to render the relaxation method computationally competitive with existing iterative subspace methods, an extended short iterative Lanczos wavepacket propagation scheme is proposed and implemented. In the examples presented here, we show that by using an efficient wavepacket propagation algorithm the relaxation method is, at worst, as computationally expensive as the commonly used block Davidson-Liu algorithm, and in certain cases, significantly less so.
Keywords:
SCHRODINGER-EQUATION
ITERATIVE CALCULATION
SYMMETRIC-MATRICES
ALGORITHM
SCHEME
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Journal of Chemical Theory and Computation cover
Journal of Chemical Theory and Computation
IF:
5.5
Papers:
1.1W
Citations:
5.4W

Organization

U
University of Ottawa
Scholars:
3.5W
Papers: 3.1W
Citations: 3.8W
Cited Papers

Cited Papers

errShare
errSave
errShare
errSave
researcher View more