muParser is an extensible high performance math parser library. It is based on transforming an expression into a bytecode and precalculating constant parts of it.

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.

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

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.

MUMPS (MUltifrontal Massively Parallel sparse direct Solver) solves a sparse system of linear equations A x = b using Gaussian elimination.

4ti2 implements algorithms for solving algebraic, geometric and combinatorial problems on linear spaces. Among others, it solves systems of linear equations, computes extreme rays of polyhedral cones, solves integer programming problems and computes Markov bases for statistics.

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

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 grid classes.

nanoflann is a C++11 header-only library for building KD-trees of datasets with different topologies: R2, R3 (point clouds), SO(2) and SO(3) (2D and 3D rotation groups). It is a fork of the FLANN library that replaces virtual methods inlined templates for improved runtime and memory efficiency.

The ELPA library provides efficient and scalable direct eigensolvers for symmetric matrices.

Mongoose is a library for graph partitioning by computing edge cuts using a coarsening and refinement framework.

This library implements the Fruchterman-Reingold force-directed graph layout algorithm. It applies repulsion between all vertex pairs (to avoid overlap) and attraction between connected vertices (to pull them together). Forces decay with distance, and a global temperature limits maximum displacement per iteration, causing the layout to sta0bilize gradually.

CHOLMOD is a set of routines for factorizing sparse symmetrix positive definite matrices, updating/downdating sparse Cholesky factorizations and other related operations.

This is a header-only C++ library for calculating analytical derivatives and taylor expansions of composite functions.

FunctionParser is a C++ library for parsing and evaluating mathematical expressions. This package is based on a maintained fork of the original project.

MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.

Kiwi is an efficient C++ implementation of the Cassowary constraint solving algorithm. Kiwi has been designed from the ground up to be lightweight and fast. Kiwi ranges from 10x to 500x faster than the original Cassowary solver with typical use cases gaining a 40x improvement. Memory savings are consistently > 5x.

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.

Gecode is a C++ toolkit for developing constraint-based systems and applications. It provides a modular and extensible solver.

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.

AMD is a set of routines for ordering a sparse matrix prior to Cholesky factorization (or for LU factorization with diagonal pivoting).

This package provides the Blis BLAS-like linear algebra library, as a self-contained C-extension for Python.

This is a C version of the minpack minimization package. It has been derived from the fortran code using f2c and some limited manual editing. Extern C linkage permits the package routines to be called from C++.

This package provides a Django front end for Mathics3.