Aamath is a program that reads mathematical expressions in infix notation
and renders them as ASCII art. It may be useful to send mathematics through
text-only media, such as e-mail or newsgroups.
ABACUS is a software system written in C++ that provides a framework for the
implementation of branch-and-bound algorithms using linear programming
relaxations. Cutting planes or columns can be generated dynamically
(branch-and-cut, branch-and-price, branch-and-cut-and-price).
ABACUS allows the software developer to concentrate merely on the problem
specific parts, i.e., the separation of cutting planes, column generation, and
primal heuristics. ABACUS supports the Open Solver Interface (Osi) developed
by the COIN-OR (COmputational INfrastructure for Operations Research) project
which means that every solver supported by OSI can be used to solve the
relaxations.
Moreover, ABACUS provides a variety of general algorithmic concepts, e.g., a
list of different enumeration and branching strategies from which the best
alternative for the user's application can be chosen.
Finally, ABACUS provides many basic data structures and useful tools for the
implementation of such algorithms. It is designed both for general mixed
integer optimization problems and for combinatorial optimization problems. It
unifies cutting plane and column generation within one algorithm framework.
Simple reuse of code and the design of abstract data structures and algorithms
are met by object oriented programming modules.
Add is a fixed-point calculator that operates as a full-screen editor.
Add performs fixed-point computation. It is designed for use as a
checkbook or expense-account balancing tool. Add maintains a running
result for each operation. You may scroll to any position in the
expression list and modify the list.
Calcoo is a scientific calculator designed to provide maximum
usability. The features that make Calcoo better than (at least some)
other calculator programs are:
* Bitmapped button labels and display digits to improve readability.
* No double-function buttons.
* Undo/redo buttons.
* Copy/paste interaction with X clipboard.
* Both RPN (reverse Polish notation) and algebraic modes are available.
* Tick marks to separate thousands.
* Two memory registers with displays.
* Displays for Y, Z, and T registers.
* It is a purely scientific calculator.
Features that Calcoo lacks:
* Statistical mode.
* HEX mode.
Algae is a programming language for numerical analysis. It was written in
the Boeing Company to fulfill their need for a fast and versatile tool,
capable of handling large systems. Algae has been applied to interesting
problems in aerospace and related fields for more than a decade.
Algotutor is an interactive program for observing the intermediate
steps of algorithms. The target audience is computer science students
and/or anyone who studies algorithms and/or data structures.
OpenBLAS is an optimized BLAS library based on GotoBLAS2 1.13 BSD version.
OpenBLAS is an open source project supported by
Lab of Parallel Software and Computational Science, ISCAS.
NOTE: If you want to specify your CPU microarchitecture manually,
please use TARGET_CPU_ARCH knob, e.g., "make TARGET_CPU_ARCH=NEHALEM".
This value is set TARGET build flag.
Alt-Ergo is an automatic theorem prover dedicated to program verification.
Alt-Ergo is based on CC(X), a congruence closure algorithm parameterized by
an equational theory X. Currently, CC(X) can be instantiated by the empty
equational theory and by the linear arithmetics. Alt-Ergo contains also a
home made SAT-solver and an instantiation mechanism.
Alt-Ergo is compact, safe, and modular. Each component is described by a small
set of inference rules and is implemented as an Ocaml functor.
CCMATH is a mathematics library, coded in C, that contains functions
for linear algebra, numerical integration, geometry and trigonometry,
curve fitting, roots and optimization, Fourier analysis, simulation
generation, statistics, special functions, sorts and searches, time
series models, complex arithmetic, and high precision computations.
Before a calculation can be performed on a parallel computer, it must
first be decomposed into tasks which are assigned to different processors.
Efficient use of the machine requires that each processor have about the
same amount of work to do and that the quantity of interprocessor
communication is kept small. Finding an optimal decomposition is provably
hard, but due to its practical importance, a great deal of effort has been
devoted to developing heuristics for this problem. The decomposition
problem can be addressed in terms of graph partitioning.
Chaco implements a variety of algorithms for graph partitioning and is
used at most of the major parallel computing centers around the world to
simplify the development of parallel applications, and to ensure that high
performance is obtained. Chaco has contributed to a wide variety of
computational studies including investigation of the molecular structure
of liquid crystals, evaluating the design of a chemical vapor deposition
reactor and modeling automobile collisions.
Note: this port includes a patch provided by Walter Landry for use within
MBDyn.