*** TI-89 ENGINEERING PROGRAMS: /pub/graph-ti/calc-apps/89/engineering/ Choleski decomposition ---------------------- Choleski.89f and Choleski.92f are properly functions. Call "Choleski" with a single argument: Choleski(A), where "A" is the matrix you want to factorize. The function returns the factorized matrix. Nothing is stored by "Choleski". control theroy box ------------------- The Control Theory Toolbox 1.0 is a collection of functions and programs to aid in solving control theory problems on the TI-89 and TI-92+ calculators. diffeq89 -------- Differential equation solvers + Laplace v. 2.05 for TI-92/92II and TI-89/92+ The package include following: online help to programs, differential equation solver, simultaneous differential equations solver, Laplace transformation, inverse Laplace transformation. femtorsn -------- FETorsn: finite element method for elastic torsion on TI's graphing calculators. fourier ------- Fourier version 3.20 for TI-92/TI-92II and TI-89/TI-92+. This packet contains functions to perform Fourier-/inverse Fourier-transformation. A function, which can rewrite the output of Fourier/iFourie to a form that, can be evaluated numerical. A function to graph the output. mintrms1 -------- Minterms1 v1.0 - The purpose of the program is to determine the Minterms for a Boolean Sum-Of-Products (SOP) or Product-Of-Sums (POS) expression of 2 to 6 variables. Minterms are the values of the solutions that make the expression TRUE or logic 1. pitun ----- This program tunes a Proportional + Integral (PI) controller for a typical process type transfer function. Programs for Civil Engineering ------------------------- Joint is for truss analysis. Tbeam is for singly reinforced concrete beams that have a t shape. Concrete is for rectangular beams that are singly reinforced. Dblrebar is for doubly reinforced concrete rectangular beams. SIMPLEX ------- Simplex algorithm Made by Anders Forsberg in Mars 2000 Program version 1.00 SIMPLEX is a linear programming problem solver. It solves the following type of problems (using the "well known" algorithm Simplex): max/min cx Ax=b b>=0 x>=0 The condition of solving the problem is that you have a allowed starting base. Finding a allowed starting base can be difficult but can be solved by inserting more x variables and solving the new problem. This is called "Simplex phase 1", please check any book about "Combinatorial Optimization" to find out how this is done. The program can solve problems from "Simplex phase 1" but you have to enter them manually. If you supply the program with a allowed starting base you will get a optimal solution (if there is one) and the corresponding x values. If the solution is unbound the program will provide you with the direction that the problem is unbound in. Please observe that, if you supply a non valid starting base the solution will usually NOT be optimal or valid! * All trademarks are the sole property of their respective owners.