METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes, and producing fill-reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes.

This library implements the math.h functions in fixed point (16.16) format.

CXSparse is a collection of sparse matrix algorithms for direct methods on both real and complex matrices.

This package provides character tables and a tokenizer for Mathics and the Wolfram language.

This package provides a Cython interface to the C++ library primecount.

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

Vc provides portable, zero-overhead C++ types for explicitly data-parallel programming. It is a library designed to ease explicit vectorization of C++ code. Its types enable explicitly stating data-parallel operations on multiple values. The parallelism is therefore added via the type system. Vc has an intuitive API and provides portability between different compilers and compiler versions as well as portability between different vector instruction sets. Thus, an application written with Vc can be compiled for:

1. AVX and AVX2

2. SSE2 up to SSE4.2 or SSE4a

3. Scalar

4. MIC

5. NEON (in development)

6. NVIDIA GPUs / CUDA (in development)

Bonmin is a code for solving general MINLP (Mixed Integer NonLinear Programming) problems. It builds on top of Cbc and Ipopt.

Calc is an arbitrary precision arithmetic system that uses a C-like language. It can be used as a calculator, an algorithm prototyper and as a mathematical research tool, and it comes with built in mathematical and programmatic functions.

Qhull computes the convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulation, and furthest-site Voronoi diagram. The source code runs in 2-d, 3-d, 4-d, and higher dimensions. Qhull implements the Quickhull algorithm for computing the convex hull. It handles roundoff errors from floating point arithmetic. It computes volumes, surface areas, and approximations to the convex hull.

Qhull does not support triangulation of non-convex surfaces, mesh generation of non-convex objects, medium-sized inputs in 9-D and higher, alpha shapes, weighted Voronoi diagrams, Voronoi volumes, or constrained Delaunay triangulations.

Gmsh is a 3D finite element grid generator with a built-in CAD engine and post-processor. Its design goal is to provide a fast, light and user-friendly meshing tool with parametric input and advanced visualization capabilities. Gmsh is built around four modules: geometry, mesh, solver and post-processing. The specification of any input to these modules is done either interactively using the graphical user interface or in ASCII text files using Gmsh's own scripting language.

Kissat is a bare-metal SAT-solver written in C. It is a port of CaDiCaL back to C with improved data structures, better scheduling of inprocessing and optimized algorithms and implementation.

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

orthopy provides various orthogonal polynomial classes for lines, triangles, quadrilaterals, disks, spheres, hexahedra, and n-cubes. All computations are done using numerically stable recurrence schemes. Furthermore, all functions are fully vectorized and can return results in exact arithmetic.

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

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

TypeTree is a template library for constructing and operating on statically typed trees of objects.

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

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

HDF-EOS2 is a software library built on HDF4 which supports the construction of data structures used in NASA's Earth Observing System (Grid, Point and Swath).

SoftFPU is a C++ library implementing concrete and symbolic semantics for floating point numbers as defined in the IEEE-764 Standard for Floating-Point Arithmetic. It is templated in terms of the bit-vectors, propositions, floating-point formats and rounding mode types used. This allow the same code to be executed as an arbitrary precision library or to be used to build symbolic representations of floating-point operations.

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.

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.

Fast Downward is a portfolio-based planning system that supports the propositional fragment of PDDL2.2.