/* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: * Y = F
/* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: * Y = F(T,Y), A<=T<=B, Y(A) = ALPHA, * AT N+1 EQUA...
/* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: * Y = F(T,Y), A<=T<=B, Y(A) = ALPHA, * AT N+1 EQUA...
this directory contains the following: * The acdc algorithm for finding the approximate general (non-orthogonal) joint diagonalizer (in the di...
The toolbox solves a variety of approximate modeling problems for linear static models. The model can be parameterized in kernel, image, or input/outp...
an approximate SVM solver, useful for very large dataset....
Computes approximate significance points of a Pearson curve with given first four moments, or first three moments and left or right boundary...