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.

Prices
WebCab Differentiation and Integration v4.1 J2SE Edition
Single Developer License
 $159
4 Developer Team License
 $271
Site Wide Developer License
 $541
Demo License (limited functionality)
 $0
Prices are expressed in US Dollars.
Product Details
The WebCab Differentiation and Integration enterprise suite offers the following numerical techniques for the evaluation of the definite integral and the derivative of a function at a point.

  • Integration

    • Newton-Cotes Rule - uses products of rational functions to form a basis of the function space
    • Extended Trapezoidal Rule - based on approximating the function by drawing straight lines between the interpolating points
    • Extended Simpson's Formula - approximation obtained by replacing on small intervals the function with a parabola
    • Quadratic Gauss Formula - an approximation of the integral of the function using Legendre polynomials
    • Gaussian Quadrature and Orthogonal Polynomials - the function space will be spanned by one of the following types of functions

      • Gauss-Legendre
      • Gauss-Laguerre
      • Gauss-Hermite
      • Gauss-Jacobi

    • Romberg Integration - uses successive refinements of the extended trapezoidal rule
    • Chebyshev Approximation Procedures - integrand approximated using Chebyshev polynomials

  • Differentiation

    • Ridders' Algorithm - This method uses the classical definition of the derivative taking into account very carefully any rounding errors which may occur
    • Newton Polynomial - The first and second derivative
    • Chebyshev Polynomial Method - The function is first approximated by an absolutely convergent series of Chebyshev polynomials and then this series is explicitly differentiated term by term


This product also contains the following feature:

  • GUI Bundle - we bundle a suite of graphical user interface JavaBean components allowing the developer to plug-in a wide range of GUI functionality (including charts/graphs) into their client applications.

Prerequisites

  • An Operating System running JavaTM
  • Pentium III® 500 Mhz
  • 128MB RAM

Software requirements:
  • JDK 1.3 or compatible
Compatibility
Operating System for Deployment:
  • Windows 2003, XP, 2000, NT, 9x
  • Sun Solaris
  • Linux
  • IBM AIX

Built Using:

  • JavaTM 2 SDK Standard Edition 1.3.1/1.4.x
©1999-2004 WebCab Components