iterative-solver 0.0
 
Loading...
Searching...
No Matches
DavidsonOptions.h
1#ifndef LINEARALGEBRA_SRC_MOLPRO_LINALG_ITSOLV_DAVIDSONOPTIONS_H
2#define LINEARALGEBRA_SRC_MOLPRO_LINALG_ITSOLV_DAVIDSONOPTIONS_H
3
4#include <molpro/linalg/itsolv/options_map.h>
5
6#include <cstddef>
7#include <optional>
8
10
12 DavidsonOptions() = default;
14
17 std::optional<std::size_t> reset_D;
20 std::optional<std::size_t> reset_D_max_Q_size;
25 std::optional<std::size_t> max_size_qspace;
27 std::optional<std::size_t> min_size_qspace;
28 std::optional<double> contrib_thresh;
29 std::optional<double> norm_thresh;
30 std::optional<double> svd_thresh;
31 std::optional<bool> hermiticity;
32};
33
34} // namespace molpro::linalg::itsolv
35
36#endif // LINEARALGEBRA_SRC_MOLPRO_LINALG_ITSOLV_DAVIDSONOPTIONS_H
4-parameter interpolation of a 1-dimensional function given two points for which function values and ...
Definition helper.h:14
std::unique_ptr< LinearEigensystem< R, Q, P > > create_LinearEigensystem(const LinearEigensystemOptions &options, const std::shared_ptr< ArrayHandlers< R, Q, P > > &handlers=std::make_shared< molpro::linalg::itsolv::ArrayHandlers< R, Q, P > >())
Definition SolverFactory.h:111
std::map< std::string, std::string > options_map
Definition options_map.h:8
Definition DavidsonOptions.h:11
std::optional< double > norm_thresh
Definition DavidsonOptions.h:29
std::optional< std::size_t > reset_D_max_Q_size
Definition DavidsonOptions.h:20
std::optional< bool > hermiticity
Definition DavidsonOptions.h:31
std::optional< std::size_t > max_size_qspace
Definition DavidsonOptions.h:25
std::optional< double > svd_thresh
Definition DavidsonOptions.h:30
std::optional< std::size_t > reset_D
Definition DavidsonOptions.h:17
std::optional< std::size_t > min_size_qspace
Minimum number of vectors kept in the Q space when it is truncated; must not exceed max_size_qspace....
Definition DavidsonOptions.h:27
std::optional< double > contrib_thresh
Definition DavidsonOptions.h:28