Functions v2.0 J2SE Edition
  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. 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. In order to solve an equation we provide the Van Wijngaarden-Dekker-Brent algorithm, interval bisection method, secant and false position, Newton-Raphson method and Ridders' method.
  <details>    <buy>


   Ordinary Differential Equations v4.1 J2SE Edition
  Implements methods for finding solutions to systems of ordinary differential equations (ODE's) using Runge Kutta, modified mid-point, Bulirsh-Stoer, Rosenbrock, semi-implicit extrapolation methods and the second-order conservative equations.
  <details>    <buy>


   Differentiation and Integration v4.1 J2SE Edition
  Provides precise numerical techniques by which the integral and derivative of a function at a point can be evaluated. Ridders' algorithm, Newton polynomial and Chebyshev polynomial methods are used in the approximation of a functions derivative. Newton-Cotes rule, Extended Trapezoidal rule, Extended Simpson's formula, Quadratic Gauss formula, Gaussian Quadrature (using the orthogonal functions of the Gauss-Legendre, Gauss-Laguerre, Gauss-Hermite and Gauss-Jacobi type), Romberg integration and Chebyshev-approximation procedures are implemented for the evaluation of the definite integral.
  <details>    <buy>


   Probability and Statistics v3.3 J2SE Edition
  This suite consists of four packages: Statistics, Discrete Probability, Standard Probability Distributions and Hypothesis Testing which offer the following functionality.  (More...)
  <details>    <buy>


   Optimization v2.6 J2SE Edition
  Solve complex one and multi dimensional optimization problems efficiently with our powerful optimization component. This component offers advanced algorithms covering local and global unidimensional optimization, local multidimensional optimization with or without constraints. A general framework for performing sensitivity analysis is included along with specialized algorithms (including duality techniques) for solving and performing analysis of linear programming problems.
  <details>    <buy>



©1999-2004 WebCab Components