class ROOT::Math::RootFinder


RootFinder

Root finding using Brents algorithm
(translated from CERNLIB function RZERO)

Function Members (Methods)

public:

virtual	~RootFinder()
int	Iterate()
int	Iterations() const
const char*	Name() const
double	Root() const
ROOT::Math::RootFinder	RootFinder(ROOT::Math::RootFinder::EType type = RootFinder::kBRENT)
bool	SetFunction(const ROOT::Math::IGradFunction& f, double xstart)
bool	SetFunction(const ROOT::Math::IGenFunction& f, double xlow, double xup)
bool	SetMethod(ROOT::Math::RootFinder::EType type = RootFinder::kBRENT)
bool	Solve(int maxIter = 100, double absTol = 1.0E-8, double relTol = 1.0E-10)
bool	Solve<int, double>(int& f, double& d, double start, int maxIter = 100, double absTol = 1.0E-8, double relTol = 1.0E-10)
bool	Solve<int>(int& f, double min, double max, int maxIter = 100, double absTol = 1.0E-8, double relTol = 1.0E-10)
int	Status() const

private:

ROOT::Math::RootFinder&	operator=(const ROOT::Math::RootFinder& rhs)
ROOT::Math::RootFinder	RootFinder(const ROOT::Math::RootFinder&)

public:

static ROOT::Math::RootFinder::EType	kBRENT
static ROOT::Math::RootFinder::EType	kGSL_BISECTION
static ROOT::Math::RootFinder::EType	kGSL_BRENT
static ROOT::Math::RootFinder::EType	kGSL_FALSE_POS
static ROOT::Math::RootFinder::EType	kGSL_NEWTON
static ROOT::Math::RootFinder::EType	kGSL_SECANT
static ROOT::Math::RootFinder::EType	kGSL_STEFFENSON

private:

ROOT::Math::IRootFinderMethod*	fSolver	type of algorithm to be used

Inheritance Chart:

ROOT::Math::RootFinder

RootFinder( MethodBase *method, Double_t rootMin, Double_t rootMax, Int_t maxIterations = 100, Double_t absTolerance = 0.0 )

 returns the root of the function