Single band steepest descent scheme: Difference between revisions
(Created page with "The Davidson iteration scheme optimizes all bands simultaneously. Optimizing a single band at a time would save the storage necessary for the {{TAG|NBANDS}} gradients. In a si...") |
No edit summary |
||
Line 9: | Line 9: | ||
Then the linear combination of this 'search direction' <math>g_n</math> | Then the linear combination of this 'search direction' <math>g_n</math> | ||
and the current wavefunction <math> \phi_n </math> | |||
is calculated which minimizes the expectation value of the Hamiltonian. | is calculated which minimizes the expectation value of the Hamiltonian. | ||
This requires to solve the <math>2 \times 2</math> eigenvalue problem | This requires to solve the <math>2 \times 2</math> eigenvalue problem |
Revision as of 11:38, 18 March 2019
The Davidson iteration scheme optimizes all bands simultaneously. Optimizing a single band at a time would save the storage necessary for the NBANDS gradients. In a simple steepest descent scheme the preconditioned residual vector is orthonormalized to the current set of wavefunctions i.e.
Then the linear combination of this 'search direction' and the current wavefunction is calculated which minimizes the expectation value of the Hamiltonian. This requires to solve the eigenvalue problem
with the basis set