IT++ is a C++ library of mathematical, signal processing and communication classes and functions. Its main use is in simulation of communication systems and for performing research in the area of communications. The kernel of the library consists of generic vector and matrix classes, and a set of accompanying routines. Such a kernel makes IT++ similar to MATLAB, GNU Octave or SciPy.

PETSc, the Portable, Extensible Toolkit for Scientific Computation, is a suite of data structures and routines for the scalable (parallel) solution of scientific applications modeled by partial differential equations. It employs the MPI standard for all message-passing communication. petsc4py provides Python bindings to almost all functions of PETSc.

Qhull computes the convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulation, and furthest-site Voronoi diagram. The source code runs in 2-d, 3-d, 4-d, and higher dimensions. Qhull implements the Quickhull algorithm for computing the convex hull. It handles roundoff errors from floating point arithmetic. It computes volumes, surface areas, and approximations to the convex hull.

Qhull does not support triangulation of non-convex surfaces, mesh generation of non-convex objects, medium-sized inputs in 9-D and higher, alpha shapes, weighted Voronoi diagrams, Voronoi volumes, or constrained Delaunay triangulations.

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.

Open CASCADE is a set of libraries for the development of applications dealing with 3D CAD data or requiring industrial 3D capabilities. It includes C++ class libraries providing services for 3D surface and solid modeling, CAD data exchange, and visualization. It is used for development of specialized software dealing with 3D models in design (CAD), manufacturing (CAM), numerical simulation (CAE), measurement equipment (CMM), and quality control (CAQ) domains.

This is the certified version of the Open Cascade Technology (OCCT) library.

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.

accupy is a Python library for accurately computing sums and (dot) products. It implements Kahan summation, Shewchuck's algorithm and summation in K-fold precision.

CyLP is a Python interface to COIN-OR’s Linear and mixed-integer program solvers (CLP, CBC, and CGL). CyLP’s unique feature is that you can use it to alter the solution process of the solvers from within Python. For example, you may define cut generators, branch-and-bound strategies, and primal/dual Simplex pivot rules completely in Python.

This package provides a Django front end for Mathics3.

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

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.

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 basic DUNE geometry classes.

GNU Units converts numeric quantities between units of measure. It can handle scale changes through adaptive usage of standard scale prefixes (micro-, kilo-, etc.). It can also handle nonlinear conversions such as Fahrenheit to Celsius. Its interpreter is powerful enough to be used effectively as a scientific calculator.

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

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

GNU C-Graph is a tool for demonstrating the theory of convolution. Thus, it can serve as an excellent aid to students of signal and systems theory in visualizing the convolution process. Rather than forcing the student to write code, the program offers an intuitive interface with interactive dialogs to guide them.

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

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.

This package provides the C library of RBio. It can be used for reading and writing sparse matrices in the Rutherford/Boeing format.

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.

SLEEF (SIMD Library for Evaluating Elementary Functions) is a library that implements vectorized versions of all C99 real floating point math functions. It can utilize SIMD instructions that are available on modern processors.

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

CCOLAMD is library for computing a permutation vector for a matrix with which the LU factorization becomes sparser. It is a variant of COLAMD which has the the option to apply constraints to the ordering.

METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes, and producing fill-reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes.