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.
distributed.net is a loosely knit group of computer users from all of the world that is taking up challenges requiring lots of computing power (most notably the RC5, DES, and OGR cracking contests). It is simple to participate in the challenges by downloading and running their client software (which uses idle CPU time to complete its tasks).
GLE (Graphics Layout Engine) is a graphics scripting language designed for creating publication quality figures (e.g., a chart, plot, graph, or diagram). GLE supports various chart types (including function plot, histogram, bar chart, scatter plot, contour plot, color map, and surface plot) through a simple but flexible set of graphing commands. More complex output can be created by relying on GLE's scripting language, which is full featured with subroutines, variables, and logic control. GLE relies on LaTeX for text output and supports mathematical formulae in graphs and figures.
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.
KSEG is a program for exploring Euclidean geometry, similar to Geometer's Sketchpad. It features points, lines, transformations, measurements, calculations, simple editable recursive Constructions (similar to macros), adaptively sampled loci, and selection groups. Several languages are supported. KSEG is very fast, stable, and has an efficient and consistent UI. It uses Qt and does not require KDE.
LinAl was designed to bring together C++ and FORTRAN. At the same time LinAl is supposed to be easy to use, fast, and reasonably safe. The LinAl library is based on STL techniques and uses STL containers for the storage of matrix data and STL algorithms where feasible. Low level, algebraic operators, linear solvers, and eigenvalue solvers are implemented, based on calls to BLAS, LAPACK, and CGSOLX.