#include <EigenSystemDavidson.hpp>
|
typedef V::FieldType | F |
|
typedef V::FieldType | F |
|
|
| EigenSystemDavidsonMono (H *h_, const int eigenVectorsCount_, P *p_, const double toleranceVectors, const double toleranceEnergy, const unsigned int maxBasisSize_, const unsigned int maxIterations_, const unsigned int minIterations_) |
|
void | run () |
|
| EigenSystemDavidson (H *h_, const int eigenVectorsCount_, P *p_, const double toleranceVectors, const double toleranceEnergy, const unsigned int maxBasisSize_, const unsigned int maxIterations_, const unsigned int minIterations_) |
| ...
|
|
virtual void | run ()=0 |
|
const std::vector< complex > & | getEigenValues () const |
|
const std::vector< V > & | getRightEigenVectors () const |
|
const std::vector< V > & | getLeftEigenVectors () const |
|
void | refreshOnMaxBasisSize (const bool value) |
| Controls if the Davidson algorithm should make a refreshment of the basis whenever the maximal basis size has been attained.
|
|
bool | refreshOnMaxBasisSize () |
| Check wether or not the basis should be refreshed whenever the maximal basis size has been reached.
|
|
template<typename H , typename P , typename V >
◆ EigenSystemDavidsonMono()
template<typename H , typename P , typename V >
sisi4s::EigenSystemDavidsonMono< H, P, V >::EigenSystemDavidsonMono |
( |
H * |
h_, |
|
|
const int |
eigenVectorsCount_, |
|
|
P * |
p_, |
|
|
const double |
toleranceVectors, |
|
|
const double |
toleranceEnergy, |
|
|
const unsigned int |
maxBasisSize_, |
|
|
const unsigned int |
maxIterations_, |
|
|
const unsigned int |
minIterations_ |
|
) |
| |
|
inline |
◆ run()
template<typename H , typename P , typename V >
The documentation for this class was generated from the following file: