Steffenson method, providing the fastes convergence. 
See the GSL manual for more information 
Definition at line 147 of file RootFinderAlgorithms.h.
 | 
|   | Steffenson () | 
|   | 
|   | ~Steffenson () override | 
|   | 
|   | GSLRootFinderDeriv () | 
|   | 
|   | GSLRootFinderDeriv (const GSLRootFinderDeriv &)=delete | 
|   | 
|   | GSLRootFinderDeriv (GSLRootFinderDeriv &&)=delete | 
|   | 
|   | ~GSLRootFinderDeriv () override | 
|   | 
| int  | Iterate () override | 
|   | iterate (return GSL_SUCCESS in case of successful iteration)  
  | 
|   | 
| int  | Iterations () const override | 
|   | Return number of iterations.  
  | 
|   | 
| const char *  | Name () const override | 
|   | Return name of root finder algorithm.  
  | 
|   | 
| GSLRootFinderDeriv &  | operator= (const GSLRootFinderDeriv &)=delete | 
|   | 
| GSLRootFinderDeriv &  | operator= (GSLRootFinderDeriv &&)=delete | 
|   | 
| double  | Root () const override | 
|   | Returns the previously calculated root.  
  | 
|   | 
| bool  | SetFunction (const IGradFunction &f, double xstart) override | 
|   | 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) override | 
|   | Find the root (return false if failed)  
  | 
|   | 
| int  | Status () const override | 
|   | Return the status of last root finding.  
  | 
|   | 
|   | IRootFinderMethod () | 
|   | Default Constructor.  
  | 
|   | 
| virtual  | ~IRootFinderMethod () | 
|   | Default Destructor.  
  | 
|   |