class ROOT::Math::Roots::Newton: public ROOT::Math::GSLRootFinderDeriv


        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	~Newton()
ROOT::Math::GSLRootFinderDeriv	ROOT::Math::GSLRootFinderDeriv::GSLRootFinderDeriv()
ROOT::Math::IRootFinderMethod	ROOT::Math::IRootFinderMethod::IRootFinderMethod()
ROOT::Math::IRootFinderMethod	ROOT::Math::IRootFinderMethod::IRootFinderMethod(const ROOT::Math::IRootFinderMethod&)
virtual int	ROOT::Math::GSLRootFinderDeriv::Iterate()
virtual int	ROOT::Math::GSLRootFinderDeriv::Iterations() const
virtual const char*	ROOT::Math::GSLRootFinderDeriv::Name() const
ROOT::Math::Roots::Newton	Newton()
virtual double	ROOT::Math::GSLRootFinderDeriv::Root() const
virtual bool	ROOT::Math::GSLRootFinderDeriv::SetFunction(const ROOT::Math::IGradFunction& f, double xstart)
bool	ROOT::Math::GSLRootFinderDeriv::SetFunction(ROOT::Math::GSLRootFinderDeriv::GSLFuncPointer f, ROOT::Math::GSLRootFinderDeriv::GSLFuncPointer df, ROOT::Math::GSLRootFinderDeriv::GSLFdFPointer fdf, void* p, double Root)
virtual bool	ROOT::Math::GSLRootFinderDeriv::Solve(int maxIter = 100, double absTol = 1.0E-8, double relTol = 1.0E-10)
virtual int	ROOT::Math::GSLRootFinderDeriv::Status() const

protected:

void	ROOT::Math::GSLRootFinderDeriv::FreeSolver()
void	ROOT::Math::GSLRootFinderDeriv::SetSolver(ROOT::Math::GSLRootFdFSolver* s)

private:

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

Class Charts

Inheritance Inherited Members Includes Libraries

Function documentation

Newton()

virtual ~Newton()

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

 usually copying is non trivial, so we make this unaccessible