![]() |
||||||
![]() |
![]() |
![]() |
![]() |
![]() |
||
|
||||||
PricesWebCab 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.
Product DetailsPrices are expressed in USD.
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 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:
- 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
- UML Models - to assist software architects we include UML diagrams
- EAR Files - we provide individual customized EAR files for the most widely used application servers including IBM WebSphere 4.0/5.0, BEA WebLogic 6.1/7.0, Oracle 9iAS, Sun ONE AppServer 7, Ironflare Orion 1.5.2/1.6.0, Borland AppServer 5.0, Sybase EAServer 3.6 and JBoss 2.4.4/3.0.0
- Self-Deploy - the relevant servers EAR file will be self-deployed onto supported local application servers during the installation of the self-install package. The supported application servers include IBM WebSphere 4.0/5.0, BEA WebLogic 6.1/7.0, Oracle 9iAS, Borland AppServer 5.0, Ironflare Orion 1.5.2/1.6.0 and JBoss 2.4.4/3.0.0
Prerequisites
Compatibility
- 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
Operating system for deployment:Application Servers:
- 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
- IBM WebSphere Application Server V4.0/V5.0
- BEA WebLogic® Server 6.1/7.0
- Oracle® 9i Application Server
- Sun ONE AppServer 7
- Borland Enterprise AppServer 5.0
- Ironflare Orion Server 1.5.2/1.6.0
- Sybase EAServer 3.6
- JBoss 2.4.4/3.0.0
©1999-2002 WebCab Components