VisIt is an interactive parallel visualization and graphical analysis tool for viewing scientific data. Users can quickly generate visualizations from their data, animate them through time, manipulate them, and save the resulting images for presentations. VisIt contains a rich set of visualization features so that you can view your data in a variety of ways. It can be used to visualize scalar and vector fields defined on two- and three-dimensional (2D and 3D) structured and unstructured meshes. It was designed to interactively handle very large data set sizes in the terascale range, and works well down to small data sets in the kilobyte range.
Genius is an arbitrary precision integer and multiple precision floating point calculator. It includes its own programming language similar in some aspects to C, bc, or Pascal. It can deal with rational numbers and complex numbers. It has matrix support as well. It uses the gmp library so it is very fast for calculations of large numbers. It has a command line and a GNOME interface. The GNOME interface supports plotting functions and 3D surfaces.
Cactus is a general, modular, parallel environment for solving systems of partial differential equations. The code has been developed over many years by a large international collaboration of numerical relativity and computational science research groups and can be used to provide a portable platform for solving any system of partial differential equations.
The Kent Retargettable Occam Compiler is a multi-platform Occam 2.1 compiler that is designed to allow the Occam programming language to be used on non-Transputer platforms. Extensions from a subset of the Occam 3 specification and from pi calculus have been added over time. As a result, the version of the language supported by the compiler is also sometimes referred to as Occam 2.5 or Occam-pi.
Calcoo is a scientific calculator designed to provide maximum usability. Its features bitmapped button labels and display digits to improve readability, no double-function buttons, undo/redo buttons, copy/paste interaction with the clipboard, both RPN and algebraic modes, two memory registers with displays, displays for Y, Z, and T registers, and tick marks to separate thousands. Calcoo is written in C using the GTK+ widget library (v.2.2+).
GTL can be seen as an extension of the Standard Template Library STL to graphs and fundamental graph algorithms. It is a platform independent and extendible C++ library, and is a useful aid to any software designer. It contains the classes needed to work with graphs, nodes, and edges, and some fundamental algorithms as building blocks for more complex graph algorithms. Customized algorithms can be developed by experienced programmers.
FrAid (Fr[actal] Aid) is a programming language that is appropriate for mathematical computations, visualization, batch processing, and more. It features both a standalone application that provides a programming environment for the language and a system for integrating the language with Java. The Java interface allows mathematical equations and formulas to be used with Java code, making it easier to process numerical computations, symbolic computations, imaging, CAD, and more.
Trad4 is a fully concurrent, thread safe, graph based programming language that scales linearly on multiple cores. It is initially intended for deployment in the financial industry to model real-time risk. Trad4 is proposed as an alternative to the Von Neumann model of computer architecture. It is a new way of arranging programs in memory and a new style of flow-of-control.
Groups, Algorithms, and Programming (GAP) is a system for computational discrete algebra with particular emphasis on computational group theory and related areas. It provides a Pascal-like interpreted language, data types for many algebraic objects, a function library, and large libraries of data.
DELORES (DEfeasible LOgic REasoning System) is a forward-chaining reasoning engine for defeasible logic, a less-expressive but more efficient non-monotonic logic. In contrast with most other non-monotonic logics, defeasible logic has linear complexity, allowing DELORES to execute large theories very quickly. DELORES's algorithm extends to general defeasible theories through the use of a pre-processing transformation which eliminates all uses of defeaters and superiority relations.