Docs | All | Real | Category | PDF | DataSet | Plot | Container | Misc | Aux | User

class RooBrentRootFinder : public RooAbsRootFinder

    public:

                         RooBrentRootFinder(const RooAbsFunc& function)
                         RooBrentRootFinder(const RooBrentRootFinder&)
                 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
            virtual void ShowMembers(TMemberInspector& insp, char* parent)
            virtual void Streamer(TBuffer& b)
                    void StreamerNVirtual(TBuffer& b)

Data Members

    public:

      static const enum RooBrentRootFinder:: MaxIterations  

Class Description

 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).

 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.

Inline Functions

                      void ~RooBrentRootFinder()
                   TClass* Class()
                   TClass* IsA() const
                      void ShowMembers(TMemberInspector& insp, char* parent)
                      void Streamer(TBuffer& b)
                      void StreamerNVirtual(TBuffer& b)
        RooBrentRootFinder RooBrentRootFinder(const RooBrentRootFinder&)

Page maintained by Wouter Verkerke and David Kirkby