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. In order to solve an equation we provide the Van Wijngaarden-Dekker-Brent algorithm, interval bisection method, secant and false position, Newton-Raphson method and Ridders' method. This suite includes the following features: 1) Interpolation Module: polynomial interpolation and extrapolation, coefficients of an interpolating polynomial, interpolation and extrapolation in two or more dimensions. 2) Equation Solver Module: Interval Method, Secant Method, Brent's Algorithm, Ridders' Method, Method of Regula Falsi, Method of Regula Falsi, Newton-Raphson Method, Fail-Safe Newton-Raphson Method.
The program gives a complete, step-by-step solution of the following problem: Given a 2x2 linear system (two equations, two variables) or 2x3, or 3x2, or 3x3, or 3x4, or 4x3, or 4x4 linear system. Find its solution set by using the Gauss-Jordan elimination method. The program is designed for university students and professors.