NC::Fitter Namespace Reference

Classes
class	NC::Fitter::ConstrainRange
	This class supports the function flipping in MinFinderSimple. More...
class	NC::Fitter::Discretizer
class	NC::Fitter::Penalizer
class	NC::Fitter::PenalizerInt
class	NC::Fitter::FuncCache
class	NC::Fitter::FuncCacheInt
class	NC::Fitter::MinFinderSimple
class	NC::Fitter::MinFinderSimpleInt
class	NC::Fitter::FixVars
	Effectively reduce the number of arguments taken by fun. More...
class	NC::Fitter::FixVarsInt
	Effectively reduce the number of arguments taken by fun. More...
class	NC::Fitter::MarginalizeSimple
	Minimize callable f with respect to all its arguments except xcoord and (optionally) ycoord. More...
class	NC::Fitter::MarginalizeSimpleInt
	Minimize callable f with respect to all its arguments except xcoord and (optionally) ycoord. More...
class	NC::Fitter::MinuitForCallable
class	NC::Fitter::MarginalizeHybrid
class	NC::Fitter::CoordBase< T >
	Base class for coordinate types. More...
struct	NC::Fitter::Coord
	A simple two-dimensional coordinate. More...
class	NC::Fitter::ICallableND
	Interface to a general function in many dimensions. More...
class	NC::Fitter::ICallableInt
	Interface to a function on integers in many dimensions. More...
class	NC::Fitter::ICallable2D
	Interface to a function on two-dimensional coordinates. More...
Typedefs
typedef CoordBase< double >	CoordNDim
	An N-dimensional coordinate CoordBase.
typedef CoordBase< int >	CoordInt
	An N-dimensional coordinate in integer space CoordBase.
Functions
CoordNDim	ConvertCoord (const CoordInt &c, std::vector< NCParameter > ps)
CoordNDim	ConvertContourCoord (const CoordNDim &c, vector< NCParameter > ps)
	This final one is intended to be used on the output of FindContourInt.
ostream &	operator<< (ostream &os, const FuncCache &c)
ostream &	operator<< (ostream &os, const FuncCacheInt &c)
double	MinFinderMinuit (const ICallableND *chiSqrFunc, const std::vector< NCParameter > params, CoordNDim &ret, TMinuit **ppMinu)
std::vector< Coord >	FindContour (const ICallable2D *func, const Coord &minCoord, const double height, const Coord &precision, std::vector< TGraph > *marg_graphs)
	Find contour of height height in the function func.
TMatrix	FindCovarianceMatrix (const ICallableND *func, const CoordNDim &minCoord, const std::vector< NCParameter > params)
bool	Interpolate (double val1, double val2, double target, double &ret)
std::vector< CoordNDim >	FindContourInt (const ICallableInt *func_org, const CoordInt &minCoord, const double height, std::vector< TGraph > *marg_graphs)
	Find contour of height height in the function func.
TH2D *	GetLowResGrid (const ICallable2D *func, const Coord min, const Coord max, const Coord prec)
TH2D *	GridSearchInt (const ICallableInt *func, const CoordInt min, const CoordInt max)
TH2D *	ConvertGrid (const TH2D *intgrid, const NCParameter &xp, const NCParameter &yp)
TGraph *	CreateOneDimProjection (const ICallable2D *func, const NCParameter param, const double minVal, double &leftErr, double &rightErr, std::vector< TGraph > &marg_graphs)
TGraph	CreateOneDimProjectionInt (const ICallableInt *func, int minstep, int maxstep, double &leftErr, double &rightErr)
vector< TGraph >	MakeSlices (const ICallableND *func, const vector< NCParameter > &ps, const CoordNDim &minpos)
vector< TH2D * >	Make2DSlices (const ICallableND *func, const vector< NCParameter > &ps, const CoordNDim &minpos)
void	PrintGridSearch (const ICallableND *func, const std::vector< NCParameter > &params, std::ostream &out)
ostream &	operator<< (ostream &os, const CoordNDim &c)
ostream &	operator<< (ostream &os, const CoordInt &c)

---

Typedef Documentation

typedef CoordBase<int> NC::Fitter::CoordInt

An N-dimensional coordinate in integer space CoordBase. Definition at line 53 of file NCFitterTypes.h. Referenced by NC::Fitter::MinFinderSimpleInt::BeginScale(), NC::Fitter::MinFinderSimpleInt::BeginSearchPos(), ConvertCoord(), CreateOneDimProjectionInt(), NC::Fitter::ICallableInt::EvalAt(), NC::Fitter::FixVarsInt::EvalAt(), NC::Fitter::PenalizerInt::EvalAt(), NC::Fitter::Discretizer::EvalAt(), NC::Fitter::ICallableInt::EvalAtEx(), NC::Fitter::MarginalizeSimpleInt::EvalAtEx(), NC::Fitter::FuncCacheInt::EvalAtEx(), FindContourInt(), NC::Fitter::MinFinderSimpleInt::FindMin(), NC::Fitter::FixVarsInt::FixVarsInt(), GridSearchInt(), NC::Fitter::MarginalizeSimpleInt::MarginalizeSimpleInt(), operator<<(), and NC::Fitter::FixVarsInt::SetFixed().

typedef CoordBase<double> NC::Fitter::CoordNDim

An N-dimensional coordinate CoordBase. Definition at line 51 of file NCFitterTypes.h. Referenced by NC::Fitter::MarginalizeHybrid::AlreadyAtMinimum(), NC::Fitter::MinFinderSimple::BeginSearchPos(), NC::CoordinateConverter::ChooseValue(), ConvertContourCoord(), ConvertCoord(), NC::CoordinateConverter::CoordNDimFromOscPars(), CreateOneDimProjection(), NC::Fitter::MinuitForCallable::Eval(), NC::Fitter::MarginalizeHybrid::EvalAtEx(), NC::Fitter::MarginalizeSimple::EvalAtEx(), NC::Fitter::ConstrainRange::EvalAtEx(), NC::Fitter::FixVars::EvalAtEx(), NC::Fitter::FuncCache::EvalAtEx(), NC::Fitter::Penalizer::EvalAtEx(), NC::GetChiSqrFromDerived::EvalAtEx(), FindContour(), FindContourInt(), FindCovarianceMatrix(), NC::Fitter::MinFinderSimple::FindMin(), NC::Fitter::MinFinderSimple::FindMinPartitions(), NC::Fitter::FixVars::FixVars(), NCExtrapolation::GetBestFitCoordNDim(), GetLowResGrid(), Make2DSlices(), MakeSlices(), NC::Fitter::MarginalizeSimple::MarginalizeSimple(), MinFinderMinuit(), operator<<(), PrintGridSearch(), NC::FitMaster::SetBestFitCoordNDim(), NCExtrapolation::SetBestFitCoordNDim(), and NC::Fitter::FixVars::SetFixed().

---

Function Documentation

CoordNDim ConvertContourCoord (  const CoordNDim &  c, vector< NCParameter >  ps )

This final one is intended to be used on the output of FindContourInt. Definition at line 63 of file NCFitter.cxx. References CoordNDim. { assert(c.size() == ps.size()); CoordNDim ret(c.size()); for(unsigned int n = 0; n < c.size(); ++n) ret[n] = ps[n].ValFromStep(c[n]); return ret; }

CoordNDim NC::Fitter::ConvertCoord (  const CoordInt &  c, std::vector< NCParameter >  ps )

Definition at line 51 of file NCFitter.cxx. References CoordInt, and CoordNDim. Referenced by NC::Fitter::Discretizer::EvalAt(). { assert(c.size() == ps.size()); CoordNDim ret(c.size()); for(unsigned int n = 0; n < c.size(); ++n) ret[n] = ps[n].ValFromStep(c[n]); return ret; }

TH2D * NC::Fitter::ConvertGrid (  const TH2D *  intgrid, const NCParameter &  xp, const NCParameter &  yp )

Definition at line 1063 of file NCFitter.cxx. References NCParameter::LatexName(), and NCParameter::ValFromStep(). { const int nx = intgrid->GetNbinsX(); const int ny = intgrid->GetNbinsY(); double* xb = new double[nx+1]; double* yb = new double[ny+1]; for(int x = 0; x <= nx; ++x) xb[x] = xp.ValFromStep(x); for(int y = 0; y <= ny; ++y) yb[y] = yp.ValFromStep(y); TH2D* ret = new TH2D("", TString::Format(";%s;%s;", xp.LatexName().c_str(), yp.LatexName().c_str()).Data(), nx, xb, ny, yb); delete[] xb; delete[] yb; for(int x = 0; x <= nx; ++x) for(int y = 0; y <= ny; ++y) ret->SetBinContent(x, y, intgrid->GetBinContent(x, y)); return ret; }

TGraph * NC::Fitter::CreateOneDimProjection (  const ICallable2D *  func, const NCParameter  param, const double  minVal, double &  leftErr, double &  rightErr, std::vector< TGraph > &  marg_graphs )

Definition at line 1093 of file NCFitter.cxx. References CoordNDim, NC::Fitter::ICallable2D::EvalAtEx(), NCParameter::Max(), NCParameter::Min(), MSG, NCParameter::Precision(), NC::Utility::ReportProgress(), and NCParameter::ShortName(). { // +.5 makes us round to nearest int instead of toward zero. assert(param.Precision()); const int steps = int(.5+(param.Max()-param.Min())/param.Precision()); assert(steps); vector<double> x, y; TStopwatch sw; // starts automatically double minproj = 1e10; for(int nx = 0; nx <= steps; ++nx){ const double xhere = param.Min()+nx*param.Precision(); ReportProgress(double(nx)/steps, sw); CoordNDim bestfit; double upVal = func->EvalAtEx(Coord(xhere, -999), bestfit); x.push_back(xhere); y.push_back(upVal); std::stringstream op; op << "CreateOneDimProjection: " << param.ShortName() << " = " << xhere << " chisq = " << upVal << " other variables: "; for(unsigned int n = 0; n < bestfit.size(); ++n) op << " " << bestfit[n]; op << endl; MSG("NCFitter", Msg::kVerbose) << op.str(); if(upVal < minproj) minproj = upVal; for(unsigned int n = 0; n < bestfit.size(); ++n){ // If it's our first time through we need to create the graphs too. // if(nx == 0) marg_graphs.push_back(TGraph()); // TODO Something is broken with the marg graphs, but I'm too lazy // to fix it, so for now just do this. if(marg_graphs.size() == n) marg_graphs.push_back(TGraph()); marg_graphs[n].Set(marg_graphs[n].GetN()+1); marg_graphs[n].SetPoint(marg_graphs[n].GetN()-1, xhere, bestfit[n]); } } MSG("NCFitter", Msg::kInfo) << "CreateOneDimProjection: " << "min chisq = " << minproj << " cf minimizer's " << minVal << endl; #if 0 cout << "Beginning backtrack test...\n"; for(int nx = steps; nx >= 0; --nx){ const double xhere = param.Min()+nx*param.Precision(); CoordNDim bestfit; double upVal = func->EvalAt(Coord(xhere, -999), bestfit); // x.push_back(xhere); // y.push_back(upVal); const double diff = upVal - y[nx]; if(diff < -1e-4){ cout << "WARNING - GOT BETTER RESULT TRACKING BACKWARD, FIXING\n"; y[nx] = upVal; } if(upVal < minproj) minproj = upVal; /* for(unsigned int n = 0; n < bestfit.size(); ++n){ // If it's our first time through we need to create the graphs too. if(nx == 0) marg_graphs.push_back(TGraph()); marg_graphs[n].Set(marg_graphs[n].GetN()+1); marg_graphs[n].SetPoint(marg_graphs[n].GetN()-1, xhere, bestfit[n]); } */ } #endif 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.Precision(); for(int nx = 0; nx <= steps; ++nx){ y[nx] -= minproj; const double upVal = y[nx]; if(needRightErr && !needLeftErr && upVal > 1){ needRightErr = false; rightErr = x[nx]; } if(needLeftErr && upVal < 1){ needLeftErr = false; leftErr = x[nx]-param.Precision(); } } TGraph* ret = new TGraph(steps+1, &x[0], &y[0]); return ret; }

TGraph NC::Fitter::CreateOneDimProjectionInt (  const ICallableInt *  func, int  minstep, int  maxstep, double &  leftErr, double &  rightErr )

Definition at line 1203 of file NCFitter.cxx. References CoordInt, NC::Fitter::ICallableInt::EvalAt(), MSG, and NC::Utility::ReportProgress(). { vector<double> xs, ys; TStopwatch sw; // starts automatically double minproj = 1e10; for(int x = minstep; x <= maxstep; ++x){ ReportProgress(double(x-minstep)/(maxstep-minstep), sw); // CoordInt bestfit; CoordInt pos; pos.push_back(x); const double upVal = func->EvalAt(pos);//, bestfit); xs.push_back(x); ys.push_back(upVal); if(upVal < minproj) minproj = upVal; /* for(unsigned int n = 0; n < bestfit.size(); ++n){ // If it's our first time through we need to create the graphs too. if(nx == 0) marg_graphs.push_back(TGraph()); marg_graphs[n].Set(marg_graphs[n].GetN()+1); marg_graphs[n].SetPoint(marg_graphs[n].GetN()-1, xhere, bestfit[n]); } */ } MSG("NCFitter", Msg::kInfo) << "CreateOneDimProjection: " << "min chisq = " << minproj << endl; bool needLeftErr = true; bool needRightErr = true; // Find the intersections using a linear interpolation for(int x = 0; x <= maxstep-minstep; ++x){ ys[x] -= minproj; const double upVal = ys[x]; if(needRightErr && !needLeftErr && upVal > 1){ needRightErr = false; // rightErr = minstep+x; rightErr = (minstep+x-1)+(1-ys[x-1])/(ys[x]-ys[x-1]); } if(needLeftErr && upVal < 1){ needLeftErr = false; // leftErr = minstep+x; if(x == 0) leftErr = minstep; else leftErr = (minstep+x-1)+(1-ys[x-1])/(ys[x]-ys[x-1]); } } if(needRightErr) rightErr = maxstep; TGraph ret(maxstep-minstep, &xs[0], &ys[0]); return ret; }

std::vector< Coord > NC::Fitter::FindContour (  const ICallable2D *  func, const Coord &  minCoord, const double  height, const Coord &  precision, std::vector< TGraph > *  marg_graphs = 0 )

Find contour of height height in the function func. Search will be to precision precision. You must pass the previously located minimum of the function in minCoord. The contour must be continuous, finite and closed. Definition at line 658 of file NCFitter.cxx. References CoordNDim, NC::Fitter::ICallable2D::EvalAtEx(), MSG, NC::Utility::ReportProgress(), NC::Fitter::Coord::x, and NC::Fitter::Coord::y. { assert(!marg_graphs || marg_graphs->empty()); const double dx = precision.x; const double dy = precision.y; assert(dx > 0); assert(dy > 0); 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 // Boxes whose topleft corner has already been evaluated, used as cache. std::map<Box, double> heights; // 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("NCFitter", Msg::kVerbose) << "Contour: walking left" << endl; // Walk to the left for(int x = bfxi; ; --x){ // As soon as we exceed the contour MSG("NCFitter", Msg::kVerbose) << "Contour: at " << x << endl; CoordNDim bestfit; if(func->EvalAtEx(Coord(x*dx, bfyi*dy), bestfit) > height){ // Create enough graphs to save our marginalisation progress //(2 extra to save the two variables actually in the contour) if(marg_graphs) for(unsigned int n = 0; n < 4*bestfit.size(); ++n) marg_graphs->push_back(TGraph()); // 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; TStopwatch sw; // starts automatically int gxi = -1; // position on the x axis of the marg graphs. while(!todo.empty()){ Box now = todo.back(); todo.pop_back(); ++gxi; // We end up evaluating the function multiple times at each point, so are // relying heavily on the cacheing done in GetChiSqrFromDerived() MSG("NCFitter", 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()){ CoordNDim bestfit; heightHere = func->EvalAtEx(Coord((now.first+cx)*dx, (now.second+cy)*dy), bestfit); /* TODO - hacked out marg graphs because they are broken somehow. FIX! if(marg_graphs){ const int dn = cx+2*cy; for(unsigned int n = 0; n < bestfit.size(); ++n){ marg_graphs->at(4*n+dn).SetPoint(marg_graphs->at(4*n+dn). GetN(), gxi, bestfit[n]); } } */ 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("NCFitter", Msg::kVerbose) << "Contour: tl,tr,bl,br=" << topleft << " " << topright << " " << bottomleft << " " << bottomright << endl; if(now.first-bfxi){ const double est_frac = (M_PI+atan2(now.second-bfyi-.01, double(now.first-bfxi)))/(2*M_PI); ReportProgress(est_frac, sw); } // 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("NCFitter", Msg::kVerbose) << "Contour: went right" << endl; todo.push_back(right); results[right] = true; const double rightdiff = (bottomright-topright) ? bottomright-topright : 1; contour.push_back(Coord((now.first+1)*dx, (now.second+(height-topright)/rightdiff)*dy)); } } if( (topleft-height)*(bottomleft-height) <= 0){ Box left(now.first-1, now.second); if(!results[left]){ MSG("NCFitter", Msg::kVerbose) << "Contour: went left" << endl; todo.push_back(left); results[left] = true; const double leftdiff = (bottomleft-topleft) ? bottomleft-topleft : 1; contour.push_back(Coord(now.first*dx, (now.second+(height-topleft)/leftdiff)*dy)); } } if( (bottomleft-height)*(bottomright-height) <= 0){ Box down(now.first, now.second+1); if(!results[down]){ MSG("NCFitter", Msg::kVerbose) << "Contour: went down" << endl; todo.push_back(down); results[down] = true; const double bottomdiff = (bottomright-bottomleft) ? bottomright-bottomleft : 1; contour.push_back(Coord((now.first+ (height-bottomleft)/(bottomdiff))*dx, (now.second+1)*dy)); } } if( (topleft-height)*(topright-height) <= 0 ){ Box up(now.first, now.second-1); if(!results[up]){ MSG("NCFitter", Msg::kVerbose) << "Contour: went up" << endl; todo.push_back(up); results[up] = true; const double topdiff = (topright-topleft) ? topright-topleft : 1; contour.push_back(Coord((now.first+(height-topleft)/topdiff)*dx, now.second*dy)); } } } ReportProgress(1, sw); if(contour.size()) contour.push_back(contour[0]); // Close the loop. return contour; }

std::vector< CoordNDim > NC::Fitter::FindContourInt (  const ICallableInt *  func, const CoordInt &  minCoord, const double  height, std::vector< TGraph > *  marg_graphs = 0 )

Find contour of height height in the function func. Search will be to precision precision. You must pass the previously located minimum of the function in minCoord. The contour must be continuous, finite and closed. Definition at line 899 of file NCFitter.cxx. References abs(), CoordInt, CoordNDim, NC::Fitter::FuncCacheInt::EvalAtEx(), Interpolate(), MSG, NC::Utility::ReportProgress(), NC::Fitter::CoordBase< T >::x(), and NC::Fitter::CoordBase< T >::y(). { assert(!marg_graphs || marg_graphs->empty()); assert(minCoord.size() == 2); // Put a cache in front of ourselves FuncCacheInt* func = new FuncCacheInt(func_org); std::map<CoordInt, bool> results; // Is this box already in the result set? std::vector<CoordInt> todo; // Boxes to investigate MSG("NCFitter", Msg::kVerbose) << "Contour: walking left" << endl; // Walk to the left for(int x = minCoord.x(); ; --x){ // As soon as we exceed the contour MSG("NCFitter", Msg::kVerbose) << "Contour: at " << x << endl; CoordInt evalAt(x, minCoord.y()); CoordInt bestfit; if(func->EvalAtEx(evalAt, &bestfit) > height){ // Create enough graphs to save our marginalisation progress //(2 extra to save the two variables actually in the contour) if(marg_graphs) for(unsigned int n = 0; n < 2+bestfit.size(); ++n) marg_graphs->push_back(TGraph()); // make it the first element in the todo list todo.push_back(evalAt); // and stop going left. break; } } std::vector<CoordNDim> contour; TStopwatch sw; // starts automatically while(!todo.empty()){ CoordInt now = todo.back(); todo.pop_back(); MSG("NCFitter", Msg::kVerbose) << "Contour: at " << now << endl; const double est_frac = (M_PI+ atan2(-double(now.y()-minCoord.y()-.01), double(now.x()-minCoord.x())))/(2*M_PI); ReportProgress(est_frac, sw); // 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. for(int dx = -1; dx <= 1; ++dx){ for(int dy = -1; dy <= 1; ++dy){ // no diagonals, don't stay stationary if(abs(dx+dy) != 1) continue; // where we're trying to go const CoordInt newpos(now.x()+dx, now.y()+dy); // offset to the first corner of the box we're considering const int cx = int(dx > 0); const int cy = int(dy > 0); // vector to the second corner we're considering const int ix = abs(dy); const int iy = abs(dx); // The values at said corners. Reevaluating them is fine, // because 'func' is cached. CoordInt bf1, bf2; const double h1 = func->EvalAtEx(CoordInt(now.x()+cx, now.y()+cy), &bf1); const double h2 = func->EvalAtEx(CoordInt(now.x()+cx+ix, now.y()+cy+iy), &bf2); double interp; if(!results[newpos] && Interpolate(h1, h2, height, interp)){ todo.push_back(newpos); results[newpos] = true; contour.push_back(CoordNDim(now.x()+cx+ix*interp, now.y()+cy+iy*interp)); if(marg_graphs){ marg_graphs->at(0).SetPoint(marg_graphs->at(0).GetN(), marg_graphs->at(0).GetN(), now.x()); marg_graphs->at(1).SetPoint(marg_graphs->at(1).GetN(), marg_graphs->at(1).GetN(), now.y()); for(unsigned int n = 0; n < bf1.size(); ++n){ const double bf = bf1[n]+interp*(bf2[n]-bf1[n]); marg_graphs->at(2+n).SetPoint(marg_graphs->at(2+n).GetN(), marg_graphs->at(2+n).GetN(), bf); } } // end if marg_graphs } } // end for dy } // end for dx } // end while todo if(!contour.empty()) contour.push_back(contour[0]); // Close the loop. delete func; // our cache return contour; }

TMatrix NC::Fitter::FindCovarianceMatrix (  const ICallableND *  func, const CoordNDim &  minCoord, const std::vector< NCParameter >  params )

Definition at line 836 of file NCFitter.cxx. References CoordNDim, and NC::Fitter::ICallableND::EvalAtEx(). Referenced by NC::FitMaster::Run(). { assert(params.size() == minCoord.size()); TMatrix ret(params.size(), params.size()); CoordNDim junk; const double bestFitVal = func->EvalAtEx(minCoord, &junk); // First, do the 2nd derivatives in one variable for(unsigned int i = 0; i < params.size(); ++i){ const double step = params[i].Precision(); CoordNDim plus = minCoord; plus[i] += step; CoordNDim minus = minCoord; minus[i] -= step; const double dii = (func->EvalAtEx(plus, &junk)+ func->EvalAtEx(minus, &junk)- 2*bestFitVal)/(step*step); ret(i, i) = dii; } // Now do all the off-diagonal derivatives for(unsigned int i = 0; i < params.size()-1; ++i){ for(unsigned int j = i+1; j < params.size(); ++j){ const double di = params[i].Precision(); const double dj = params[j].Precision(); CoordNDim pp = minCoord; pp[i] += di; pp[j] += dj; CoordNDim pi = minCoord; pi[i] += di; CoordNDim pj = minCoord; pj[j] += dj; const double dij = (func->EvalAtEx(pp, &junk)+bestFitVal- func->EvalAtEx(pi, &junk)- func->EvalAtEx(pj, &junk))/(di*dj); ret(i, j) = dij; ret(j, i) = dij; } } ret.Invert(); return ret; }

TH2D * NC::Fitter::GetLowResGrid (  const ICallable2D *  func, const Coord  min, const Coord  max, const Coord  prec )

Definition at line 1011 of file NCFitter.cxx. References CoordNDim, NC::Fitter::ICallable2D::EvalAtEx(), max, min, MSG, NC::Fitter::Coord::x, and NC::Fitter::Coord::y. { 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); CoordNDim bestfit; const double f = func->EvalAtEx(Coord(x, y), bestfit); MSG("NCFitter", Msg::kVerbose) << "GetLowResGrid: " << nx << "," << ny << " (" << x << "," << y << ") " << "-> " << f << endl; ret->Fill(x, y, f); } } return ret; }

TH2D * NC::Fitter::GridSearchInt (  const ICallableInt *  func, const CoordInt  min, const CoordInt  max )

Definition at line 1039 of file NCFitter.cxx. References CoordInt, NC::Fitter::ICallableInt::EvalAt(), max, min, NC::Utility::ReportProgress(), NC::Fitter::CoordBase< T >::x(), and NC::Fitter::CoordBase< T >::y(). { assert(min.size() == 2 && max.size() == 2); TStopwatch sw; TH2D* ret = new TH2D("", "", max.x()-min.x(), min.x(), max.x(), max.y()-min.y(), min.y(), max.y()); for(int ny = min.y(); ny < max.y(); ++ny){ for(int nx = min.x(); nx < max.x() ; ++nx){ const double f = func->EvalAt(CoordInt(nx, ny)); ret->Fill(nx, ny, f); } ReportProgress(double(ny)/(max.y()-min.y()), sw); } return ret; }

bool Interpolate (  double  val1, double  val2, double  target, double &  ret )

Definition at line 885 of file NCFitter.cxx. Referenced by FindContourInt(). { if( (val1-target)*(val2-target) > 0) return false; const double diff = (val2-val1) ? val2-val1 : 1; ret = (target-val1)/diff; return true; }

vector<TH2D*> Make2DSlices (  const ICallableND *  func, const vector< NCParameter > &  ps, const CoordNDim &  minpos )

Definition at line 1317 of file NCFitter.cxx. References CoordNDim, NC::Fitter::ICallableND::EvalAtEx(), NCParameter::LatexName(), NCParameter::Max(), NCParameter::Min(), NCParameter::Precision(), NC::Utility::ReportProgress(), and NCParameter::ShortName(). Referenced by NC::FitMaster::Run(). { vector<TH2D*> ret; for(unsigned int p = 0; p < ps.size(); ++p){ for(unsigned int q = 0; q < p; ++q){ // +.5 makes us round to nearest int instead of toward zero. assert(ps[p].Precision()); assert(ps[q].Precision()); NCParameter px=ps[p]; NCParameter py=ps[q]; const int Nx = int((px.Max()-px.Min())/px.Precision()+.5); const int Ny = int((py.Max()-py.Min())/py.Precision()+.5); TH2D* h = new TH2D("foo", "bar", Nx, px.Min(), px.Max(), Ny, py.Min(), py.Max()); h->SetName(TString::Format("2dslice_%s_%s", px.ShortName().c_str(), py.ShortName().c_str() )); h->GetXaxis()->SetTitle(px.LatexName().c_str()); h->GetYaxis()->SetTitle(py.LatexName().c_str()); TStopwatch sw; // starts automatically for(int nx = 1; nx <= Nx; ++nx){ ReportProgress(double(nx)/Nx, sw); const double xhere = px.Min()+nx*px.Precision(); for(int ny = 1; ny <= Ny; ++ny){ const double yhere = py.Min()+ny*py.Precision(); CoordNDim evalAt = minpos; evalAt[p] = xhere; evalAt[q] = yhere; CoordNDim junk; h->SetBinContent(nx, ny, func->EvalAtEx(evalAt, &junk)); } // end for ny } // end for nx ret.push_back(h); } } return ret; }

vector<TGraph> MakeSlices (  const ICallableND *  func, const vector< NCParameter > &  ps, const CoordNDim &  minpos )

Definition at line 1272 of file NCFitter.cxx. References CoordNDim, NC::Fitter::ICallableND::EvalAtEx(), MSG, and NC::Utility::ReportProgress(). Referenced by NC::FitMaster::Run(). { vector<TGraph> ret; for(unsigned int p = 0; p < ps.size(); ++p){ MSG("NCFitter", Msg::kInfo) << "Taking slice in " << ps[p].ShortName() << "..." << endl; // +.5 makes us round to nearest int instead of toward zero. assert(ps[p].Precision()); const int steps = int(.5+(ps[p].Max()-ps[p].Min())/ps[p].Precision()); assert(steps); vector<double> x, y; TStopwatch sw; // starts automatically for(int nx = 0; nx <= steps; ++nx){ const double xhere = ps[p].Min()+nx*ps[p].Precision(); ReportProgress(double(nx)/steps, sw); CoordNDim evalAt = minpos; evalAt[p] = xhere; CoordNDim junk; double upVal = func->EvalAtEx(evalAt, &junk); x.push_back(xhere); y.push_back(upVal); } // end for nx MSG("NCFitter", Msg::kInfo) << endl; TGraph g = TGraph(steps+1, &x[0], &y[0]); g.SetName(TString::Format("slice_%s", ps[p].ShortName().c_str())); g.SetTitle(TString::Format("Slice;%s;#chi^{2}", ps[p].LatexName().c_str())); ret.push_back(g); } return ret; }

double NC::Fitter::MinFinderMinuit (  const ICallableND *  chiSqrFunc, const std::vector< NCParameter >  params, CoordNDim &  ret, TMinuit **  minu = 0 )

Definition at line 606 of file NCFitter.cxx. References CoordNDim, and MSG. Referenced by NC::FitMaster::Run(). { ret.resize(params.size()); TMinuit* minu = new MinuitForCallable(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("NCFitter", Msg::kWarning) << "Migrad failed, " << "falling back to Simplex.\n"; // Things are going wrong, we should let the user see. minu->SetPrintLevel(0); 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; }

ostream& operator<< (  ostream &  os, const CoordInt &  c )

Definition at line 39 of file NCFitterTypes.cxx. References CoordInt, and NC::Fitter::CoordBase< T >::Print(). { return c.Print(os); }

ostream& operator<< (  ostream &  os, const CoordNDim &  c )

Definition at line 33 of file NCFitterTypes.cxx. References CoordNDim, and NC::Fitter::CoordBase< T >::Print(). { return c.Print(os); }

ostream & NC::Fitter::operator<< (  ostream &  os, const FuncCacheInt &  c )

Definition at line 197 of file NCFitter.cxx. References NC::Fitter::FuncCacheInt::fFunc, NC::Fitter::FuncCacheInt::fNhit, and NC::Fitter::FuncCacheInt::fNmiss. { os << "FuncCacheInt for callable at " << c.fFunc << " with " << c.fNhit+c.fNmiss << " calls " << "of which " << c.fNhit << " hit and " << c.fNmiss << " missed." << endl; return os; }

ostream & NC::Fitter::operator<< (  ostream &  os, const FuncCache &  c )

Definition at line 162 of file NCFitter.cxx. References NC::Fitter::FuncCache::fFunc, NC::Fitter::FuncCache::fNhit, and NC::Fitter::FuncCache::fNmiss. { os << "FuncCache for callable at " << c.fFunc << " with " << c.fNhit+c.fNmiss << " calls " << "of which " << c.fNhit << " hit and " << c.fNmiss << " missed." << endl; return os; }

void NC::Fitter::PrintGridSearch (  const ICallableND *  func, const std::vector< NCParameter > &  params, std::ostream &  out )

Definition at line 1657 of file NCFitter.cxx. References base, CoordNDim, and NC::Fitter::ICallableND::EvalAtEx(). Referenced by NC::FitMaster::Run(). { std::vector<NCParameter> lowResParams = params; for(unsigned int n = 0; n < lowResParams.size(); ++n) lowResParams[n].SetPrecision(lowResParams[n].Precision()*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].Precision()*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"; } CoordNDim junk; out << func->EvalAtEx(evalAt[n], &junk) << endl; } }

---