PDELab is a partial differential equations solver toolbox built on top of DUNE, the Distributed and Unified Numerics Environment.

DUNE, the Distributed and Unified Numerics Environment is a modular toolbox for solving partial differential equations (PDEs) with grid-based methods. It supports the easy implementation of methods like Finite Elements (FE), Finite Volumes (FV), and also Finite Differences (FD).

HDF4 is a library and multi-object file format for storing and managing data between machines. HDF4 is an older hierarchical data format, incompatible with HDF5.

HYPRE is a software library of high performance preconditioners and solvers for the solution of large, sparse linear systems of equations. It features multigrid solvers for both structured and unstructured grid problems.

SCOTCH is a set of programs and libraries which implement the static mapping and sparse matrix reordering algorithms developed within the SCOTCH project. Its purpose is to apply graph theory, with a divide and conquer approach, to scientific computing problems such as graph and mesh partitioning, static mapping, and sparse matrix ordering, in application domains ranging from structural mechanics to operating systems or bio-chemistry.

CLP is a high quality linear programming solver. Its main strengths are its dual and primal Simplex algorithms. It also has a barrier algorithm for linear and quadratic objectives. There are limited facilities for nonlinear and quadratic objectives using the Simplex algorithm.

GNU C-Graph is a tool for demonstrating the theory of convolution. Thus, it can serve as an excellent aid to students of signal and systems theory in visualizing the convolution process. Rather than forcing the student to write code, the program offers an intuitive interface with interactive dialogs to guide them.

PETSc, pronounced PET-see (the S is silent), is a suite of data structures and routines for the scalable (parallel) solution of scientific applications modeled by partial differential equations.

SuiteSparse is a suite of sparse matrix algorithms, including: UMFPACK, multifrontal LU factorization; CHOLMOD, supernodal Cholesky; SPQR, multifrontal QR; KLU and BTF, sparse LU factorization, well-suited for circuit simulation; ordering methods (AMD, CAMD, COLAMD, and CCOLAMD); CSparse and CXSparse, a concise sparse Cholesky factorization package; and many other packages.

This package contains all of the above-mentioned parts.

The Parma Polyhedra Library (PPL) provides numerical abstractions especially targeted at applications in the field of analysis and verification of complex systems. These abstractions include convex polyhedra, defined as the intersection of a finite number of (open or closed) halfspaces, each described by a linear inequality (strict or non-strict) with rational coefficients; some special classes of polyhedra shapes that offer interesting complexity/precision tradeoffs; and grids which represent regularly spaced points that satisfy a set of linear congruence relations. The library also supports finite powersets and products of (any kind of) polyhedra and grids, a mixed integer linear programming problem solver using an exact-arithmetic version of the simplex algorithm, a parametric integer programming solver, and primitives for termination analysis via the automatic synthesis of linear ranking functions.

GLPK is a C library for solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems. It supports the GNU MathProg modeling language, a subset of the AMPL language, and features a translator for the language. In addition to the C library, a stand-alone LP/MIP solver is included in the package.

GNU JACAL is an interactive symbolic mathematics program based on Scheme. It manipulate and simplify a range of mathematical expressions such as equations, scalars, vectors, and matrices.

Gfan is a software package for computing Gröbner fans and tropical varieties.

SUNDIALS is a family of software packages implemented with the goal of providing robust time integrators and nonlinear solvers that can easily be incorporated into existing simulation codes.

PyGLM is a Python extension library which brings the OpenGL Mathematics (GLM) library to Python.

pagmo is a C++ scientific library for massively parallel optimization. It is built around the idea of providing a unified interface to optimization algorithms and to optimization problems and to make their deployment in massively parallel environments easy.

This package provides a collection of basic programming tools for numerical computation, including Fast Fourier Transforms, Spherical Harmonic Transforms, non-equispaced Fourier transforms, as well as some concrete applications like 4pi convolution on the sphere and gridding/degridding of radio interferometry data.

s(CASP) is a top-down interpreter for ASP programs with constraints.

HYPRE is a software library of high performance preconditioners and solvers for the solution of large, sparse linear systems of equations on parallel computers. It features parallel multigrid solvers for both structured and unstructured grid problems.

SLEPc, the Scalable Library for Eigenvalue Problem Computations, is based on PETSc, the Portable, Extensible Toolkit for Scientific Computation. It employs the MPI standard for all message-passing communication. slepc4py provides Python bindings to almost all functions of SLEPc.

CAMD is a set of routines for ordering a sparse matrix prior to Cholesky factorization (or for LU factorization with diagonal pivoting). It is a variant of AMD which has the the option to apply constraints to the ordering.

The p4est software library enables the dynamic management of a collection of adaptive octrees, conveniently called a forest of octrees. p4est is designed to work in parallel and scales to hundreds of thousands of processor cores.

Veusz is a scientific plotting and graphing program with a graphical user interface, designed to produce publication-ready 2D and 3D plots. In addition it can be used as a module in Python for plotting. It supports vector and bitmap output, including PDF, Postscript, SVG and EMF.

nauty (No AUTomorphisms, Yes?) is a set of procedures for computing automorphism groups of graphs and digraphs.

nauty computes graph information in the form of a set of generators, the size of the group, and the orbits of the group; it can also produce a canonical label. The nauty suite is written in C and comes with a command-line interface, a collection of command-line tools, and an Application Programming Interface (API).

This package provides the static libraries required to run programs compiled against the nauty library.