NCContourFinder Namespace Reference

Classes
class	NCContourFinder::Coord
class	NCContourFinder::FindMinSimple< Callable >
class	NCContourFinder::FixVars< Callable >
class	NCContourFinder::MarginalizeSimple< Callable >
class	NCContourFinder::MinuitForCallable< Callable >
class	NCContourFinder::MarginalizeHybrid< Callable >
Typedefs
typedef std::vector< double >	CoordNDim
Functions
template<class Callable>
double	FindMinMinuit (const Callable &chiSqrFunc, const std::vector< NCParameter > params, CoordNDim &ret, TMinuit **ppMinu)
template<class Callable>
std::vector< Coord >	FindContour (const Callable &func, const Coord &minCoord, const double &height, const Coord &precision)
template<class Callable>
TH2D *	GetLowResGrid (const Callable &func, const Coord min, const Coord max, const Coord prec)
template<class Callable>
TGraph *	CreateOneDimProjection (const Callable &func, const NCParameter param, const double minVal, double &leftErr, double &rightErr)
template<class Callable>
void	PrintGridSearch (const Callable &func, const std::vector< NCParameter > &params, std::ostream &out)

---

Typedef Documentation

typedef std::vector<double> NCContourFinder::CoordNDim

Definition at line 23 of file NCContourFinder.h. Referenced by NCContourFinder::MarginalizeHybrid< Callable >::AlreadyAtMinimum(), NCContourFinder::FindMinSimple< Callable >::BeginSearchPos(), NCContourFinder::MinuitForCallable< Callable >::Eval(), NCExtrapolation::FillResultHistograms(), NCExtrapolation::GetBestFitPoint(), NCExtrapolation::GetChiSqrFromDerived::operator()(), NCContourFinder::MarginalizeSimple< Callable >::operator()(), NCContourFinder::FindMinSimple< Callable >::operator()(), NCExtrapolationJK_fit::PredictSpectrum(), and PrintGridSearch().

---

Function Documentation

template<class Callable> TGraph * NCContourFinder::CreateOneDimProjection (  const Callable &  func, const NCParameter  param, const double  minVal, double &  leftErr, double &  rightErr )

Definition at line 312 of file NCContourFinder.cxx. References NCParameter::max, NCParameter::min, MSG, and NCParameter::prec. Referenced by NCExtrapolation::Get1DProjection(). { // +.5 makes us round to nearest int instead of toward zero. const int steps = int(.5+(param.max-param.min)/param.prec); vector<double> x, y; bool needLeftErr = true; bool needRightErr = true; // Initialize right error for downward sloping projections. // .5 is to be consistent with binning elsewhere. rightErr = param.max+.5*param.prec; for(int nx = 0; nx <= steps; ++nx){ x.push_back(param.min+nx*param.prec); MSG("NCContourFinder", Msg::kVerbose) << "Projection: " << nx+1 << "/" << steps << " " << x[nx] << endl; double upVal = func(Coord(x[nx], -999))-minVal; y.push_back(upVal); if(needRightErr && !needLeftErr && upVal > 1){ needRightErr = false; rightErr = x[nx]; } if(needLeftErr && upVal < 1){ needLeftErr = false; leftErr = x[nx]-param.prec; } } TGraph *ret = new TGraph(steps+1, &x[0], &y[0]); return ret; }

template<class Callable> std::vector< Coord > NCContourFinder::FindContour (  const Callable &  func, const Coord &  minCoord, const double &  height, const Coord &  precision )

Definition at line 162 of file NCContourFinder.cxx. References MSG, NCContourFinder::Coord::x, and NCContourFinder::Coord::y. Referenced by NCExtrapolation::GetContour(). { const double dx = precision.x; const double dy = precision.y; typedef pair<int, int> Box; // first == left, second == top std::map<Box, bool> results; // Is this box already in the result set? std::vector<Box> todo; // Boxes to investigate std::map<Box, double> heights; // Boxes whose topleft corner has already been evaluated, used as cache. // Top left corner of the box containing the best fit. const int bfxi = int(minCoord.x/dx); const int bfyi = int(minCoord.y/dy); MSG("NCContourFinder", Msg::kVerbose) << "Contour: walking left" << endl; // Walk to the left for(int x = bfxi; ; --x){ // As soon as we exceed the contour MSG("NCExtrapolation", Msg::kVerbose) << "Contour: at " << x << endl; if(func(Coord(x*dx, bfyi*dy)) > height){ // make it the first element in the todo list todo.push_back(Box(x, bfyi)); // and stop going left. break; } } // NB - for some reason while writing this I decided that increasing y is downward. std::vector<Coord> contour; while(!todo.empty()){ Box now = todo.back(); todo.pop_back(); // We end up evaluating the function multiple times at each point, so are // relying heavily on the cacheing done in GetChiSqrFromDerived() MSG("NCContourFinder", Msg::kVerbose) << "Contour: at " << now.first << "," << now.second << endl; // Set by the loop below. double topleft, topright, bottomleft, bottomright; // Evaluate the function at all the corners. for(int cx = 0; cx <= 1; ++cx){ for(int cy = 0; cy <=1; ++cy){ Box corner(now.first+cx, now.second+cy); const std::map<Box, double>::const_iterator it = heights.find(corner); double heightHere; if(it == heights.end()){ heightHere = func(Coord((now.first+cx)*dx, (now.second+cy)*dy)); heights[corner] = heightHere; } else{ heightHere = heights[corner]; } if(cx == 0 && cy == 0) topleft = heightHere; if(cx == 1 && cy == 0) topright = heightHere; if(cx == 0 && cy == 1) bottomleft = heightHere; if(cx == 1 && cy == 1) bottomright = heightHere; } } MSG("NCContourFinder", Msg::kVerbose) << "Contour: tl,tr,bl,br=" << topleft << " " << topright << " " << bottomleft << " " << bottomright << endl; // For each side of the box: see if one corner is high and the other low. // If so, and if the box adjacent on this side isn't already part of the // results, then append the adjacent box to the todo list and linearly // interpolate to find where to put the contour point on that edge. if( (topright-height)*(bottomright-height) <= 0){ Box right(now.first+1, now.second); if(!results[right]){ MSG("NCContourFinder", Msg::kVerbose) << "Contour: went right" << endl; todo.push_back(right); results[right] = true; contour.push_back(Coord((now.first+1)*dx, (now.second+(height-topright)/(bottomright-topright))*dy)); } } if( (topleft-height)*(bottomleft-height) <= 0){ Box left(now.first-1, now.second); if(!results[left]){ MSG("NCContourFinder", Msg::kVerbose) << "Contour: went left" << endl; todo.push_back(left); results[left] = true; contour.push_back(Coord(now.first*dx, (now.second+(height-topleft)/(bottomleft-topleft))*dy)); } } if( (bottomleft-height)*(bottomright-height) <= 0){ Box down(now.first, now.second+1); if(!results[down]){ MSG("NCContourFinder", Msg::kVerbose) << "Contour: went down" << endl; todo.push_back(down); results[down] = true; contour.push_back(Coord((now.first+(height-bottomleft)/(bottomright-bottomleft))*dx, (now.second+1)*dy)); } } if( (topleft-height)*(topright-height) <= 0 ){ Box up(now.first, now.second-1); if(!results[up]){ MSG("NCContourFinder", Msg::kVerbose) << "Contour: went up" << endl; todo.push_back(up); results[up] = true; contour.push_back(Coord((now.first+(height-topleft)/(topright-topleft))*dx, now.second*dy)); } } } if(contour.size()) contour.push_back(contour[0]); // Close the loop. return contour; }

template<class Callable> double NCContourFinder::FindMinMinuit (  const Callable &  chiSqrFunc, const std::vector< NCParameter >  params, CoordNDim &  ret, TMinuit **  minu = 0 )

Definition at line 113 of file NCContourFinder.cxx. References MSG. Referenced by NCExtrapolation::MakeDeltaChiSqrMaps(). { ret.resize(params.size()); TMinuit* minu = new MinuitForCallable<Callable>(chiSqrFunc, params.size()); minu->SetPrintLevel(-1); // Shut Minuit up. minu->Command("set strategy 2"); // Be careful, instead of fast. for(int n = 0; n < int(params.size()); ++n) // NB - no parameter limits imposed. minu->DefineParameter(n, params[n].shortName.c_str(), (params[n].min+params[n].max)/2, (params[n].max-params[n].min)/4, 0, 0); // Minuit tries to return a lot of parameters we don't want to keep. double junkd; int junki; TString junks; if(minu->Migrad()){ MSG("NCContourFinder", Msg::kWarning) << "Migrad failed, falling back to Simplex.\n"; minu->SetPrintLevel(0); // Things are going wrong, we should let the user see. minu->mnsimp(); minu->Migrad(); } double minChiSqr; minu->mnstat(minChiSqr, junkd, junkd, junki, junki, junki); for(unsigned int n = 0; n < params.size(); ++n) minu->GetParameter(n, ret[n], junkd); if(ppMinu) *ppMinu = minu; else delete minu; return minChiSqr; }

template<class Callable> TH2D * NCContourFinder::GetLowResGrid (  const Callable &  func, const Coord  min, const Coord  max, const Coord  prec )

Definition at line 283 of file NCContourFinder.cxx. References max, min, MSG, NCContourFinder::Coord::x, and NCContourFinder::Coord::y. Referenced by NCExtrapolation::Get2DGrid(). { const int Nx = int((max.x-min.x)/prec.x+.5); const int Ny = int((max.y-min.y)/prec.y+.5); TH2D* ret = new TH2D("foo", "bar", Nx, min.x, max.x, Ny, min.y, max.y); for(int nx = 0; nx < Nx ; ++nx){ for(int ny = 0; ny < Ny; ++ny){ const double x = min.x+(max.x-min.x)/double(Nx)*(nx+.5); const double y = min.y+(max.y-min.y)/double(Ny)*(ny+.5); const double f = func(Coord(x, y)); MSG("NCContourFinder", Msg::kVerbose) << "GetLowResGrid: " << nx << "," << ny << " (" << x << "," << y << ") " << "-> " << f << endl; ret->Fill(x, y, f); } } return ret; }

template<class Callable> void NCContourFinder::PrintGridSearch (  const Callable &  func, const std::vector< NCParameter > &  params, std::ostream &  out )

Definition at line 549 of file NCContourFinder.cxx. References base, CoordNDim, and min. Referenced by NCExtrapolation::MakeDeltaChiSqrMaps(). { std::vector<NCParameter> lowResParams = params; for(unsigned int n = 0; n < lowResParams.size(); ++n) lowResParams[n].prec *= 10; std::vector<CoordNDim> evalAt; CoordNDim first; for(unsigned int n = 0; n < lowResParams.size(); ++n) first.push_back(lowResParams[n].min); evalAt.push_back(first); for(unsigned int d = 0; d < lowResParams.size(); ++d){ unsigned int maxn = evalAt.size(); for(unsigned int n = 0; n < maxn; ++n){ for(unsigned int nx = 1; ; ++nx){ CoordNDim base = evalAt[n]; base[d] += lowResParams[d].prec*nx; if(base[d] > lowResParams[d].max) break; evalAt.push_back(base); } } } for(unsigned int d = 0; d < lowResParams.size(); ++d) out << lowResParams[d].shortName << "\t"; out << "chisq" << endl; for(unsigned int n = 0; n < evalAt.size(); ++n){ for(unsigned int d = 0; d < evalAt[n].size(); ++d){ out << evalAt[n][d]<<"\t"; } out << func(evalAt[n])<<endl; } }

---