BIE Overview Quick Start Theoretical overview Available methods Parallel chains Computation engine Command Line Interface Graphical User Interface Assigning Output Visualization tool Data handling Software technology Parallel debugging Results to date Recent developments Links User guide Future features Project goals Project Team Copyright and license

/home/weinberg/src/BIE/include/SubsampleConverge.h // This is really -*- C++ -*- #ifndef SubsampleConverge_h #define SubsampleConverge_h #include <mpi.h> #include <deque> #include <Ensemble.h> #include <Converge.h> #include "Serializable.h" namespace BIE { //+ CLICLASS SubsampleConverge SUPER Converge class SubsampleConverge : public Converge { private: int count; int next; int max; int nburn; Ensemble* _dist; string _id; // For notational convenience typedef vector<double> dvec; // Double-ended queue of vectors for parameters deque<State> data; // Double-ended queue for posterior probability deque<double> prob; public: static int Nint; static int Ngrp; static int nconsec; static unsigned ngood; static unsigned nstart; static double alpha; static double rtol; static bool scale; static bool verbose; static double tiny; //+ CLICONSTR int Ensemble* string SubsampleConverge(int m, Ensemble* d, string id); virtual SubsampleConverge* New(int m, Ensemble* d, string id); virtual bool Converged(); //+ CLIMETHOD void setNburn int void setNburn(int n) { nstart = n; } //+ CLIMETHOD void setConsec int void setConsec(int n) { nconsec = n; } //+ CLIMETHOD void setNgood int void setNgood(int n) { ngood = n; nburn = -1; next = count + (int)sqrt(static_cast<float>(max)); } int ConvergedIndex() { return nburn; } //+ CLIMETHOD int BurnIn int BurnIn() { MPI_Bcast(&nburn, 1, MPI_INT, 0, MPI_COMM_WORLD); return nburn; } //+ CLIMETHOD void setRcovTol double void setRcovTol(double r) { rtol = r; } virtual bool AccumData(double value, State& state); virtual bool GetLast(double& value, State& state) { if (prob.size()>0) { value = prob.back(); state = data.back(); return true; } else { return false; } } void ComputeDistribution() { _dist->ComputeDistribution(); } double PDF(State& x) {return _dist->PDF(x);} double logPDF(State& x) {return _dist->logPDF(x);} vector<double> lower(void) {return _dist->lower();} vector<double> upper(void) {return _dist->upper();} vector<double> Mean() {return _dist->Mean();} vector<double> StdDev() {return _dist->StdDev();} vector<double> Moments(int m) {return _dist->Moments(m);} vector<double> Sample() {return _dist->Sample();} SubsampleConverge* New() { SubsampleConverge *p = new SubsampleConverge(max, _dist, _id); return p; } // AUTO GENERATED BY ../persistence/autopersist.py protected: SubsampleConverge() {} private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { this->pre_serialize(ar, version); try { ar & BOOST_SERIALIZATION_BASE_OBJECT_NVP(Converge); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(count); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(next); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(max); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(nburn); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(_dist); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(_id); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(data); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(prob); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(Nint); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(Ngrp); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(nconsec); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(ngood); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(nstart); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(alpha); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(rtol); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(scale); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(verbose); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(tiny); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } this->post_serialize(ar, version); } }; } BIE_CLASS_TYPE_INFO(BIE::SubsampleConverge) BIE_CLASS_EXPORT_KEY(BIE::SubsampleConverge) #endif