Data Types List

Here are the data types with brief descriptions:

[detail level 12]

▼Mnonlin_core	nonlin_core
Cequation_optimizer	A base class for optimization of an equation of multiple variables
Cequation_solver	A base class for various solvers of nonlinear systems of equations
Cequation_solver_1var	A base class for various solvers of equations of one variable
Cfcn1var	Describes a function of one variable
Cfcn1var_helper	Defines a type capable of encapsulating an equation of one variable of the form: f(x) = 0
Cfcnnvar	Describes a function of N variables
Cfcnnvar_helper	Defines a type capable of encapsulating an equation of N variables
Cgradientfcn	Describes a routine capable of computing the gradient vector of an equation of N variables
Citeration_behavior	Defines a set of parameters that describe the behavior of the iteration process
Cjacobianfcn	Describes a routine capable of computing the Jacobian matrix of M functions of N unknowns
Cnonlin_optimize_fcn	Describes the interface of a routine for optimizing an equation of N variables
Cnonlin_solver	Describes the interface of a nonlinear equation solver
Cnonlin_solver_1var	Describes the interface of a solver for an equation of one variable
Cvalue_pair	Defines a pair of numeric values
Cvecfcn	Describes an M-element vector-valued function of N-variables
Cvecfcn_helper	Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0. This type is used to establish the system of equations to solve, and provides a means for computing the Jacobian matrix for the system of equations, and any other ancillary operations that may be needed by the solver
▼Mnonlin_least_squares	nonlin_least_squares
Cleast_squares_solver	Defines a Levenberg-Marquardt based solver for unconstrained least-squares problems
▼Mnonlin_linesearch	nonlin_linesearch
Cline_search	Defines a type capable of performing an inexact, backtracking line search to find a point as far along the specified direction vector that is usable for unconstrained minimization problems
▼Mnonlin_optimize	nonlin_optimize
Cbfgs	Defines a Broyden–Fletcher–Goldfarb–Shanno (BFGS) solver for minimization of functions of multiple variables
Cline_search_optimizer	A class describing equation optimizers that use a line search algorithm to improve convergence behavior
Cnelder_mead	Defines a solver based upon Nelder and Mead's simplex algorithm for minimization of functions of multiple variables
▼Mnonlin_polynomials	polynomials
Cassignment(=)	Defines polynomial assignment
Coperator(*)	Defines polynomial multiplication
Coperator(+)	Defines polynomial addition
Coperator(-)	Defines polynomial subtraction
Cpolynomial	Defines a polynomial, and associated routines for performing polynomial operations
▼Mnonlin_solve	nonlin_solve
Cbrent_solver	Defines a solver based upon Brent's method for solving an equation of one variable without using derivatives
Cline_search_solver	A class describing nonlinear solvers that use a line search algorithm to improve convergence behavior
Cnewton_1var_solver	Defines a solver based upon Newtons's method for solving an equation of one variable. The algorithm uses a bisection method in conjunction with Newton's method in order to keep bounds upon the Newton iterations
Cnewton_solver	Defines a Newton solver
Cquasi_newton_solver	Defines a quasi-Newton type solver based upon Broyden's method