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

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

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.

FunctionParser is a C++ library for parsing and evaluating mathematical expressions. This package is based on a maintained fork of the original project.

AIGER is a format, library and set of utilities for AIGs. The focus is on conversion utilities and a generic reader and writer API.

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

The C code of lrslib implements the reverse search algorithm for vertex enumeration and convex hull problems. Its input file format is compatible with cddlib. All computations are done exactly in either multiple precision or fixed integer arithmetic. Output is not stored in memory, so even problems with very large output sizes can sometimes be solved.

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

This package provides a C++ implementation of the Louvain community detection algorithm.

SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems of linear equations on high performance machines. The library is written in C and is callable from either C or Fortran. The library routines perform an LU decomposition with partial pivoting and triangular system solves through forward and back substitution. The library also provides threshold-based ILU factorization preconditioners.

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

GNU XaoS is a graphical program that generates fractal patterns and allows you to zoom in and out of them infinitely in a fluid, continuous manner. It also includes tutorials that help to explain how fractals are built. It can generate many different fractal types such as the Mandelbrot set.

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.

qalculate-qt is the Qt frontend for the Qalculate! multi-purpose calculator.

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.

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.

s(CASP) is a top-down interpreter for ASP programs with constraints.

HYPRE is a software library of high performance preconditioners and solvers for the solution of large, sparse linear systems of equations on parallel computers. It features parallel multigrid solvers for both structured and unstructured grid problems.

ALUGrid is an adaptive, loadbalancing, unstructured implementation of the DUNE grid interface supporting either simplices or cubes.

A pure Ruby AsciiMath parsing and conversion library. AsciiMath is an easy-to-write markup language for mathematics.

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.

nanoflann is a C++11 header-only library for building KD-trees of datasets with different topologies: R2, R3 (point clouds), SO(2) and SO(3) (2D and 3D rotation groups). It is a fork of the FLANN library that replaces virtual methods inlined templates for improved runtime and memory efficiency.

Z3 is a theorem prover and satisfiability modulo theories (SMT) solver. It provides a C/C++ API, as well as Python bindings.

NOMAD is a C++ implementation of the mesh-adaptive direct search (MADS) algorithm, designed for difficult blackbox optimization problems. These problems occur when the functions defining the objective and constraints are the result of costly computer simulations.