GQCP
|
#include "Mathematical/Algorithm/IterativeAlgorithm.hpp"
#include "Mathematical/Algorithm/StepCollection.hpp"
#include "Mathematical/Optimization/Eigenproblem/Davidson/CorrectionVectorCalculation.hpp"
#include "Mathematical/Optimization/Eigenproblem/Davidson/GuessVectorUpdate.hpp"
#include "Mathematical/Optimization/Eigenproblem/Davidson/MatrixVectorProductCalculation.hpp"
#include "Mathematical/Optimization/Eigenproblem/Davidson/ResidualVectorCalculation.hpp"
#include "Mathematical/Optimization/Eigenproblem/Davidson/ResidualVectorConvergence.hpp"
#include "Mathematical/Optimization/Eigenproblem/Davidson/SubspaceMatrixCalculation.hpp"
#include "Mathematical/Optimization/Eigenproblem/Davidson/SubspaceMatrixDiagonalization.hpp"
#include "Mathematical/Optimization/Eigenproblem/Davidson/SubspaceUpdate.hpp"
#include "Mathematical/Optimization/Eigenproblem/EigenproblemEnvironment.hpp"
Go to the source code of this file.
Namespaces | |
namespace | GQCP |
namespace | GQCP::EigenproblemSolver |
Functions | |
IterativeAlgorithm< EigenproblemEnvironment< double > > | GQCP::EigenproblemSolver::Davidson (const size_t number_of_requested_eigenpairs=1, const size_t maximum_subspace_dimension=15, const double convergence_threshold=1.0e-08, double correction_threshold=1.0e-12, const size_t maximum_number_of_iterations=128, const double inclusion_threshold=1.0e-03) |