| Dfactorial | SimlQuadEqSolv | VxGetBinomCoef | VxPolyEqnSolv |
double
Dfactorial(int)
int m |
i |
input integer
|
Description
Returns the double factorial of m.
Memory-Management
Caveats
int
SimlQuadEqSolv(double
, double [6], double [6], int *, double [4], double [4])
double tol |
i |
coincidence tolerance for coefficients.
|
double quad1[6] |
i |
coefficients of first quadratic equation, A1-F1.
|
double quad2[6] |
i |
coefficients of second quadratic equation, A2-F2.
|
int *n_soln |
o |
number of real solutions in array x and y.
|
double x[4] |
o |
x coordinate of solutions.
|
double y[4]
|
o |
y coordinate of solutions.
|
Description
Memory-Management
Caveats
void
VxGetBinomCoef(int,
double *)
int n |
i |
The exponent for expansion (1 + 1)**n.
|
double *coef
|
o |
Array of (n+1) coefficients.
|
Description
Generate the binomial expansion coefficients using Pascal's triangle.
Up to level 19 are precomputed below to save time.
Memory-Management
Caveats
int
VxPolyEqnSolv(double
tol, int deg, double *a, int *n_soln, double *x)
double tol |
i |
system tolerance.
|
int deg |
i |
highest degree term with non-zero coefficient, (max 4).
|
double *a |
i |
0 = a[0] + a[1]*X + a[2]*X**2 + ... + a[deg]*X**deg
|
int *n_soln |
o |
number of real solutions in array x.
|
double *x |
o |
solutions (size should support deg # of solutions).
|
Description
Memory-Management
Caveats
