 |
We offer refined numerical procedures to either construct a function of one or two variables from a set of points (i.e. interpolate), or solve an equation of one variable. Interpolation procedures include Newton polynomials, Lagrange's formula, Burlisch-Stoer algorithm, Cubic splines (natural and free), Bicubic interpolation. Equation solver procedures include Van Wijngaarden-Dekker-Brent algorithm, interval bisection method, secant and false position, Newton-Raphson method and Ridders' method.
Offers refined numerical procedures to either construct a function of one or two variables from a set of points (i.e. interpolate), or solve an equation of one variable. The interpolation procedures provided include Newton polynomials, Lagrange's formula, Burlisch-Stoer algorithm, Cubic splines (natural and free), Bicubic interpolation and procedures for find the interpolation functions coefficients. Solve using Newton-Raphson, Bisection,...
Refined procedures for solving and performing sensitivity analysis on uni and multi dimensional, local or global optimization problems which may or may not have linear constraints. Specialized Linear programming algorithms based on the Simplex Algorithm and duality are included along with a framework for sensitivity analysis w.r.t. boundaries (duality, or direct approach), or object function coefficients.
Refined procedures for solving and performing sensitivity analysis on uni and multi dimensional, local or global optimization problems which may or may not have linear constraints. Specialized Linear programming algorithms based on the Simplex Algorithm and duality are included along with a framework for sensitivity analysis w.r.t. boundaries (duality, or direct approach), or object function coefficients.
This suite consists of four packages: Statistics, Discrete Probability, Standard Probability Distributions and Hypothesis Testing which offer the wide range of data analysis functionality.
|
