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/QuadTreeIntegrator.h // This is really -*- C++ -*- #ifndef QuadTreeIntegrator_h #define QuadTreeIntegrator_h #include <math.h> #include <vector> namespace BIE { class QuadTreeIntegrator { public: typedef vector<double>(*Integrand)(double, double); typedef pair<double, QuadTreeIntegrator*> FrontierNode; // Global variables struct RootVars { QuadTreeIntegrator *root; vector<FrontierNode> frontier; vector<double> value; vector<double> error; }; QuadTreeIntegrator(double a0, double a1, double b0, double b1, int dim, Integrand func, double eps, int minlevel, int maxlevel); ~QuadTreeIntegrator(); vector<double> Integral(); vector<double> AbsError() { return root->error; } double MaxAbsError() { return max_error(root->error); } double MaxRelError() { return max_rel_error(); } vector<double> RelError() { vector<double> ret = root->error; for (unsigned i=0; i<ret.size(); i++) ret[i] /= fabs(root->value[i]) + 1.0e-18; return ret; } int NumEvals() { return numevals; } int MaxLevel() { return maxcurlevel; } void PrintFrontier(ostream& out); private: double a[2]; // Min interval double b[2]; // Max interval double eps; // tolerance QuadTreeIntegrator* parent; QuadTreeIntegrator** child; int dim; // Dimension of integrand Integrand eval; // Integrand function static int numevals; // Number of evals (for diagnostic purposes) int minlevel; // Minimum number of decents int maxlevel; // Maximum number of decents int level; // Current level static int maxcurlevel; // Maximum level currently in tree vector<double> value; vector<double> error; QuadTreeIntegrator(QuadTreeIntegrator* parent, int which, RootVars* root); // Compute value and error, update frontier void compute(); // Update master values // Add current value and error estimate to // total void add_to_master(vector<double> val, vector<double> err); // Remove this node's value and error from // total void sub_from_master(vector<double> val, vector<double> err); // Maximum error at this node double max_error(vector<double> err); // Maximum relative error double max_rel_error(void); // Master data struct RootVars *root; }; } #endif