 |
WebCab Functions (J2SE Edition) 2.0
Java API Components offering refined numerical procedures to either construct a function of one or two variables from a set of points (i.e. interpolate), or solve an equation of one variable. The interpolation procedures provided include Newton polynomials, Lagrange's formula, Burlisch-Stoer algorithm, Cubic splines (natural and free), Bicubic interpolation and procedures for find the interpolation functions coefficients.
interpolation, extrapolation, java, javabeans, class libraries, j2se, jsp, newton polynomials, lagrange's, burlisch-stoer, |
 |
WebCab Bonds (J2SE Edition) 1
Java Components offering general Interest derivatives pricing framework: set contract and vol/price/interest models and run MC. Also allows the pricing and risk analytics of interest rate cash and derivative products. We also cover the fundamental theory of bonds including: Treasury bonds, Yield/Pricing, Zero Curve, Forward rates/FRAs, Duration and Convexity. Download then "java -jar *.jar" at prompt.
bonds, interest rate, java, -jar, javabeans, class libraries, j2se, jsp, capital market, markets, |
 |
WebCab Options (J2SE Edition) 2.5
Java API for price option and futures contracts using Monte Carlo and Finite Difference techniques. General MC pricing framework: wide range of contracts, price, interest and vol models. Prices European, Asian, American, Lookback, Bermuda and Binary Options using Analytic, Monte Carlo and Finite Difference inaccordance with a number of vol, price, volatility and rate models.
options, futures, java, javabeans, class libraries, j2se, jsp, european, asian, american, |
 |
WebCab Probability and Stat (J2SE Ed.) 3.6
Offers functionality from Basic Statistics, Discrete Probability, Standard Probability Distributions, Hypothesis Testing, Correlation and Linear Regression
java, javabeans, class libraries, j2se, jsp, basic, statistics, discrete, probability, standard, |
 |
WebCab Optimization (J2SE Edition) 2.6
Refined procedures for solving and performing sensitivity analysis on uni and multi dimensional, local or global optimization problems which may or may not have linear constraints. Specialized Linear programming algorithms based on the Simplex Algorithm and duality are included along with a framework for sensitivity analysis w.r.t. boundaries (duality, or direct approach), or object function coefficients.
optimization, linear programming, java, javabeans, class libraries, j2se, jsp, maxima, minima, local global, |
|
| Login |
Not a member yet? Click here to register.
Forgotten your password? Request a new one here.
|
|
