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

Definition at line 91 of file RootFinderAlgorithms.h.

Public Member Functions
	Brent ()

	~Brent () override

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

	GSLRootFinder (const GSLRootFinder &)=delete

	GSLRootFinder (GSLRootFinder &&)=delete

	~GSLRootFinder () override

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

int	Iterations () const override
	Return number of iterations.

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

GSLRootFinder &	operator= (const GSLRootFinder &)=delete

GSLRootFinder &	operator= (GSLRootFinder &&)=delete

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

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

virtual bool	SetFunction (const ROOT::Math::IGenFunction &, double, double)
	Sets the function for the rest of the algorithms.

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

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

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

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

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

virtual	~IRootFinderMethod ()
	Default Destructor.

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)