WebCab Interpolation and Extrapolation

We offer computationally convenient and effective schemes of interpolation and extrapolation. These methods are ideal for any system that needs to work with functions which are stored in tabular form. We include the methods of Newton polynomials, Lagrange's formula, Burlisch-Stoer algorithm, Cubic splines (natural and free) and Bicubic interpolation. We also consider algorithms for nding the coefficients of an interpolating function and interpolation in higher dimensions.

New Features: GUI Bundle

We bundle a suite of graphical user interface JavaBean components (with 1, 2, 4 or sitewide license) allowing the developer to plug-in a wide range of GUI functionality (including charts/graphs) into their client applications.

Prices
Interpolation and Extrapolation
Single CPU Server License
$249
2 CPU Server License
$328
4 CPU Server License
$493
Unlimited Site Wide/Company Server License
$690
Demo License (limited functionality)
$0
Prices are expressed in USD.
Product Details
This suite includes the following features:
  • Polynomial Interpolation and extrapolation
    • Lagrange's formula - for interpolating a function known at N points with a polynomial of degree N-1
    • Burlisch-Stoer algorithm - interpolates functions using rational functions, this method gives error estimates
    • Cubic Splines - we give algorithms for natural and clamped cubic splines
    • Sorting - efficient techniques are used for nding tabulated values
  • Coefficients of an Interpolating Polynomial
    • Matrix method - this method relies upon diagonalizing a matrix (or solving a system of equations), and is of the order N2
    • Zero method - by evaluating the interpolating polynomial at particular values we deduce the coefficients, this method is of the order N3
  • Interpolation and extrapolation in two or more dimensions
    • Grid - functions can be interpolated on an n-dimensional grid
    • Bilinear interpolation - we consider a multidimensional interpolation by breaking the problem into successive one dimensional interpolations
    • Accuracy - the use of higher order polynomials to obtain increased accuracy
    • Bicubic interpolation - nds an interpolating function with a specified derivatives and cross derivatives which vary smoothly at the grid points
    • Bicubic spline - a special case of Bicubic interpolation involving the use of successive one-dimensional splines

     

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