Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
#include <function_binsearch.h>
Public Member Functions | |
T | root (Function< T > *f, T left, T right, T precision) |
T | convex_min (ConvexFunction< T > *f, T left, T right, T precision) |
Private Member Functions | |
int | number_of_iterations (T left, T right, T precision, double division) |
T math::binsearch::FunctionBinsearch< T >::convex_min | ( | ConvexFunction< T > * | f, |
T | left, | ||
T | right, | ||
T | precision | ||
) | [inline] |
Finds a minimum value of convex function on given interval [left, right)
left | left end of the interval |
right | right end of the interval |
precision | required precision |
int math::binsearch::FunctionBinsearch< T >::number_of_iterations | ( | T | left, |
T | right, | ||
T | precision, | ||
double | division | ||
) | [inline, private] |
Calculate the number of iterations needed to obtain specified precision if original range is [left, right) and each iteration the range is reduced to 1/division of its size.
T math::binsearch::FunctionBinsearch< T >::root | ( | Function< T > * | f, |
T | left, | ||
T | right, | ||
T | precision | ||
) | [inline] |
Finds any root of function on interval [left, right) with specified precision