![]() |
Object-oriented Scientific Computing Library: Version 0.910
|
One-dimensional solver [abstract base]. More...
#include <root.h>
Public Member Functions | |
virtual const char * | type () |
Return the type, "root" . | |
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. | |
virtual int | solve (double &x, func_t &func)=0 |
Solve func using x as an initial guess. | |
virtual int | solve_bkt (double &x1, double x2, func_t &func) |
Solve func in region ![]() ![]() | |
virtual int | solve_de (double &x, func_t &func, dfunc_t &df) |
Solve func using x as an initial guess using derivatives df . | |
Data Fields | |
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 routine does not "converge". | |
int | last_conv |
Zero if last call to solve(), solve_bkt(), or solve_de() converged. | |
int | last_ntrial |
The number of iterations for in the most recent minimization. |
virtual int root< func_t, dfunc_t >::print_iter | ( | double | x, |
double | y, | ||
int | iter, | ||
double | value = 0.0 , |
||
double | limit = 0.0 , |
||
std::string | comment = "" |
||
) | [inline, virtual] |
Depending on the value of the variable verbose, this prints out the iteration information. If verbose=0, then no information is printed, while if verbose>1, then after each iteration, the present values of x
and y
are output to std::cout along with the iteration number. If verbose>=2 then each iteration waits for a character before continuing.
This is particularly useful if err_nonconv is false to test if the last call to solve(), solve_bkt(), or solve_de() converged.
Documentation generated with Doxygen. Provided under the GNU Free Documentation License (see License Information).