CGLM is an optimised 3D maths library for graphics software based on the GLSL specifications.

It's similar to the original C++ GLM library but written in C99 and compatible with C89.

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.

muParser is an extensible high performance math parser library. It is based on transforming an expression into a bytecode and precalculating constant parts of it.

ScaLAPACK is a Fortran 90 library of high-performance linear algebra routines on parallel distributed memory machines. ScaLAPACK solves dense and banded linear systems, least squares problems, eigenvalue problems, and singular value problems.

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

Wcalc is a very capable calculator. It has standard functions (sin, asin, and sinh for example, in either radians or degrees), many pre-defined constants (pi, e, c, etc.), support for using variables, "active" variables, a command history, hex/octal/binary input and output, unit conversions, embedded comments, and an expandable expression entry field. It evaluates expressions using the standard order of operations.

BLIS is a portable software framework for instantiating high-performance BLAS-like dense linear algebra libraries. The framework was designed to isolate essential kernels of computation that, when optimized, immediately enable optimized implementations of most of its commonly used and computationally intensive operations. While BLIS exports a new BLAS-like API, it also includes a BLAS compatibility layer which gives application developers access to BLIS implementations via traditional BLAS routine calls.

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

Deal.II is a C++ program library targeted at the computational solution of partial differential equations using adaptive finite elements. The main aim of deal.II is to enable rapid development of modern finite element codes, using among other aspects adaptive meshes and a wide array of tools often used in finite element programs.

CUDD is a library for manipulating decision diagrams. It supports binary decision diagrams, algebraic decision diagrams, and zero-suppressed binary decision diagrams.

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.

Glucose is a SAT solver based on a scoring scheme introduced in 2009 for the clause learning mechanism of so called “Modern” SAT solvers. It is designed to be parallel.

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.

The dune-functions module provides an abstraction layer for global finite element functions. Its two main concepts are functions implemented as callable objects, and bases of finite element spaces.

This package provides a command-line interface to Mathics3.

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.

ARPACK-NG is a collection of Fortran77 subroutines designed to solve large scale eigenvalue problems.

GNU Octave is a high-level interpreted language that is specialized for numerical computations. It can be used for both linear and non-linear applications and it provides great support for visualizing results. Work may be performed both at the interactive command-line as well as via script files.

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

This package provides a SAT solver based on conflict-driven clause learning.

NetCDF is an interface for scientific data access and a software library that provides an implementation of the interface. The netCDF library defines a machine-independent format for representing scientific data. Together, the interface, library, and format support the creation, access, and sharing of scientific data.

The Zoltan library is a collection of data management services for parallel, unstructured, adaptive, and dynamic applications. It simplifies the load-balancing, data movement, unstructured communication, and memory usage difficulties that arise in dynamic applications such as adaptive finite-element methods, particle methods, and crash simulations. Zoltan's data-structure neutral design also lets a wide range of applications use it without imposing restrictions on application data structures. Its object-based interface provides a simple and inexpensive way for application developers to use the library and researchers to make new capabilities available under a common interface.

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.

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.