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.

GNU Dionysus is a convenient system for quickly retrieving the values of mathematical constants used in science and engineering. Values can be searched using a simple command-line tool, choosing from three databases: universal constants, atomic numbers, and constants related to semiconductors.

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.

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.

Openspecfun provides AMOS and Faddeeva. AMOS (from Netlib) is a portable package for Bessel Functions of a Complex Argument and Nonnegative Order; it contains subroutines for computing Bessel functions and Airy functions. Faddeeva allows computing the various error functions of arbitrary complex arguments (Faddeeva function, error function, complementary error function, scaled complementary error function, imaginary error function, and Dawson function); given these, one can also easily compute Voigt functions, Fresnel integrals, and similar related functions as well.

bliss is a library for computing automorphism groups +and canonical forms of graphs. It has both a command line user interface as +well as C++ and C programming language APIs.

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

Metamath is a tiny formal language and that can express theorems in abstract mathematics, with an accompyaning metamath executable that verifies databases of these proofs. There is a public database, set.mm, implementing first-order logic and Zermelo-Frenkel set theory with Choice, along with a large swath of associated, high-level theorems, e.g.: the fundamental theorem of arithmetic, the Cauchy-Schwarz inequality, Stirling's formula, etc. See the Metamath book.

Ruy is a matrix multiplication library. Its focus is to cover the matrix multiplication needs of neural network inference engines. Its initial user has been TensorFlow Lite, where it is used by default on the ARM CPU architecture.

feedgnuplot is a tool to plot realtime and stored data from the command line, using gnuplot. It can read data from a pipe or file, make a variety of transformations, and render the result in the terminal or with an external viewer.

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 SAT solver based on conflict-driven clause learning.

Chuffed is a state of the art lazy clause solver designed from the ground up with lazy clause generation in mind. Lazy clause generation is a hybrid approach to constraint solving that combines features of finite domain propagation and Boolean satisfiability.

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.

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.

LAPACK is a Fortran 90 library for solving the most commonly occurring problems in numerical linear algebra.

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.

The Common Data Access toolbox (CODA) provides a set of interfaces for reading remote sensing data from earth observation data files. It consists of command line applications and interfaces to the C, Fortran, Python, and Java programming languages.

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 dune-subgrid module marks elements of another hierarchical dune grid. The set of marked elements can then be accessed as a hierarchical dune grid in its own right. Dune-Subgrid provides the full grid interface including adaptive mesh refinement.

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

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.

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

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.