One-dimensional bracketing solver [abstract base]. More...
#include <root.h>
Public Member Functions | |
virtual const char * | type () |
Return the type, "root_bkt" . | |
virtual int | solve_bkt (double &x1, double x2, func_t &func)=0 |
Solve func in region ![]() ![]() | |
virtual int | solve (double &x, func_t &func) |
Solve func using x as an initial guess. More... | |
virtual int | solve_de (double &x, func_t &func, dfunc_t &df) |
Solve func using x as an initial guess using derivatives df . | |
![]() | |
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... | |
Public Attributes | |
double | bracket_step |
The relative stepsize for automatic bracketing (default value is zero) More... | |
double | bracket_min |
The minimum stepsize for automatic bracketing (default zero) | |
size_t | bracket_iters |
The number of iterations in attempt to bracket root (default 10) | |
![]() | |
double | tol_rel |
The maximum value of the functions for success (default ![]() | |
double | tol_abs |
The minimum allowable stepsize (default ![]() | |
int | verbose |
Output control (default 0) | |
int | ntrial |
Maximum number of iterations (default 100) | |
bool | err_nonconv |
If true, call the error handler if the solver does not converge (default true) | |
int | last_ntrial |
The number of iterations used in the most recent solve. | |
|
inlinevirtual |
This has been updated to automatically bracket functions which are undefined away from the initial guess, but there are still various ways in which the bracketing algorithm can fail.
Implements o2scl::root< func_t, dfunc_t >.
double o2scl::root_bkt< func_t, dfunc_t >::bracket_step |
Documentation generated with Doxygen. Provided under the
GNU Free Documentation License (see License Information).