Keywords - Function Groups - @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

nummath

CPCFGalg
CPCFGalg implements the FG-Algorithm which finds a common orthogonal transformation matrix in order to simultaneously diagonalize several positive definite symmetric matrices.
mcint
plain Monte Carlo integration, computes an integral and its standard error (deviation) based on randomly distributed points with uniform distribution
nmBFGS
Broyden-Fletcher-Goldfarb-Shanno method to find a minimum of a given function.
nmBHHH
Berndt-Hall-Hall-Hausman method to find a minimum of a given negative log-likelihood function (and maximum of the corresponding likelihood function).
nmbisect
bisection method for finding a root of a given function in a given interval
nmbracket
This quantlet brackets a minimum of a given scalar function
nmbrackin
searches for zero crossings of a given scalar function in n equally spaced subintervals of a given interval
nmbrackout
brackets a root of a given scalar function by expanding the range
nmbrent
Brent's method for the minimization of a given scalar function
nmbrentder
Brent's method for the minimization of a given scalar function using derivatives
nmbrentroot
Brent's method for finding a root of a given function in a given interval
nmcongrad
conjugate gradient method for finding the minimum of a given function
nmexpandmat
expands the input matrix by zeros in places corresponding to fixed parameters
nmfder1d
Computes the derivative of a function restricted to a line: (f(t))' = d(func(x0 + t*direc)) / dt
nmfunc1d
restricts func to a line: f(t) = func(x0 + t*direc)
nmGJelim
Gauss-Jordan elimination with full pivoting
nmgolden
Golden section search for the minimum of a given scalar function
nmgraddiff
Computes the gradient of a function func at a point x0 using the symmetric difference with a step h: graddiff(f,x,h) = [f(x+h) - f(x-h) / (2*h)]
nmgraditer
Computes the gradient of a function func at a point x0 using Ridders' method of polynomial extrapolation
nmhessian
computes the hessian matrix of a function func at a point x0 using the difference with a step h: d_(xy) f(x,y) = [f(x+h,y+h) - f(x+h,y-h) - f(x-h,y+h) + f(x-h,y-h)] / (4*h^2)
nmjacobian
Computes the jacobian of function(s) func (or more generally, the matrix of gradients) at a point x0
nmlinmin
Finds a minimum of func along the direction "direc" from x0 (does not use derivatives of func)
nmlinminappr
finds a minimum of a function along the direction "direc" from x0 (does not use derivatives of func)
nmlinminder
Finds a minimum of func along the direction "direc" from x0 (using derivatives of func)
nmlinprog
simplex method for linear programming problem in normal form
nmlinprogexchange
auxiliary quantlet for nmlinprog; exchange of a left-hand and a right-hand variable
nmlinprogmaxel
auxiliary quantlet for nmlinprog; determines maximum of coeffiecients in a given row and listed columns
nmlinprogpivot
auxiliary quantlet for nmlinprog; finds a pivot element in a given column
nmmin
Nelder-Mead simplex method to find minimum of a given function.
nmnewton
Newton-Raphson method for solving system func(x)=0
nmnewtonmod
modified Newton-Raphson method for solving system func(x)=0 with backtracking (guarantees to decrease value of func in every iteration); compared with original Newton-Raphson method, it is less problematic to deal with highly oscillating functions
nmparabint
Inverse parabolic interpolation: finds the point x that is minimum/maximum of a parabola through three points (a,fa), (b,fb), (c,fc). INF is returned, if the three points are linear dependent (i.e. lying on the same line).
nmpolrootlaguer
implements Laguerre's method for improving a given complex value until it converges to a root of a given polynomial
nmqpenalty
auxiliary quantlet for constrained minimization using nmsimpen. Computes a penalized function value: P(x,delta) = f(x) + delta*sum((constr(x))^2)
nmregfalsi
regula falsi (false position) method for finding a root of a given function in a given interval
nmridders
Ridders' method (regula falsi modification) for finding a root of a given function in a given interval
nmsecant
secant method for finding a root of a given function in a given interval
nmsimpen
constrained optimization using simple penalty function
nummathmain
main routine of nummath library

Keywords - Function Groups - @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

(C) MD*TECH Method and Data Technologies, 05.02.2006Impressum