+
class ROOT::Math::RootFinder<ROOT::Math::Roots::Brent>
-
library: libMathMore
#include "RootFinder.h"
Display options:
Show inherited
Show non-public

class ROOT::Math::RootFinder<ROOT::Math::Roots::Brent>

Function Members (Methods)

public:
virtual~RootFinder<ROOT::Math::Roots::Brent>()
intIterate()
intIterations() const
const char*Name() const
doubleRoot() const
ROOT::Math::RootFinder<ROOT::Math::Roots::Brent>RootFinder<ROOT::Math::Roots::Brent>()
voidSetFunction(const ROOT::Math::IGradFunction& f, double Root)
voidSetFunction(const ROOT::Math::IGenFunction& f, double xlow, double xup)
intSolve(int maxIter = 100, double absTol = 1E-3, double relTol = 1E-6)
static intTestDelta(double r1, double r0, double epsAbs, double epsRel)
static intTestInterval(double xlow, double xup, double epsAbs, double epsRel)
static intTestResidual(double f, double epsAbs)
private:
ROOT::Math::RootFinder<ROOT::Math::Roots::Brent>&operator=(const ROOT::Math::RootFinder<ROOT::Math::Roots::Brent>& rhs)
ROOT::Math::RootFinder<ROOT::Math::Roots::Brent>RootFinder<ROOT::Math::Roots::Brent>(const ROOT::Math::RootFinder<ROOT::Math::Roots::Brent>&)

Data Members

private:
ROOT::Math::Roots::BrentfSolvertype of algorithm to be used

Class Charts

Inheritance Inherited Members Includes Libraries
Class Charts

Function documentation

void SetFunction(const ROOT::Math::IGenFunction& f, double xlow, double xup)
Provide to the solver the function and the initial search interval [xlow, xup]
for algorithms not using derivatives (bracketing algorithms)
The templated function f must be of a type implementing the \a operator() method,
<em>  double  operator() (  double  x ) </em>

fSolver. SetFunction(const ROOT::Math::IGenFunction& f, double xlow, double xup)
int Solve(int maxIter = 100, double absTol = 1E-3, double relTol = 1E-6)
Compute the roots iterating until the estimate of the Root is within the required tolerance returning
the iteration Status

int Iterations()
Return the number of iteration performed to find the Root.

int Iterate()
Perform a single iteration and return the Status

double Root()
Return the current and latest estimate of the Root

const char * Name()
Return the current and latest estimate of the lower value of the Root-finding interval (for bracketing algorithms)

double XLower() const {
return fSolver.XLower();
}

Return the current and latest estimate of the upper value of the Root-finding interval (for bracketing algorithms)

double XUpper() const {
return  fSolver.XUpper();
}

Get Name of the Root-finding solver algorithm

int TestInterval(double xlow, double xup, double epsAbs, double epsRel)
Test convertgence Status of current iteration using interval values (for bracketing algorithms)

int TestDelta(double r1, double r0, double epsAbs, double epsRel)
Test convergence Status of current iteration using last Root estimates (for algorithms using function derivatives)

int TestResidual(double f, double epsAbs)
Test function residual


Last update: Mon Jun 25 19:40:17 2007

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.