MUQ  0.4.3
ParallelAMProposal.h
Go to the documentation of this file.
1 #ifndef PARALLELAMPROPOSAL_H_
2 #define PARALLELAMPROPOSAL_H_
3 
5 
6 namespace muq {
7  namespace SamplingAlgorithms {
8 
9  class ParallelAMProposal : public AMProposal {
10  public:
11 
12  ParallelAMProposal(boost::property_tree::ptree pt,
13  std::shared_ptr<AbstractSamplingProblem> problem);
14 
15  ParallelAMProposal(boost::property_tree::ptree pt,
16  std::shared_ptr<AbstractSamplingProblem> problem,
17  std::shared_ptr<parcer::Communicator> const& newcomm);
18 
19  virtual ~ParallelAMProposal() = default;
20 
22 
27  virtual void Adapt(unsigned int const t, std::vector<std::shared_ptr<SamplingState>> const& states) override;
28 
29  private:
30 
32  unsigned int totSamps = 0;
33  };
34  } // namespace SamplingAlgorithms
35 } // namespace muq
36 
37 #endif
An implemental of the Adaptive Metropolis algorithm.
Definition: AMProposal.h:21
unsigned int totSamps
The total number of samples used for the adaption.
ParallelAMProposal(boost::property_tree::ptree pt, std::shared_ptr< AbstractSamplingProblem > problem)
virtual void Adapt(unsigned int const t, std::vector< std::shared_ptr< SamplingState >> const &states) override
Adapt the proposal after each step.
ParallelAMProposal(boost::property_tree::ptree pt, std::shared_ptr< AbstractSamplingProblem > problem, std::shared_ptr< parcer::Communicator > const &newcomm)