PETSc, the Portable, Extensible Toolkit for Scientific Computation, is a suite of data structures and routines for the scalable (parallel) solution of scientific applications modeled by partial differential equations. It employs the MPI standard for all message-passing communication. petsc4py provides Python bindings to almost all functions of PETSc.

NetCDF is an interface for scientific data access and a software library that provides an implementation of the interface. The netCDF library defines a machine-independent format for representing scientific data. Together, the interface, library, and format support the creation, access, and sharing of scientific data.

This package provides a C++ interface to the NetCDF library for scientific data storage.

This package provides a range of SAT solvers, including the sequential lingeling and its parallel variants plingeling and treengeling. A bounded model checker is also included.

qalculate-qt is the Qt frontend for the Qalculate! multi-purpose calculator.

HDF5 is a suite that makes possible the management of extremely large and complex data collections.

SuiteSparse is a suite of sparse matrix algorithms. This package contains a library with common configuration options.

SLEPc is a software library for the solution of large sparse eigenproblems on parallel computers. It can be used for the solution of linear eigenvalue problems formulated in either standard or generalized form, as well as other related problems such as the singular value decomposition. The emphasis of the software is on methods and techniques appropriate for problems in which the associated matrices are sparse, for example, those arising after the discretization of partial differential equations.

ScaLAPACK is a Fortran 90 library of high-performance linear algebra routines on parallel distributed memory machines. ScaLAPACK solves dense and banded linear systems, least squares problems, eigenvalue problems, and singular value problems.

mCRL2 (micro Common Representation Language 2) is a formal specification language for describing concurrent discrete event systems. Its toolset supports analysis and automatic verification, linearisation, simulation, state-space exploration and generation, and tools to optimise and analyse specifications. Also, state spaces can be manipulated, visualised and analysed.

BTF (Block Triangular Form) is a C library for permuting a matrix into block upper triangular form.

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.

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.

PnetCDF is a high-performance parallel I/O library for accessing Unidata's NetCDF, files in classic formats, specifically the formats of CDF-1, 2, and 5.

Numdiff compares files line by line and field by field, ignoring small numeric differences and differences in numeric formats.

SCIP is a solver for mixed integer programming (MIP) and mixed integer nonlinear programming (MINLP). It is a framework for constraint integer programming and branch-cut-and-price, allowing total control of the solution process and access to detailed information down to the internals of the solver.

CUDD is a library for manipulating decision diagrams. It supports binary decision diagrams, algebraic decision diagrams, and zero-suppressed binary decision diagrams.

SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems of linear equations on high performance machines. The library is written in C and is callable from either C or Fortran. The library routines perform an LU decomposition with partial pivoting and triangular system solves through forward and back substitution. The library also provides threshold-based ILU factorization preconditioners.

mCRL2 (micro Common Representation Language 2) is a formal specification language for describing concurrent discrete event systems. Its toolset supports analysis and automatic verification, linearisation, simulation, state-space exploration and generation, and tools to optimise and analyse specifications. Also, state spaces can be manipulated, visualised and analysed.

This DUNE module provides interface and implementation for shape functions defined on the DUNE reference elements. In addition to the shape function, interpolation operators and special keys are provided which can be used to assemble global function spaces on finite-element grids.

This package provides an interface and implementation for shape functions defined on the DUNE reference elements. In addition to the shape function, interpolation operators and special keys are provided which can be used to assemble global function spaces on finite-element grids.

libensemble is a complete toolkit for dynamic ensembles of calculations. It connects deciders to experiments or simulations.

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).

This package contains the basic DUNE geometry classes.

ARPACK-NG is a collection of Fortran77 subroutines designed to solve large scale eigenvalue problems.

FLANN is a library for performing fast approximate nearest neighbor searches in high dimensional spaces. It implements a collection of algorithms and a system for automatically choosing the best algorithm and optimum parameters depending on the dataset.

FLANN is written in C++ and contains bindings for C, Octave and Python.