A version of mroot_hybrids which uses Eigen for the QR decomposition. More...
#include <mroot_hybrids.h>
Private Member Functions | |
virtual void | qr_decomp_unpack () |
Additional Inherited Members | |
![]() | |
virtual int | set_jacobian (jacobian< func_t, vec_t, mat_t > &j) |
Set the automatic Jacobian object. | |
int | iterate () |
Perform an iteration. More... | |
void | allocate (size_t n) |
Allocate the memory. | |
virtual const char * | type () |
Return the type,"mroot_hybrids" . | |
virtual int | msolve_de (size_t nn, vec_t &xx, func_t &ufunc, jfunc_t &dfunc) |
Solve func with derivatives dfunc using x as an initial guess, returning x . More... | |
virtual int | msolve (size_t nn, vec_t &xx, func_t &ufunc) |
Solve ufunc using xx as an initial guess, returning xx . | |
int | set (size_t nn, vec_t &ax, func_t &ufunc) |
Set the function, the parameters, and the initial guess. | |
int | set_de (size_t nn, vec_t &ax, func_t &ufunc, jfunc_t &dfunc) |
Set the function, the Jacobian, the parameters, and the initial guess. | |
![]() | |
template<class vec2_t , class vec3_t > | |
int | print_iter (size_t n, const vec2_t &x, const vec3_t &y, int iter, double value=0.0, double limit=0.0, std::string comment="") |
Print out iteration information. More... | |
![]() | |
bool | shrink_step |
If true, iterate() will shrink the step-size automatically if the function returns a non-zero value (default true) More... | |
bool | extra_finite_check |
If true, double check that the input function values are finite (default true) | |
bool | int_scaling |
If true, use the internal scaling method (default true) | |
jacobian_gsl< func_t, vec_t, mat_t > | def_jac |
Default automatic Jacobian object. | |
vec_t | f |
The value of the function at the present iteration. More... | |
vec_t | x |
The present solution. | |
![]() | |
double | tol_rel |
The maximum value of the functions for success (default 1.0e-8) | |
double | tol_abs |
The minimum allowable stepsize (default 1.0e-12) | |
int | verbose |
Output control (default 0) | |
int | ntrial |
Maximum number of iterations (default 100) | |
int | last_ntrial |
The number of iterations for in the most recent minimization. | |
bool | err_nonconv |
If true, call the error handler if msolve() or msolve_de() does not converge (default true) | |
![]() | |
virtual int | solve_set (size_t nn, vec_t &xx, func_t &ufunc) |
Finish the solution after set() or set_de() has been called. | |
![]() | |
int | iter |
Number of iterations. | |
size_t | ncfail |
Compute the number of failures. | |
size_t | ncsuc |
Compute the number of successes. | |
size_t | nslow1 |
The number of times the actual reduction is less than 0.001. | |
size_t | nslow2 |
The number of times the actual reduction is less than 0.1. | |
double | fnorm |
The norm of the current function value. | |
double | delta |
The limit of the Nuclidean norm. | |
mat_t | J |
Jacobian. | |
mat_t | q |
Q matrix from QR decomposition. | |
mat_t | r |
R matrix from QR decomposition. | |
ubvector | diag |
The diagonal elements. | |
ubvector | qtf |
The value of ![]() | |
ubvector | newton |
The Newton direction. | |
ubvector | gradient |
The gradient direction. | |
ubvector | df |
The change in the function value. | |
ubvector | qtdf |
The value of ![]() | |
ubvector | rdx |
The value of ![]() | |
ubvector | w |
The value of ![]() | |
ubvector | v |
The value of ![]() | |
jfunc_t * | jac |
The user-specified Jacobian. | |
jacobian< func_t, vec_t, mat_t > * | ajac |
The automatic Jacobian. | |
vec_t | dx |
The value of the derivative. | |
vec_t | x_trial |
Trial root. | |
vec_t | f_trial |
Trial function value. | |
size_t | dim |
The number of equations and unknowns. | |
bool | jac_given |
True if the jacobian has been given. | |
func_t * | fnewp |
The user-specified function. | |
bool | set_called |
True if "set" has been called. | |
Definition at line 1144 of file mroot_hybrids.h.
Documentation generated with Doxygen. Provided under the
GNU Free Documentation License (see License Information).