WebCab Equation Solver v3.0

The WebCab Equation Solver Enterprise JavaBeansTM component implements refined numerical procedures for solving equations in one space variable. We include Van Wijngaarden-Dekker-Brent algorithm, interval bisection method, secant and false position, Newton-Raphson method and Ridders' method. We implement local and Remote Method Invocation (RMI) equation delivery procedures.

New Features: Self-Deploy, EAR Files

By clicking the self-install package the EJB component will be automatically deployed onto a supported local EJB application server. We also include multiple EAR les designed for each of the most widely used application servers (see details).

Prices
WebCab Equation Solver v3.0
Single CPU Server License
$349
2 CPU Server License
$460
4 CPU Server License
$691
Unlimited Site Wide/Company Server License
$967
Demo License (limited functionality)
$0
Prices are expressed in USD.
Product Details
WebCab Equation Solver implements the following numerical methods for solving equations:

  • Interval Bisection Method - A robust method that always finds a solution or a singularity inside a bracketed interval.
  • Secant Method - Generally this procedure converges and is much faster than the interval bisection method.
  • Brent's Algorithm - The method of choice to find a bracketed root of a one dimensional equation when you cannot easily compute the function's derivative.
  • Ridders' Method - Concise and almost as reliable as Brent's Algorithm for nding a bracketed root of an equation.
  • Newton-Raphson Method - Given a first approximation to a root and the differential of the functon this procedure will always produce a solution. We implement this procedure for polynomial functions of one variable.
  • Fail-Safe Newton-Raphson Method - This method combines the Newton-Raphson method and the Interval Bisection Method in order to produce very stable and fast convergence. Given a first approximation to a root and the differential of the functon this procedure will always produce a solution.
  • Method of Regula Falsi - This procedure uses a slight alteration on the secant method to ensure convergence. The procedure is generally faster than the interval bisection method and slightly slower than the secant method

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