class ROOT::Math::Roots::Brent: 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	~Brent()
ROOT::Math::Roots::Brent	Brent()
ROOT::Math::GSLRootFinder	ROOT::Math::GSLRootFinder::GSLRootFinder()
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 int	ROOT::Math::GSLRootFinder::SetFunction(const ROOT::Math::IGradFunction&, double)
virtual int	ROOT::Math::GSLRootFinder::SetFunction(const ROOT::Math::IGenFunction& f, double xlow, double xup)
int	ROOT::Math::GSLRootFinder::SetFunction(ROOT::Math::GSLRootFinder::GSLFuncPointer f, void* params, double xlow, double xup)
virtual int	ROOT::Math::GSLRootFinder::Solve(int maxIter = 100, double absTol = 1E-3, double relTol = 1E-6)

protected:

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

private:

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

Class Charts

Function documentation

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

 usually copying is non trivial, so we make this unaccessible