qrupdate is a Fortran library for fast updates of QR and Cholesky
decomposition. It was originally part of GNU-Octave.
Clasp is an answer set solver for (extended) normal logic programs. It combines
the high-level modeling capacities of answer set programming (ASP) with
state-of-the-art techniques from the area of Boolean constraint solving. The
primary clasp algorithm relies on conflict-driven nogood learning, a technique
that proved very successful for satisfiability checking (SAT). Unlike other
learning ASP solvers, clasp does not rely on legacy software, such as a SAT
solver or any other existing ASP solver. Rather, clasp has been genuinely
developed for answer set solving based on conflict-driven nogood learning.
clasp can be applied as an ASP solver (on SMODELS format, as output by Gringo),
as a SAT solver (on a simplified version of DIMACS/CNF format), or as a PB
solver (on OPB format).
The SDPA (SemiDefinite Programming Algorithm) is a software package for
solving semidefinite program (SDP). It is based on a Mehrotra-type
predictor-corrector infeasible primal-dual interior-point method.
The SDPA handles the standard form SDP and its dual. It is implemented in C++
language utilizing the LAPACK for matrix computation. The SDPA incorporates
dynamic memory allocation and deallocation. So, the maximum size of an SDP
to be solved depends on the size of memory which users' computers install.
The SDPA enjoys the following features:
1. Callable library of the SDPA is available.
2. Efficient method for computing the search directions when an SDP
to be solved is large scale and sparse.
3. Block diagonal matrix structure and sparse matrix structure in
data matrices are available.
4. Some information on infeasibility of a semidefinite program to be solved
is provided.
The SDPARA (SemiDefinite Programming Algorithm PARAllel version) is a
parallel version of the SDPA. C++ source codes of the SDPARA are
available in this homepage. They form a stand-alone software package for
solving SDPs in parallel with the help of MPI (Message Passing
Interface) and ScaLAPACK (Scalable LAPACK). However callable libraries
of the SDPARA, which could be used combinedly with other C++ programs,
are not available. We assume that you know how to use the latest version
of the SDPA and MPICH.
Spar is a modular math parser that comes with a fully featured text frontend,
something like an interactive calculator. It also provides a simple but
complete API for C/C++ programmers. This API provide a complete interface to
a top down parser that supports: variables, constants, functions, modules and
a libc based math library. This math library overrides standard functions with
a "custom" version (such as. deg, rad auto conversion, infinite symbol,
function domain...).
Spar, can be easily extended with modules. A module is a "user" extensions,
written in C/C++, to the basic features of the Simple Parser. Here you can
find the module definition: is a C structure that contains only few data
member:
- module name
- module version
- module description
- a pointer to the module main function
The modules are loaded at run-time by the module loader (that is a high level
layer of the module manager): you can load your modules, simply, coping theirs
paths into the .spar_modules (or any other file, with the -c option).
surf is a tool to visualize some real algebraic geometry: plane algebraic
curves, algebraic surfaces and hyperplane sections of surfaces. surf is
script driven and has (optionally) a nifty GUI using the Gtk widget set.
The algorithms should be stable enough not to be confused by curve/surface
singularities in codimension greater than one and the degree of the surface
or curve. This has been achieved quite a bit. We have drawn curves of degree
up to 30 and surfaces of degree up to 20 successfully. However, there are
examples of curves/surfaces of lower degree where surf fails to produce
perfect images. This happens especially if the equation of the curve/surface
is not reduced. Best results are achieved using reduced equations. On the
other hand, surf displays the Fermat-curves accurately for degree up to 98.
TomsFastMath is a portable fixed precision math library designed for
very fast exponentiations.
This Tiny Vector and Matrix template library uses Meta and Expression
Templates to evaluate results at compile time, thus making it fast for
low-end systems. Temporaries are avoided because of this. The dimensions
are static and bounded at compile time.
UFC (Unified Form-assembly Code) is a unified framework for finite element
assembly.
A clone of Norton Commander for Unix. Text-based,
full featured file manager intuitive interface.