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.

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

This package provides the non-graphical version of the Scilab software for engineers and scientists. Scilab is used for signal processing, statistical analysis, image enhancement, fluid dynamics simulations, numerical optimization, and modeling, simulation of explicit and implicit dynamical systems and symbolic manipulations.

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

SoPlex is an optimization package for solving linear programming problems (LPs) based on an advanced implementation of the primal and dual revised simplex algorithm. It provides special support for the exact solution of LPs with rational input data. It can be used as a standalone solver reading MPS or LP format files via a command line interface as well as embedded into other programs via a C++ class library.

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

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.

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

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.

reduceLCS is an implementation of the Reduce-Expand algorithm for LCS. It is a fast program to compute the approximate Longest Commons Subsequence of a set of strings.

This package provides a tool to determine the backbone of a satisfiable formula. The backbone is the set of literals that are set to true in all models.

DUNE, the Distributed and Unified Numerics Environment is a modular toolbox for solving partial differential equations (PDEs) with grid-based methods.

This is the iterative solver template library which provides generic sparse matrix/vector classes and a variety of solvers based on these classes. A special feature is the use of templates to exploit the recursive block structure of finite element matrices at compile time. Available solvers include Krylov methods, (block-) incomplete decompositions and aggregation-based algebraic multigrid.

Py-BOBYQA is a flexible package for solving bound-constrained general objective minimization, without requiring derivatives of the objective. At its core, it is a Python implementation of the BOBYQA algorithm by Powell,but Py-BOBYQA has extra features improving its performance on some problems. Py-BOBYQA is particularly useful when evaluations of the objective function are expensive and/or noisy.

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

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.

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.

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.

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.

This package contains a set of routines for computing the LDL' factorization of sparse, symmetric matrices. Its focus lies on concise code.

SCS (splitting conic solver) is a numerical optimization package for solving large-scale convex cone problems.

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).

primecount is a command-line program and C/C++ library that counts the number of primes no greater than x (maximum 1031) using highly optimized implementations of the combinatorial prime counting algorithms.

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)

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.