Boolector is a SMT solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions.

Armadillo is a C++ linear algebra library, aiming towards a good balance between speed and ease of use. It is useful for algorithm development directly in C++, or quick conversion of research code into production environments. It can be used for machine learning, pattern recognition, signal processing, bioinformatics, statistics, econometrics, etc. The library provides efficient classes for vectors, matrices and cubes, as well as 150+ associated functions (e.g., contiguous and non-contiguous submatrix views).

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.

This package provides a parser for the BTOR2 format used by Boolector.

The SPQR (SuiteSparseQR) package provides sparse QR factorization based on the multifrontal method, using BLAS for the frontal matrices.

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.

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

hmat-oss is hierarchical matrix library written in C++ with a C API. It contains a LU and LLt solver, and a few other things.

PALP is a set of programs for calculations with lattice polytopes and applications to toric geometry.

GLPK is a C library for solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems. It supports the GNU MathProg modeling language, a subset of the AMPL language, and features a translator for the language. In addition to the C library, a stand-alone LP/MIP solver is included in the package.

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

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

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.

Yices is a solver for SMT problems. It can process input in SMT-LIB format or its own s-expression-based format.

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

CryptoMiniSat is an incremental SAT solver with both command line and library (C++, C, Python) interfaces. The command-line interface takes a CNF as an input in the DIMACS format with the extension of XOR clauses. The library interfaces mimic this and also allow incremental solving, including assumptions.

wxMaxima is a graphical user interface for the Maxima computer algebra system. It eases the use of Maxima by making most of its commands available through a menu system and by providing input dialogs for commands that require more than one argument. It also implements its own display engine that outputs mathematical symbols directly instead of depicting them with ASCII characters.

wxMaxima also features 2D and 3D inline plots, simple animations, mixing of text and mathematical calculations to create documents, exporting of input and output to TeX, and a browser for Maxima's manual including command index and full text searching.

GSEGrafix is an application which produces high-quality graphical plots for science and engineering. Plots are specified via simple ASCII parameter files and data files and are presented in an anti-aliased GNOME canvas. The program supports rectangular two-dimensional plots, histograms, polar-axis plots and three-dimensional plots. Plots can be printed or saved to BMP, JPEG or PNG image formats.

Giza is a lightweight scientific plotting library built on top of cairo that provides uniform output to multiple devices.

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.

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.

Bitwuzla is a SMT solver for the theories of fixed-size bit-vectors, floating-point arithmetic, arrays, uninterpreted functions and their combinations.

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

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.