44 Double_t absTolerance )
45 : fRootMin( rootMin ),
47 fMaxIter( maxIterations ),
48 fAbsTol ( absTolerance ),
49 fLogger ( new MsgLogger("RootFinder") )
51 fGetRootVal = rootVal;
68 Double_t fa = (*fGetRootVal)(
a ) - refValue;
69 Double_t fb = (*fGetRootVal)( b ) - refValue;
71 Log() <<
kWARNING <<
"<Root> initial interval w/o root: "
72 <<
"(a=" << a <<
", b=" << b <<
"),"
73 <<
" (Eff_a=" << (*fGetRootVal)(
a )
74 <<
", Eff_b=" << (*fGetRootVal)( b ) <<
"), "
75 <<
"(fa=" << fa <<
", fb=" << fb <<
"), "
76 <<
"refValue = " << refValue <<
Endl;
84 if ((fb < 0 && fc < 0) || (fb > 0 && fc > 0)) {
95 fa = fb; fb =
fc; fc = fa;
109 if (ac_equal) { p = 2 * m * s; q = 1 - s; }
111 q = fa /
fc; r = fb /
fc;
112 p = s * (2 * m * q * (q -
r) - (b - a) * (r - 1));
113 q = (q - 1) * (r - 1) * (s - 1);
121 if (2 * p < (min1 < min2 ? min1 : min2)) {
125 else {
d =
m; e =
m; }
131 else b += (m > 0 ? +tol : -
tol);
133 fb = (*fGetRootVal)( b ) - refValue;
138 Log() <<
kWARNING <<
"<Root> maximum iterations (" << fMaxIter
139 <<
") reached before convergence" <<
Endl;
MsgLogger & Endl(MsgLogger &ml)
static struct mg_connection * fc(struct mg_context *ctx)
std::map< std::string, std::string >::const_iterator iter
Double_t Root(Double_t refValue)
Root finding using Brents algorithm; taken from CERNLIB function RZERO.
ClassImp(TMVA::RootFinder) TMVA
constructor
virtual ~RootFinder(void)
destructor