WebCab Numerical Differentiation and Integration v4.0

WebCab Numerical Differentiation and Integration EJBTM component provides precise numerical techniques by which the definite integral and derivative at a point of a function 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.

New Features: GUI Bundle

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

Prices
WebCab Numerical Differentiation and Integration v4.0
Single CPU Server License
$449
2 CPU Server License
$592
4 CPU Server License
$889
Unlimited Site Wide Server License
$1,244
Demo License (limited functionality)
$0
Prices are expressed in USD.
Product Details

The WebCab Numerical Differentiation and Integration enterprise suite offers the following numerical techniques for the evaluation of the definite integral and the derivative at a point.

  • Numerical Integration
    • Newton-Cotes Rule
    • Extended Trapezoidal Rule - Based on approximating the function by drawing straight lines between the interpolating points.
    • Extended Simpson's Formula
    • Quadratic Gauss Formula
    • Gaussian Quadrature and Orthogonal Polynomials
      • Gauss-Legendre
      • Gauss-Laguerre
      • Guass-Hermite
      • Gauss-Jacobi
    • Romberg Integration
    • Chebyshev Approximation Procedures
  • Numerical Derivative
    • 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 explicitely differentiated term by term.

     

This package also contains the following features:

Prerequisites

  • An Operating System running JavaTM
  • Pentium III® 733 Mhz
  • 256MB RAM
  • A J2EE1.3 (EJB2.0) compatible Application Server

Software requirements:
  • Java2 Enterprise Edition
  • JDK 1.3 or compatible
Compatibility
Operating system for deployment:
  • Windows XP, 2000, NT
  • Sun Solaris
  • Linux
  • IBM AIX
  • HP-UX

Built Using:

  • JavaTM 2 SDK Standard Edition 1.3.1/1.4
  • JavaTM 2 SDK Enterprise Edition 1.3
Application Servers:
©1999-2002 WebCab Components