One-dimensional bracketing minimization [abstract base].
More...
#include <min.h>
template<class func_t, class dfunc_t = func_t>
class o2scl::min_bkt_base< func_t, dfunc_t >
Definition at line 229 of file min.h.
|
| virtual int | min (double &x, double &fmin, func_t &func) |
| | Calculate the minimum min of func w.r.t 'x'. More...
|
| |
| virtual int | min_bkt (double &x2, double x1, double x3, double &fmin, func_t &func)=0 |
| | Calculate the minimum min of func with x2 bracketed between x1 and x3. More...
|
| |
| virtual int | min_de (double &x, double &fmin, func_t &func, dfunc_t &df) |
| | Calculate the minimum min of func with derivative dfunc w.r.t 'x'. More...
|
| |
|
virtual const char * | type () |
| | Return string denoting type ("min_bkt")
|
| |
| virtual int | print_iter (double x, double y, int iter, double value=0.0, double limit=0.0, std::string comment="") |
| | Print out iteration information. More...
|
| |
| virtual int | min_de (double &x, double &fmin, func_t &func, func_t &df)=0 |
| | Calculate the minimum min of func with derivative dfunc w.r.t 'x'. More...
|
| |
| virtual int | bracket (double &ax, double &bx, double &cx, double &fa, double &fb, double &fc, func_t &func) |
| | Given interval (ax,bx), attempt to bracket a minimum for function func. More...
|
| |
|
|
int | bracket_iter |
| | The number of iterations for automatically bracketing a minimum (default 20)
|
| |
|
int | verbose |
| | Output control.
|
| |
|
int | ntrial |
| | Maximum number of iterations.
|
| |
|
double | tol_rel |
| | The tolerance for the minimum function value.
|
| |
|
double | tol_abs |
| | The tolerance for the location of the minimum.
|
| |
|
int | last_ntrial |
| | The number of iterations used in the most recent minimization.
|
| |
|
int | bracket_iter |
| | The number of iterations for automatically bracketing a minimum (default 20)
|
| |
|
bool | err_nonconv |
| | If true, call the error handler if the routine does not "converge".
|
| |
◆ min()
template<class func_t , class dfunc_t = func_t>
| virtual int o2scl::min_bkt_base< func_t, dfunc_t >::min |
( |
double & |
x, |
|
|
double & |
fmin, |
|
|
func_t & |
func |
|
) |
| |
|
inlinevirtual |
◆ min_bkt()
template<class func_t , class dfunc_t = func_t>
| virtual int o2scl::min_bkt_base< func_t, dfunc_t >::min_bkt |
( |
double & |
x2, |
|
|
double |
x1, |
|
|
double |
x3, |
|
|
double & |
fmin, |
|
|
func_t & |
func |
|
) |
| |
|
pure virtual |
◆ min_de()
template<class func_t , class dfunc_t = func_t>
| virtual int o2scl::min_bkt_base< func_t, dfunc_t >::min_de |
( |
double & |
x, |
|
|
double & |
fmin, |
|
|
func_t & |
func, |
|
|
dfunc_t & |
df |
|
) |
| |
|
inlinevirtual |
If this is not overloaded, it attempts to bracket the minimum using bracket() and then calls min_bkt_de() with the newly bracketed minimum.
Definition at line 276 of file min.h.
The documentation for this class was generated from the following file:
- /home/awsteiner/wcs/o2scl/src/min/min.h