Steffenson method, providing the fastes convergence.
See the GSL manual for more information
Definition at line 178 of file RootFinderAlgorithms.h.
|
| Steffenson () |
|
virtual | ~Steffenson () |
|
| GSLRootFinderDeriv () |
|
virtual | ~GSLRootFinderDeriv () |
|
int | Iterate () |
| iterate (return GSL_SUCCESS in case of successful iteration)
|
|
int | Iterations () const |
| Return number of iterations.
|
|
const char * | Name () const |
| Return name of root finder algorithm.
|
|
double | Root () const |
| Returns the previously calculated root.
|
|
bool | SetFunction (const IGradFunction &f, double xstart) |
| Sets the function for algorithms using derivatives.
|
|
virtual bool | SetFunction (const ROOT::Math::IGenFunction &, double, double) |
| Sets the function for the rest of the algorithms.
|
|
virtual bool | SetFunction (const ROOT::Math::IGradFunction &, double) |
| Sets the function for algorithms using derivatives.
|
|
bool | SetFunction (GSLFuncPointer f, GSLFuncPointer df, GSLFdFPointer fdf, void *p, double Root) |
|
bool | Solve (int maxIter=100, double absTol=1E-8, double relTol=1E-10) |
| Find the root (return false if failed)
|
|
int | Status () const |
| Return the status of last root finding.
|
|
| IRootFinderMethod () |
| Default Constructor.
|
|
virtual | ~IRootFinderMethod () |
| Default Destructor.
|
|