Overview | Pricing & Licensing | Evals & Downloads | Compatibility | Publisher Details | Reviews | Support Forum | Summary

From

$146.02

Our regular prices are shown below. Please logon to see your discounted prices.

Price in USD ($) - US Dollar GBP (£) - Pound Sterling EUR (€) - Euro JPY (¥) - Japanese Yen AUD (A$) - Australian Dollar KRW (￦) - Korean Won BRL (R$) - Brazilian Real TWD (NT$) - New Taiwan Dollar SGD (S$) - Singapore Dollar SEK (SKr) - Swedish Kronor NZD (NZ$) - New Zealand Dollar NOK (NKr) - Norwegian Krone MXN (MX$) - Mexican Peso INR (Rs) - Indian Rupee HKD (HK$) - Hong Kong Dollar DKK (DKr) - Danish Krone CNY (元) - Chinese Yuan Renminbi CHF (CHF) - Swiss Franc CAD (Can$) - Canadian Dollar ZAR (R) - South African Rand

WebCab Functions (J2EE Edition) V2.0

Add to Cart	$ 146.02	1 Developer License		Download (9.5 MB)
Add to Cart	$ 247.94	4 Developer Team License		Download (9.5 MB)
Add to Cart	$ 496.86	1 Site Wide License (Allows Unlimited Developers at a Single Physical Address)		Download (9.5 MB)

Our prices include ComponentSource technical support and, for most downloadable products, an online backup and a FREE upgrade to the new version if it is released within 30 days of your purchase.  All sales are made on our standard Terms and Conditions and subject to our Return Policy. Please contact us if you require any licensing option not listed, including volume licensing and previous versions.

Our regular prices are shown above. Please logon to see your discounted prices.

This suite includes the following features:

Interpolation Module

• 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 finding 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 N squared
  • Zero method - by evaluating the interpolating polynomial at particular values we deduce the coefficients, this method is of the order N cubed
  
  
• 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
  • Smoothness - the use of higher order polynomials to enforce smoothness on some of the derivatives
  • Bicubic interpolation - finds 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

Equation Solver Module

• 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 finding a bracketed root of an equation.
• 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.
• Newton-Raphson Method - Given a first approximation to a root and the differential of the function 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 function this procedure will always produce a solution.

This product also contains the following features:

• 
  
• GUI Bundle - we bundle a suite of graphical user interface JavaBean components (with 1, 2, 4 or site-wide license) allowing the developer to plug-in a wide range of GUI functionality (including charts/graphs) into their client applications
• 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
• JDBC Mediator - A server side EJB component which mediates between an EJB component, clients and DBMS. The mediator moves most of a clients JDBC calls to the server and hence greatly increases the speed of JDBC client applications.
• Web Application Example - A JSP interactive HTML interface which enables you to test every component method directly from your browser.
• Synthetic JDBC - we use a JSP component to perform EJB calculations on SQL database columns from a remote DBMS. We apply an EJB function to certain rows from the database and list the output in HTML format. This is a powerful feature since it allows you to perform calculations in a JDBC manner without having to code the EJB-to-JDBC transaction yourself as it is all done by the JSP within the Application Server.
• UML Models - to assist system architects we provide UML diagrams of this component