1#ifndef LINEARALGEBRA_SRC_MOLPRO_LINALG_ITSOLV_LINEAREIGENSYSTEMDAVIDSON_H
2#define LINEARALGEBRA_SRC_MOLPRO_LINALG_ITSOLV_LINEAREIGENSYSTEMDAVIDSON_H
5#include <molpro/Profiler.h>
6#include <molpro/linalg/itsolv/CastOptions.h>
7#include <molpro/linalg/itsolv/DSpaceResetter.h>
8#include <molpro/linalg/itsolv/IterativeSolverTemplate.h>
9#include <molpro/linalg/itsolv/Logger.h>
10#include <molpro/linalg/itsolv/propose_rspace.h>
11#include <molpro/linalg/itsolv/qspace_options.h>
12#include <molpro/linalg/itsolv/rspace_options.h>
13#include <molpro/linalg/itsolv/subspace/SubspaceSolverLinEig.h>
14#include <molpro/linalg/itsolv/subspace/XSpace.h>
29template <
class R,
class Q = R,
class P = std::map<
size_t,
typename R::value_type>>
33 using typename SolverTemplate::scalar_type;
38 const std::shared_ptr<Logger>& logger_ = std::make_shared<Logger>())
39 :
SolverTemplate(std::make_shared<subspace::XSpace<R, Q, P>>(handlers, logger_),
40 std::static_pointer_cast<subspace::ISubspaceSolver<R, Q, P>>(
41 std::make_shared<subspace::SubspaceSolverLinEig<R, Q, P>>(logger_)),
42 handlers, std::make_shared<
Statistics>(), logger_),
68 auto m_prof = prof->push(
"itsolv::end_iteration");
69 if (
m_dspace_resetter.do_reset(this->m_stats->iterations, this->m_xspace->dimensions())) {
76 prof->start(
"end_iteration (propose_rspace)");
87 size_t end_iteration(std::vector<R>& parameters, std::vector<R>& action)
override {
91 auto wparams = std::vector<std::reference_wrapper<R>>{std::ref(parameters)};
92 auto wactions = std::vector<std::reference_wrapper<R>>{std::ref(actions)};
97 void precondition(std::vector<R>& parameters, std::vector<R>& action)
const {}
102 auto eval = std::vector<scalar_type>{};
104 eval.push_back(i < this->
m_subspace_solver->eigenvalues().size() ? this->m_subspace_solver->eigenvalues().at(i)
112 this->
m_value_errors.assign(current_values.size(), std::numeric_limits<scalar_type>::max());
113 for (
size_t i = 0; i < std::min(
m_last_values.size(), current_values.size()); i++)
119 void report(std::ostream& cout,
bool endl =
true)
const override {
121 cout <<
"errors " << std::scientific;
123 std::copy(begin(err), end(err), std::ostream_iterator<scalar_type>(cout,
", "));
125 cout <<
"eigenvalues ";
127 cout << std::fixed << std::setprecision(14);
128 std::copy(begin(ev), end(ev), std::ostream_iterator<scalar_type>(cout,
", "));
129 cout << std::defaultfloat;
150 auto xspace = std::dynamic_pointer_cast<subspace::XSpace<R, Q, P>>(this->
m_xspace);
151 xspace->set_hermiticity(hermitian);
152 auto subspace_solver = std::dynamic_pointer_cast<subspace::SubspaceSolverLinEig<R, Q, P>>(this->
m_subspace_solver);
153 subspace_solver->set_hermiticity(hermitian);
162 if (opt.reset_D_max_Q_size)
164 if (opt.max_size_qspace)
166 if (opt.min_size_qspace)
168 if (opt.contrib_thresh)
169 qspace_opts.contrib_thresh = opt.contrib_thresh.value();
179 auto opt = std::make_shared<LinearEigensystemDavidsonOptions>();
196 auto prof = this->
profiler()->push(
"itsolv::construct_residual");
197 assert(params.size() >= roots.size());
199 for (
size_t i = 0; i < roots.size(); ++i)
200 this->
m_handlers->rr().axpy(-eigvals.at(roots[i]), params.at(i), actions.at(i));
Class, containing a collection of array handlers used in IterativeSolver Provides a Builder sub-class...
Definition: ArrayHandlers.h:25
Implements IterativeSolver interface that is common to all solvers.
Definition: IterativeSolverTemplate.h:161
std::vector< int > m_working_set
indices of roots in the working set
Definition: IterativeSolverTemplate.h:676
std::shared_ptr< subspace::IXSpace< R, R, std::map< size_t, typename R::value_type > > > m_xspace
manages the subspace and associated data
Definition: IterativeSolverTemplate.h:672
std::shared_ptr< ArrayHandlers< R, R, std::map< size_t, typename R::value_type > > > m_handlers
Array handlers.
Definition: IterativeSolverTemplate.h:671
std::shared_ptr< subspace::ISubspaceSolver< R, R, std::map< size_t, typename R::value_type > > > m_subspace_solver
solves the subspace problem
Definition: IterativeSolverTemplate.h:673
std::shared_ptr< Options > get_options() const override
Definition: IterativeSolverTemplate.h:308
const std::shared_ptr< molpro::profiler::Profiler > & profiler() const override
Definition: IterativeSolverTemplate.h:394
bool m_end_iteration_needed
whether end_iteration should be called after any preconditioner
Definition: IterativeSolverTemplate.h:693
void report() const override
Writes a report to std::cout.
Definition: IterativeSolverTemplate.h:349
bool m_normalise_solution
whether to normalise the solutions
Definition: IterativeSolverTemplate.h:683
const std::vector< int > & working_set() const override
Working set of roots that are not yet converged.
Definition: IterativeSolverTemplate.h:283
std::shared_ptr< Logger > m_logger
logger
Definition: IterativeSolverTemplate.h:682
void set_options(const Options &options) override
Definition: IterativeSolverTemplate.h:293
std::vector< double > m_errors
errors from the most recent solution
Definition: IterativeSolverTemplate.h:674
std::shared_ptr< Statistics > m_stats
accumulates statistics of operations performed by the solver
Definition: IterativeSolverTemplate.h:681
std::vector< double > m_value_errors
value errors from the most recent solution
Definition: IterativeSolverTemplate.h:675
One specific implementation of LinearEigensystem using Davidson's algorithm with modifications to man...
Definition: LinearEigensystemDavidson.h:30
int get_reset_D_maxQ_size() const
Definition: LinearEigensystemDavidson.h:139
void set_min_size_qspace(std::size_t n)
Definition: LinearEigensystemDavidson.h:147
size_t end_iteration(const VecRef< R > ¶meters, const VecRef< R > &action) override
Proposes new parameters for the subspace from the preconditioned residuals.
Definition: LinearEigensystemDavidson.h:66
void set_reset_D_maxQ_size(size_t n)
Set the maximum size of Q space after resetting the D space.
Definition: LinearEigensystemDavidson.h:138
bool nonlinear() const override
Report whether the class is a non-linear solver.
Definition: LinearEigensystemDavidson.h:48
std::vector< double > m_last_values
The values from the previous iteration.
Definition: LinearEigensystemDavidson.h:205
QSpaceOptions qspace_opts
Options concerning Q-space handling.
Definition: LinearEigensystemDavidson.h:208
void set_hermiticity(bool hermitian) override
Sets hermiticity of kernel.
Definition: LinearEigensystemDavidson.h:148
std::shared_ptr< Logger > logger
Definition: LinearEigensystemDavidson.h:192
bool get_hermiticity() const override
Gets hermiticity of kernel, if true than it is hermitian, otherwise it is not.
Definition: LinearEigensystemDavidson.h:155
bool m_resetting_in_progress
whether D space resetting is in progress
Definition: LinearEigensystemDavidson.h:206
detail::DSpaceResetter< Q > m_dspace_resetter
resets D space
Definition: LinearEigensystemDavidson.h:203
std::vector< scalar_type > eigenvalues() const override
The calculated eigenvalues of the subspace matrix.
Definition: LinearEigensystemDavidson.h:99
std::size_t get_max_size_qspace() const
Definition: LinearEigensystemDavidson.h:140
size_t end_iteration(std::vector< R > ¶meters, std::vector< R > &action) override
Definition: LinearEigensystemDavidson.h:87
void precondition(std::vector< R > ¶meters, std::vector< R > &action) const
Applies the Davidson preconditioner.
Definition: LinearEigensystemDavidson.h:97
void set_value_errors() override
Implementation class should overload this to set errors in the current values (e.g....
Definition: LinearEigensystemDavidson.h:110
void set_max_size_qspace(std::size_t n)
Definition: LinearEigensystemDavidson.h:141
size_t get_reset_D() const
Definition: LinearEigensystemDavidson.h:136
std::size_t get_min_size_qspace() const
Definition: LinearEigensystemDavidson.h:146
bool m_hermiticity
whether the problem is hermitian or not
Definition: LinearEigensystemDavidson.h:204
void set_options(const Options &options) override
Definition: LinearEigensystemDavidson.h:157
void set_reset_D(size_t n)
Set the period in iterations for resetting the D space.
Definition: LinearEigensystemDavidson.h:135
void report(std::ostream &cout, bool endl=true) const override
Writes a report to cout output stream.
Definition: LinearEigensystemDavidson.h:119
RSpaceOptions rspace_opts
Options concerning R-space handling.
Definition: LinearEigensystemDavidson.h:207
void construct_residual(const std::vector< int > &roots, const CVecRef< R > ¶ms, const VecRef< R > &actions) override
Constructs residual for given roots provided their parameters and actions.
Definition: LinearEigensystemDavidson.h:195
virtual std::vector< scalar_type > working_set_eigenvalues() const override
Definition: LinearEigensystemDavidson.h:101
LinearEigensystemDavidson(const std::shared_ptr< ArrayHandlers< R, Q, P > > &handlers=std::make_shared< molpro::linalg::itsolv::ArrayHandlers< R, Q, P > >(), const std::shared_ptr< Logger > &logger_=std::make_shared< Logger >())
Definition: LinearEigensystemDavidson.h:36
std::shared_ptr< Options > get_options() const override
Definition: LinearEigensystemDavidson.h:178
size_t end_iteration(R ¶meters, R &actions) override
Definition: LinearEigensystemDavidson.h:90
Interface for a specific iterative solver, it can add special member functions or variables.
Definition: IterativeSolver.h:412
Resets D space constructing full solutions as the new working set, removing instabilities from Q spac...
Definition: DSpaceResetter.h:74
auto propose_rspace(IterativeSolver< R, Q, P > &solver, const VecRef< R > ¶meters, const VecRef< R > &residuals, subspace::IXSpace< R, Q, P > &xspace, subspace::ISubspaceSolver< R, Q, P > &subspace_solver, ArrayHandlers< R, Q, P > &handlers, Logger &logger, const RSpaceOptions &r_opts, const QSpaceOptions &q_opts, molpro::profiler::Profiler &profiler)
Proposes new parameters for the subspace from the preconditioned residuals.
Definition: propose_rspace.h:552
4-parameter interpolation of a 1-dimensional function given two points for which function values and ...
Definition: helper.h:11
auto wrap(ForwardIt begin, ForwardIt end)
Takes a begin and end iterators and returns a vector of references to each element.
Definition: wrap.h:32
std::vector< std::reference_wrapper< const A > > CVecRef
Definition: wrap.h:14
std::vector< std::reference_wrapper< A > > VecRef
Definition: wrap.h:11
void read_handler_counts(std::shared_ptr< Statistics > stats, std::shared_ptr< ArrayHandlers< R, Q, P > > handlers)
Definition: Statistics.h:30
const std::shared_ptr< const molpro::Options > options()
Get the Options object associated with iterative-solver.
Definition: linalg_options.cpp:4
static std::shared_ptr< LinearEigensystemDavidsonOptions > LinearEigensystem(const std::shared_ptr< Options > &options)
Definition: CastOptions.h:39
Access point for different options in iterative solvers.
Definition: Options.h:20
Information about performance of IterativeSolver instance.
Definition: Statistics.h:10