class ROOT::Math::Roots::Bisection: public ROOT::Math::GSLRootFinder

        Roots::Bisection
      Bisection algorithm, simplest algorithm for bracketing the roots of a function, but slowest one.
      See the <A HREF="http://www.gnu.org/software/gsl/manual/html_node/Root-Bracketing-Algorithms.html">GSL manual</A> for more information
      @ingroup RootFinders

Function Members (Methods)

public:

virtual	~Bisection()
ROOT::Math::Roots::Bisection	Bisection()
ROOT::Math::GSLRootFinder	ROOT::Math::GSLRootFinder::GSLRootFinder()
ROOT::Math::IRootFinderMethod	ROOT::Math::IRootFinderMethod::IRootFinderMethod()
ROOT::Math::IRootFinderMethod	ROOT::Math::IRootFinderMethod::IRootFinderMethod(const ROOT::Math::IRootFinderMethod&)
virtual int	ROOT::Math::GSLRootFinder::Iterate()
virtual int	ROOT::Math::GSLRootFinder::Iterations() const
virtual const char*	ROOT::Math::GSLRootFinder::Name() const
virtual double	ROOT::Math::GSLRootFinder::Root() const
virtual bool	ROOT::Math::GSLRootFinder::SetFunction(const ROOT::Math::IGenFunction& f, double xlow, double xup)
bool	ROOT::Math::GSLRootFinder::SetFunction(ROOT::Math::GSLRootFinder::GSLFuncPointer f, void* params, double xlow, double xup)
virtual bool	ROOT::Math::GSLRootFinder::Solve(int maxIter = 100, double absTol = 1.0E-8, double relTol = 1.0E-10)
virtual int	ROOT::Math::GSLRootFinder::Status() const

protected:

void	ROOT::Math::GSLRootFinder::FreeSolver()
void	ROOT::Math::GSLRootFinder::SetSolver(ROOT::Math::GSLRootFSolver* s)

private:

ROOT::Math::Roots::Bisection	Bisection(const ROOT::Math::Roots::Bisection&)
ROOT::Math::Roots::Bisection&	operator=(const ROOT::Math::Roots::Bisection&)

Class Charts

Inheritance Inherited Members Includes Libraries

Function documentation

Bisection()

virtual ~Bisection()

Bisection(const ROOT::Math::Roots::Bisection& )

 usually copying is non trivial, so we make this unaccessible