ROOT 6.08/07 Reference Guide 
Implements a 1dimensional minimization along a given direction (i.e.
quadratic interpolation) It is independent of the algorithm that generates the direction vector. It brackets the 1dimensional Minimum and iterates to approach the real Minimum of the ndimensional function.
Definition at line 47 of file MnLineSearch.h.
Public Member Functions  
MnLineSearch ()  
~MnLineSearch ()  
MnParabolaPoint  operator() (const MnFcn &, const MinimumParameters &, const MnAlgebraicVector &, double, const MnMachinePrecision &, bool debug=false) const 
Perform a line search from position defined by the vector st along the direction step, where the length of vector step gives the expected position of Minimum. More...  
#include <Minuit2/MnLineSearch.h>

inline 
Definition at line 51 of file MnLineSearch.h.

inline 
Definition at line 53 of file MnLineSearch.h.
MnParabolaPoint ROOT::Minuit2::MnLineSearch::operator()  (  const MnFcn &  fcn, 
const MinimumParameters &  st,  
const MnAlgebraicVector &  step,  
double  gdel,  
const MnMachinePrecision &  prec,  
bool  debug = false 

)  const 
Perform a line search from position defined by the vector st along the direction step, where the length of vector step gives the expected position of Minimum.
fcn is Value of function at the starting position , gdel (if nonzero) is df/dx along step at st. Return a parabola point containing Minimum x position and y (function Value)
Definition at line 49 of file MnLineSearch.cxx.