OpenBLAS is a Basic Linear Algebra Subprograms (BLAS) library forked from the GotoBLAS2-1.13 BSD version.

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

SpeedCrunch is a high-precision scientific calculator. It features a syntax-highlighted scrollable display and is designed to be fully used via keyboard. Some distinctive features are auto-completion of functions and variables, a formula book, and quick insertion of constants from various fields of knowledge.

GLPK is a C library for solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems. It supports the GNU MathProg modeling language, a subset of the AMPL language, and features a translator for the language. In addition to the C library, a stand-alone LP/MIP solver is included in the package.

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.

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.

This package contains software that will allow you to use existing neural network potential parameterizations to predict energies and forces (with standalone tools but also in conjunction with the MD software LAMMPS). In addition it is possible to train new neural network potentials with the provided training tools.

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

Elemental is a modern C++ library for distributed-memory dense and sparse-direct linear algebra, conic optimization, and lattice reduction.

The dSMFT package speeds up Fast Mersenne Twister generation by avoiding the expensive conversion of integer to double (floating point). dSFMT directly generates double precision floating point pseudorandom numbers which have the IEEE Standard for Binary Floating-Point Arithmetic (ANSI/IEEE Std 754-1985) format. dSFMT is only available on the CPUs which use IEEE 754 format double precision floating point numbers.

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.

This package provides the eXtensible Data Model and Format (XDMF) C++ library.

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.

Openspecfun provides AMOS and Faddeeva. AMOS (from Netlib) is a portable package for Bessel Functions of a Complex Argument and Nonnegative Order; it contains subroutines for computing Bessel functions and Airy functions. Faddeeva allows computing the various error functions of arbitrary complex arguments (Faddeeva function, error function, complementary error function, scaled complementary error function, imaginary error function, and Dawson function); given these, one can also easily compute Voigt functions, Fresnel integrals, and similar related functions as well.

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.

Maxima is a system for the manipulation of symbolic and numerical expressions. It yields high precision numeric results by using exact fractions, arbitrary precision integers, and variable precision floating point numbers.

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.

The itex2MML utility is a stream filter. It takes text with embedded itex equations, converts the itex equations to MathML, and outputs the resulting text.

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.

Arccon is part of the Arcane framework, providing core functionality for the Arcane development platform.

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

This package provides a prototype Python implementation for SAT-based problems.

Ceres Solver is a C++ library for modeling and solving large, complicated optimization problems. It is a feature rich, mature and performant library which has been used in production since 2010. Ceres Solver can solve two kinds of problems:

1. non-linear least squares problems with bounds constraints;

2. general unconstrained optimization problems.