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.

optizelle is a software library designed to solve nonlinear optimization problems. Four types of problem are considered: unconstrained, equality constrained, inequality constrained and constrained. Constraints may be applied as values of functions or sets of partial differential equations (PDEs).

Solution algorithms such as the preconditioned nonlinear conjugate gradient method, sequential quadratic programming (SQP) and the primal-dual interior-point method are made available. Interfaces are provided for applications written in C++ and Python. Parallel computation is supported via MPI.

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.

HiGHS provides serial and parallel solvers for large-scale sparse linear programming (LP), mixed-integer programming (MIP), and quadratic programming (QP) models

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.

HDF5 is a suite that makes possible the management of extremely large and complex data collections.

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.

SuiteSparse is a suite of sparse matrix algorithms, including: UMFPACK, multifrontal LU factorization; CHOLMOD, supernodal Cholesky; SPQR, multifrontal QR; KLU and BTF, sparse LU factorization, well-suited for circuit simulation; ordering methods (AMD, CAMD, COLAMD, and CCOLAMD); CSparse and CXSparse, a concise sparse Cholesky factorization package; and many other packages.

This package contains all of the above-mentioned parts.

mCRL2 (micro Common Representation Language 2) is a formal specification language for describing concurrent discrete event systems. Its toolset supports analysis and automatic verification, linearisation, simulation, state-space exploration and generation, and tools to optimise and analyse specifications. Also, state spaces can be manipulated, visualised and analysed.

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.

CXSparse is a collection of sparse matrix algorithms for direct methods on both real and complex matrices.

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

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

FLANN is a library for performing fast approximate nearest neighbor searches in high dimensional spaces. It implements a collection of algorithms and a system for automatically choosing the best algorithm and optimum parameters depending on the dataset.

FLANN is written in C++ and contains bindings for C, Octave and Python.

ndim computes all kinds of volumes and integrals of monomials over such volumes in a fast, numerically stable way, using recurrence relations.

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.

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.

This package provides a Django front end for Mathics3.

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

This package provides a command-line interface to Mathics3.

bliss is a library for computing automorphism groups +and canonical forms of graphs. It has both a command line user interface as +well as C++ and C programming language APIs.

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.

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.

The CLAPACK library was built using a Fortran to C conversion utility called f2c. The entire Fortran 77 LAPACK library is run through f2c to obtain C code, and then modified to improve readability. CLAPACK's goal is to provide LAPACK for someone who does not have access to a Fortran compiler.