It's a function that finds the minimum value of a two variables objective function with a deterministic zero order algorithm: simplex method.
The input variables are: -fun: inline function of the objective function -init_point: initial point for the simplex method -step_size: initial dimension of the simplex toll: tolerance for the stop criterion on the simplex dimension -numMaxIter: stop criterion on...
This program tests an input matrix to see if it is a Euclidean distance matrix to within a user-specified tolerance. If not, it reports why and returns the closest EDM in the sense of Schoenberg.
ToleranceFactor computes the exact tolerance factor k for the two-sided (optionally also for the one-sided) p-content and gamma-confidence tolerance interval TI = [Xmean - k * S, Xmean + k * S], where Xmean = mean(X), S = std(X), X =...
COPL = ISCOPLANAR(X,Y,Z,TOLERANCE) takes input arguments x,y, and z as column vectors; TOLERANCE is optional.
COPL = ISCOPLANAR(x) takes an n x 3 input argument in the form [x1 y1 z1;x2 y2 z2;...;xn yn zn] The optional...
UNIQUETOL Unique element within a tolerance.
[Y,I,J] = UNIQUETOL(X,TOL) is very similar to UNIQUE, but allows an additional tolerance input, TOL. TOL can be taken as the total absolute difference between similar elements. TOL must be a...
The function (written entirely in MATLAB) allows the selection of connected pixels whose colors are within a defined tolerance of reference pixels.
The Ohua project consists of a data stream processing engine and a fault tolerance framework that uses innovative Checkpoint/Restart techniques to recover from failures.
Simple Fault Tolerance Library For Java
Generic "approximately equal" function for any object type, with customisable error tolerance.
When called with float arguments, approx_equal(x, y[, tol[, rel]) compares x and y numerically, and returns True if y is within...
The code implements the algorithm as given in Chen et. al 1991.It takes max tolerance from the user.It selects Ms significant regressors from the total M regressors. Unfortunately, the error obtained after training the RBF network isn't as...
You can solve non-linear systems of 3 variables. Only write "newtonv1" on the command window. Then write the 3 equations, the number of iterations y the precision tolerance. The partial derivatives for the gradients are calculated by the...
Since the eccentric anomaly cannot be directly calculated from certain given values, this function performs a simple Newton-Raphson iteration to solve for the eccentric anomaly within a given tolerance (default 10^-8 radians)
Calculate minimum of single variable function using 3-point search Usage: estimated_min=three_point(sfun,a,b,tolerance) sfun: Symbolic/String function a: Inferior Limit b: Superior Limit tolerance: Tolerance Range
reduced_array = data_reduction_algorithm(raw_data, tolerance)
raw data: 2 column's (time + data) tolerance: scalar (0....+inf-1)
array need's to be time distinct!
should work on Matlab 7.0 R14 also
dpsimplify uses the recursive Douglas-Peucker line simplification algorithm to reduce the number of vertices in a polyline according to a specified tolerance. The algorithm is also know as Iterative Endpoint Fit algorithm. dpsimplify can handle...
For a given function as a string, lower and upper bounds, number of iterations and tolerance Bisection Method is computed.
This function estimates the solution to Kummer's differential equation within a specified tolerance. Kummer's differential equation is given by:
x*g''(x) + (b - x)*g'(x) - a*g(x) = 0
The code executes a while loop to...
generates zeros of a Hermite polynomial of degree n to tolerance "tol" and their associated weights. Uses recursion relation to generate the Hermite function and finds zeros via change of sign and linear interpolation. If a...
Generates points and weights for Gauss Laguerre Quadrature, to a tolerance, tested for N < 300 Finds zeros and improves via recursion
CONVOLVE2 can be used wherever CONV2 is used, taking the same arguments and returning the same results to within a small tolerance. The computation is speeded up by using the singular value decomposition of the mask to express it as a sum of outer... |