 m-Freq -- Pulse shaping filter program that finds the pole-zero locations of a transfer function, H(s), for a matched filter. H(s)
equals a -desired- signal (Yout) divided by a given input signal (Yin). Both Yout and Yin are functions of frequency.
Group delay may also be calculated to compliment a given data set, thus, providing a flat group delay....
 FC-Win -- FC-Win (tm) is a front-end program for Fortran Calculus (tm). The Fortran Calculus (FC) language is for math
modeling, simulation, and optimization. FC is based on Automatic Differentiation (AD) that simplifies computer code to an absolute minimum; i.e., a mathematical model, constraints, and the objective (function) definition. Minimizing the amount of code allows the user to concentrate on the science or engineering problem at hand....
 GIPALS - Linear Programming Environment -- Linear programming environment that incorporates large-scale linear programs solver and easy, intuitive graphical user interface to specify, import and solve any type of constrained optimization problems arising in various industrial, financial and educational areas. Optimization problems are stated as linear programs with UNLIMITED number of decision variables and constraints....
 WebCab Functions (J2EE Edition) -- EJB Suite 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: Newton poly., Lagrange's formula, Burlisch-Stoer algorithm, Cubic splines (natural and free), Bicubic interpolation and procedures for find the interpolation functions coefficients. Solve using Newton-Raphson, Bisection,......
WebCab Functions (J2SE Edition) -- 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....
WebCab Functions for .NET -- Add 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; to your .NET, COM, and XML Web service Apps. Interpolate using Newton poly., Lagrange's formula, Burlisch-Stoer algorithm, Cubic/Bicubic splines (natural and free); Solve using Newton-Raphson, Bisection, Brent, secant and false position, Ridders' Method,......
WebCab Functions for Delphi -- Add 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; to your .NET, COM, and XML Web service Apps. Interpolate using Newton poly., Lagrange's formula, Burlisch-Stoer algorithm, Cubic/Bicubic splines (natural and free); Solve using Newton-Raphson, Bisection, Brent, secant and false position, Ridders' Method, Delphi 3-8 & 2005 support...
WebCab Optimization (J2EE Edition) -- 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....
WebCab Optimization for .NET -- Add refined procedures for solving and performing sensitivity analysis on uni and multi dimensional, local or global optimization problems which may or may not have constraints; to your .NET, COM and XML Web service Applications. Specialized Simplex Linear programming algorithm, including sensitivity analysis with respect to object functions coefficients or linear boundaries using a duality (i.e. Lagrangian) or direct approach....
WebCab Optimization for Delphi -- Add refined procedures for solving and performing sensitivity analysis on uni and multi dimensional, local or global optimization problems which may or may not have constraints; to your .NET, and COM Applications. Specialized Simplex Linear programming algorithm, including sensitivity analysis with respect to object functions coefficients or linear boundaries using a duality (i.e. Lagrangian) or direct approach....
กก |
