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

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

lp_solve is a mixed integer linear programming solver based on the revised simplex and the branch-and-bound methods.

primesieve is a command-line program and C/C++ library for quickly generating prime numbers. It is very cache efficient, it detects your CPU's L1 & L2 cache sizes and allocates its main data structures accordingly. It is also multi-threaded by default, it uses all available CPU cores whenever possible i.e. if sequential ordering is not required. primesieve can generate primes and prime k-tuplets up to 264.

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.

GKlib is a library of various helper routines and frameworks used by software from KarypisLab, such as METIS.

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.

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 the C library of RBio. It can be used for reading and writing sparse matrices in the Rutherford/Boeing format.

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.

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.

libcerf is a self-contained numeric library that provides an efficient and accurate implementation of complex error functions, along with Dawson, Faddeeva, and Voigt functions.

The double-conversion library provides binary-decimal and decimal-binary routines for IEEE doubles. The library consists of efficient conversion routines that have been extracted from the V8 JavaScript engine.

Voro++ is a software library for carrying out three-dimensional computations of the Voronoi tessellation. A distinguishing feature of the Voro++ library is that it carries out cell-based calculations, computing the Voronoi cell for each particle individually. It is particularly well-suited for applications that rely on cell-based statistics, where features of Voronoi cells (eg. volume, centroid, number of faces) can be used to analyze a system of particles.

Voro++ comprises of several C++ classes that can be built as a static library. A command-line utility is also provided that can use most features of the code. The direct cell-by-cell construction makes the library particularly well-suited to handling special boundary conditions and walls. It employs algorithms that are tolerant for numerical precision errors, it exhibits high performance, and it has been successfully employed on very large particle systems.

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.

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)

OpenGL Mathematics (GLM) is a header-only C++ mathematics library for graphics software based on the OpenGL Shading Language (GLSL) specifications.

Lis is a parallel software library for solving discretized linear equations and eigenvalue problems that arise in the numerical solution of partial differential equations using iterative methods.

The Java HDF5 Interface (JHI5) uses the Java Native Interface to wrap the HDF5 library, which is implemented in C.

SMTInterpol is an SMT solver, that can compute Craig interpolants for various theories.

Matio is a library for reading and writing MAT files. It supports compressed MAT files, as well as newer (version 7.3) MAT files.

SLEEF (SIMD Library for Evaluating Elementary Functions) is a library that implements vectorized versions of all C99 real floating point math functions. It can utilize SIMD instructions that are available on modern processors.

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.

The python-constraint module offers efficient solvers for constraint satisfaction problems over finite domains in an accessible Python package.