Implement the abstract 1-dimensional root finding interface using the Brent-Decker method. This implementation is based on the one in the GNU scientific library (v0.99).
virtual | ~RooBrentRootFinder() |
static TClass* | Class() |
virtual Bool_t | findRoot(Double_t& result, Double_t xlo, Double_t xhi, Double_t value = 0) const |
virtual TClass* | IsA() const |
RooBrentRootFinder& | operator=(const RooBrentRootFinder&) |
RooBrentRootFinder(const RooAbsFunc& function) | |
RooBrentRootFinder(const RooBrentRootFinder&) | |
void | setTol(Double_t tol) |
virtual void | ShowMembers(TMemberInspector& insp) const |
virtual void | Streamer(TBuffer&) |
void | StreamerNVirtual(TBuffer& ClassDef_StreamerNVirtual_b) |
static RooBrentRootFinder::(anonymous) | MaxIterations | |
const RooAbsFunc* | RooAbsRootFinder::_function | Pointer to input function |
Double_t | _tol | |
Bool_t | RooAbsRootFinder::_valid | True if current state is valid |
Do the root finding using the Brent-Decker method. Returns a boolean status and loads 'result' with our best guess at the root if true. Prints a warning if the initial interval does not bracket a single root or if the root is not found after a fixed number of iterations.