GQCP
|
#include <SubspaceMatrixDiagonalization.hpp>
Public Member Functions | |
SubspaceMatrixDiagonalization (const size_t number_of_requested_eigenpairs=1) | |
std::string | description () const override |
void | execute (EigenproblemEnvironment< double > &environment) override |
![]() | |
virtual | ~Step ()=default |
virtual std::string | description () const=0 |
virtual void | execute (Environment &environment)=0 |
Additional Inherited Members | |
![]() | |
using | Environment = EigenproblemEnvironment< double > |
An iteration step that diagonalizes the subspace matrix, i.e. the projection of the matrix A onto the subspace spanned by the vectors in V.
|
inline |
number_of_requested_eigenpairs | the number of solutions the Davidson solver should find |
|
inlineoverridevirtual |
Implements GQCP::Step< EigenproblemEnvironment< double > >.
|
inlineoverridevirtual |
Diagonalize the subspace matrix, i.e. the projection of the matrix A onto the subspace spanned by the vectors in V, and write its eigenvalues and eigenvectors to the environment.
environment | the environment that acts as a sort of calculation space |
Implements GQCP::Step< EigenproblemEnvironment< double > >.