class ROOT::Math::Roots::FalsePos: 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~FalsePos()
ROOT::Math::Roots::FalsePosFalsePos()
ROOT::Math::GSLRootFinderROOT::Math::GSLRootFinder::GSLRootFinder()
intROOT::Math::GSLRootFinder::Iterate()
intROOT::Math::GSLRootFinder::Iterations() const
const char*ROOT::Math::GSLRootFinder::Name() const
doubleROOT::Math::GSLRootFinder::Root() const
intROOT::Math::GSLRootFinder::SetFunction(const ROOT::Math::IGradFunction&, double)
intROOT::Math::GSLRootFinder::SetFunction(const ROOT::Math::IGenFunction& f, double xlow, double xup)
intROOT::Math::GSLRootFinder::SetFunction(ROOT::Math::GSLRootFinder::GSLFuncPointer f, void* params, double xlow, double xup)
intROOT::Math::GSLRootFinder::Solve(int maxIter = 100, double absTol = 1E-3, double relTol = 1E-6)
protected:
voidROOT::Math::GSLRootFinder::FreeSolver()
voidROOT::Math::GSLRootFinder::SetSolver(ROOT::Math::GSLRootFSolver* s)
private:
ROOT::Math::Roots::FalsePosFalsePos(const ROOT::Math::Roots::FalsePos&)
ROOT::Math::Roots::FalsePos&operator=(const ROOT::Math::Roots::FalsePos&)

Class Charts

Inheritance Inherited Members Includes Libraries
Class Charts

Function documentation

FalsePos(const ROOT::Math::Roots::FalsePos& )
virtual ~FalsePos()
FalsePos(const ROOT::Math::Roots::FalsePos& )
 usually copying is non trivial, so we make this unaccessible

Author: L. Moneta, A. Zsenei 08/2005
Last update: root/mathmore:$Id: RootFinderAlgorithms.h 21553 2007-12-21 10:55:46Z moneta $
Copyright (c) 2004 ROOT Foundation, CERN/PH-SFT *

This page has been automatically generated. If you have any comments or suggestions about the page layout send a mail to ROOT support, or contact the developers with any questions or problems regarding ROOT.