ROOT   Reference Guide
ROOT::Minuit2::MnLineSearch Class Reference

Implements a 1-dimensional minimization along a given direction (i.e.

quadratic interpolation) It is independent of the algorithm that generates the direction vector. It brackets the 1-dimensional Minimum and iterates to approach the real Minimum of the n-dimensional 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>

## ◆ MnLineSearch()

 ROOT::Minuit2::MnLineSearch::MnLineSearch ( )
inline

Definition at line 51 of file MnLineSearch.h.

## ◆ ~MnLineSearch()

 ROOT::Minuit2::MnLineSearch::~MnLineSearch ( )
inline

Definition at line 53 of file MnLineSearch.h.

## ◆ operator()()

 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 non-zero) is df/dx along step at st. Return a parabola point containing Minimum x position and y (function Value)

• add a falg to control the debug

Definition at line 49 of file MnLineSearch.cxx.

The documentation for this class was generated from the following files: