Brent-Dekker algorithm which combines an interpolation strategy with the bisection algorithm See the GSL manual for more information.

Definition at line 104 of file RootFinderAlgorithms.h.

Public Member Functions
	Brent ()

virtual	~Brent ()

Public Member Functions inherited from ROOT::Math::GSLRootFinder
	GSLRootFinder ()

virtual	~GSLRootFinder ()

int	Iterate ()
	This method is implemented only by the GSLRootFinder and GSLRootFinderDeriv classes and will return an error if it's not one of them. More...

int	Iterations () const
	Return number of iterations. More...

const char *	Name () const
	double GSLRootFinder::XLower() const { return fXlow; } More...

double	Root () const
	Returns the previously calculated root. More...

bool	SetFunction (const IGenFunction &f, double xlow, double xup)
	Sets the function for the rest of the algorithms. More...

bool	SetFunction (GSLFuncPointer f, void *params, double xlow, double xup)

bool	Solve (int maxIter=100, double absTol=1E-8, double relTol=1E-10)
	Find the root. More...

int	Status () const
	Return the status of last root finding. More...

Public Member Functions inherited from ROOT::Math::IRootFinderMethod
	IRootFinderMethod ()
	Default Constructor. More...

virtual	~IRootFinderMethod ()
	Default Destructor. More...

virtual bool	SetFunction (const ROOT::Math::IGradFunction &, double)
	Sets the function for algorithms using derivatives. More...

Additional Inherited Members
Public Types inherited from ROOT::Math::GSLRootFinder
typedef double(*	GSLFuncPointer) (double, void *)

Protected Member Functions inherited from ROOT::Math::GSLRootFinder
void	FreeSolver ()

void	SetSolver (GSLRootFSolver *s)