Base class for GSL Root-Finding algorithms for one dimensional functions which do not use function derivatives.
For finding the roots users should not use this class directly but instantiate the template
ROOT::Math::RootFinder class with the corresponding algorithms.
For example the ROOT::Math::RootFinder<ROOT::Math::Roots::Brent> for using the Brent algorithm. See that class also
for the documentation.
See the GSL <A HREF="http://www.gnu.org/software/gsl/manual/html_node/Root-Bracketing-Algorithms.html"> online manual</A> for
information on the GSL Root-Finding algorithms
@ingroup RootFinders
| virtual | ~GSLRootFinder() |
| ROOT::Math::GSLRootFinder | GSLRootFinder() |
| virtual int | Iterate() |
| virtual int | Iterations() const |
| virtual const char* | Name() const |
| virtual double | Root() const |
| virtual int | SetFunction(const ROOT::Math::IGradFunction&, double) |
| virtual int | SetFunction(const ROOT::Math::IGenFunction& f, double xlow, double xup) |
| int | SetFunction(ROOT::Math::GSLRootFinder::GSLFuncPointer f, void* params, double xlow, double xup) |
| virtual int | Solve(int maxIter = 100, double absTol = 1E-3, double relTol = 1E-6) |
| void | FreeSolver() |
| void | SetSolver(ROOT::Math::GSLRootFSolver* s) |
| ROOT::Math::GSLRootFinder | GSLRootFinder(const ROOT::Math::GSLRootFinder&) |
| ROOT::Math::GSLRootFinder& | operator=(const ROOT::Math::GSLRootFinder&) |
usually copying is non trivial, so we make this unaccessible