Next Previous Contents

If you have some small computation most likely you will find the tools in
the computer in your office are enough for it (mathematica for basic
computations gives decent results in any computer; bc is some powerful
calculator that accepts numbers in different bases). Some other
computers, called **compute1** to **compute4**, have more recent
versions of computational software. You can ssh to them and do your
computations there. These are aliases for the fastest four machines in
the offices and computer room. If you need a to perform some big
computation, then you can use the machine called
**gauss.math.tifr.res.in**, a Xeon at 2.4 GHz with 2560 MB of RAM.

Below there is a list of the software installed in gauss.math.tifr.res.in and most likely in the compute1 to compute4 machines. Rather than giving lots of information in this document, I have put links to other sites where you can find more details.

More documentation (for Macaulay 0.8.99) and DVI file on Using Macaulay2 by D. Eisenbud, D.R. Grayson and M.E. Stillman

More documentation

More documentation in DVI format More documentation in PS format

Documentation is available on the program itself.

More documentation

The X-windows interface is called xmaxima

More documentation

The syntax is very close to Mathematica. The distribution contains a small library of mathematical functions, but its real strength is in the language in which you can easily write your own symbolic manipulation algorithms. It supports arbitrary precision arithmetic.

More documentation

More documentation

MAGNUS features an intuitive graphical user interface, facilities for running different algorithms on the same problem in parallel, generation of approximations for working on otherwise infeasible problems, genetic algorithms and a plug-in package manager.

More documentation

Web page More documentation

The libraries in this package are built without any processor extension instructions, and should run on all processors of this general architecture, albeit less than optimally.

On some architectures, multiple binary packages are provided to take advantage of certain commonly available processor instruction set extensions. The instruction extension set used is indicated in the package name, with 'base' denoting no extensions. In general, you will obtain the best performance by installing the package with the most advanced isntruction extension set your machine is capable of running.

Web page

GLPK supports the GNU MathProg language, which is a subset of the AMPL language. GLPK also supports the standard MPS and LP formats.

The GLPK package includes the following main components:

- Revised simplex method.
- Primal-dual interior point method.
- Branch-and-bound method.
- Translator for GNU MathProg.
- Application program interface (API).
- Stand-alone LP/MIP solver.

More documentation

This package is built for Python 2.3.x

More documentation

More documentation

Originally developed by Henri Cohen and his co-workers (University Bordeaux I, France), PARI is now under the GPL and maintained by Karim Belabas (University Paris XI, France) with the help of many volunteer contributors.

The original purpose of the ECMNET project was to make Richard Brent's prediction true, i.e. to find a factor of 50 digits or more by ECM. This goal was attained on September 14, 1998, when Conrad Curry found a 53-digit factor of 2^677-1 c150 using George Woltman's mprime program. The new goal of ECMNET is now to find other large factors by ecm, mainly by contributing to the Cunningham project, most likely the longest, ongoing computational project in history according to Bob Silverman. A new record was set by Nik Lygeros and Michel Mizony, who found in December 1999 a prime factor of 54 digits using GMP-ECM.

Web page

This package contains the qhull executable that gives a pipe interface to some of the functionality of the library. Also included is rbox is a useful tool in generating input for Qhull; it generates hypercubes, diamonds, cones, circles, simplices, spirals, lattices, and random points.

Qhull produces graphical output for Geomview. This helps with understanding the output (http://www.geomview.org).

Web site

More Documentation

More documentation

Originally developed by Henri Cohen and his co-workers (Université Bordeaux I, France), PARI is now under the GPL and maintained by Karim Belabas (Université Paris XI, France) with the help of many volunteer contributors.

This package contains extra data files for PARI/GP, currently the Galois resolvants for the polgalois function.

A reverse-polish calculator stores numbers on a stack. Entering a number pushes it on the stack. Arithmetic operations pop arguments off the stack and push the results.

More documentation

These extensions add two new object types to Python, and then include a number of extensions that take advantage of these two new objects:

- Multidimensional Array Objects

- Efficient arrays of homogeneous machine types (floats, longs, complex doubles)
- Arbitrary number of dimensions
- Sophisticated structural operations

- Support mathematical functions on all Python objects
- Very efficient for array objects

More documentation

Axiom has been in development since 1973 and was sold as a commercial product. It has been released as free software.

Efforts are underway to extend this software to (a) develop a better user interface (b) make it useful as a teaching tool (c) develop an algebra server protocol (d) integrate additional mathematics (e) rebuild the algebra in a literate programming style (f) integrate logic programming (g) develop an Axiom Journal with refereed submissions.

Modules that rely on the non-free libforms library are not included.

Geomview allows multiple independently controllable objects and cameras. It provides interactive control for motion, appearances (including lighting, shading, and materials), picking on an object, edge or vertex level, snapshots in SGI image file or Renderman RIB format, and adding or deleting objects is provided through direct mouse manipulation, control panels, and keyboard shortcuts. External programs can drive desired aspects of the viewer (such as continually loading changing geometry or controlling the motion of certain objects) while allowing interactive control of everything else.

Web page More documentation

Web page More documentation

This package provides several example binaries.

More documentation in HTML format More documentation in PS format

An integer linear programming (ILP) problem is an LP with the constraint that all the variables are integers. In a mixed integer linear programming (MILP) problem, some of the variables are integer and others are real.

The program lp_solve solves LP, ILP, and MILP problems. It is slightly more general than suggested above, in that every row of A (specifying one constraint) can have its own (in)equality, <=, >= or =. The result specifies values for all variables.

lp_solve uses the 'Simplex' algorithm and sparse matrix methods for pure LP problems. If one or more of the variables is declared integer, the Simplex algorithm is iterated with a branch and bound algorithm, until the desired optimal solution is found. lp_solve can read MPS format input files.

More documentation

More documentation

Data files and self-defined functions can be manipulated by internal C-like language. Can perform smoothing, spline-fitting, or nonlinear fits. Can work with complex numbers.

Next Previous Contents