FORM is a symbolic manipulation system. It reads symbolic expressions from files and executes symbolic/algebraic transformations upon them. The answers are returned in a textual mathematical representation. The size of the considered expressions in FORM is only limited by the available disk space and not by the available RAM.

JTransforms is a multithreaded FFT library written in pure Java. Currently, four types of transforms are available: Discrete Fourier Transform (DFT), Discrete Cosine Transform (DCT), Discrete Sine Transform (DST) and Discrete Hartley Transform (DHT).

M4RI is a library for fast arithmetic with dense matrices over F2. The name M4RI comes from the first implemented algorithm: The Method of the Four Russians inversion algorithm published by Gregory Bard. This algorithm in turn is named after the Method of the Four Russians multiplication algorithm.

Kiss FFT is a mixed-radix Fast Fourier Transform based up on the principle, 'Keep It Simple, Stupid.'

FFTW is a C subroutine library for computing the discrete Fourier transform (DFT) in one or more dimensions, of arbitrary input size, and of both real and complex data (as well as of even/odd data---i.e. the discrete cosine/ sine transforms or DCT/DST). With OpenMPI parallelism support.

M4RI is a library for fast arithmetic with dense matrices over finite fields of characteristic 2. So it extends the functionality of M4RI from F_2 to F_2^e.

FLINT is a C library for number theory. It supports arithmetic with numbers, polynomials, power series and matrices over many base rings, including multiprecision integers and rationals, integers modulo n, p-adic numbers, finite fields (prime and non-prime order) and real and complex numbers (via the Arb extension library).

Operations that can be performed include conversions, arithmetic, GCDs, factoring, solving linear systems, and evaluating special functions. In addition, FLINT provides various low-level routines for fast arithmetic.

IML is a C library implementing algorithms for computing exact solutions to dense systems of linear equations over the integers. Currently, IML provides the following functionality:

• Nonsingular rational system solving: compute the unique rational solution X to the system AX=B, where A and B are integer matrices, A nonsingular.

• Compute the right nullspace or kernel of an integer matrix.

• Certified linear system solving: compute a minimal denominator solution x to a system Ax=b, where b is an integer vector and A is an integer matrix with arbitrary shape and rank profile.

In addition, IML provides some low level routines for a variety of mod p matrix operations: computing the row-echelon form, determinant, rank profile, and inverse of a mod p matrix. These mod p routines are not general purpose; they require that p satisfy some preconditions based on the dimension of the input matrix (usually p should be prime and should be no more than about 20 bits long).

This package provides functions for 1D and 2D Discrete Cosine Transform (DCT), Discrete Sine Transform (DST) and Discrete Hartley Transform (DHT).

The CMH software computes Igusa (genus 2) class polynomials, which parameterize the CM points in the moduli space of 2-dimensional abelian varieties, i.e. Jacobians of hyperelliptic curves. It can also be used to compute theta constants at arbitrary precision.

bc is an arbitrary precision numeric processing language. It includes an interactive environment for evaluating mathematical statements. Its syntax is similar to that of C, so basic usage is familiar. It also includes "dc", a reverse-polish calculator.

Eigen is a C++ template library for linear algebra: matrices, vectors, numerical solvers, and related algorithms. It provides an elegant API based on "expression templates". It is versatile: it supports all matrix sizes, all standard numeric types, various matrix decompositions and geometry features, and more.

Normaliz is a tool for computations in affine monoids, vector configurations, rational polyhedra and rational cones. Normaliz now computes rational and algebraic polyhedra, i.e., polyhedra defined over real algebraic extensions of QQ.

GAP is a system for computational discrete algebra, with particular emphasis on computational group theory. It provides a programming language, a library of thousands of functions implementing algebraic algorithms written in the GAP language as well as large data libraries of algebraic objects.

FFTW is a C subroutine library for computing the discrete Fourier transform (DFT) in one or more dimensions, of arbitrary input size, and of both real and complex data (as well as of even/odd data---i.e. the discrete cosine/ sine transforms or DCT/DST). This CMake build offers the file FFTW3LibraryDepends.cmake required by some dependent packages, absent in the gnu build version.

GMP-ECM factors integers using the elliptic curve method (ECM) as well as the P-1 and P+1 algorithms. It provides a library and a stand-alone binary.

The gf2x library provides arithmetic of polynomials over finite fields of characteristic 2. It implements the multiplication, squaring and greatest common divisor operations.

msolve is a C library implementing computer algebra algorithms for solving polynomial systems (with rational coefficients or coefficients in a prime field).

Currently, with msolve, you can basically solve multivariate polynomial systems. This encompasses:

• the computation of Groebner bases

• real root isolation of the solutions to polynomial systems

• the computation of the dimension and the degree of the solution set.

This package provides Python bindings for the Littlewood-Richardson Calculator.

Mpfrcx is a library for the arithmetic of univariate polynomials over arbitrary precision real (mpfr) or complex (mpc) numbers, without control on the rounding. For the time being, only the few functions needed to implement the floating point approach to complex multiplication are implemented. On the other hand, these comprise asymptotically fast multiplication routines such as Toom–Cook and the FFT.

Symmetrica is a library for combinatorics. It has support for the representation theory of the symmetric group and related groups, combinatorics of tableaux, symmetric functions and polynomials, Schubert polynomials, and the representation theory of Hecke algebras of type A_n.

liblog represents an interface to the volatile Android Logging system for NDK (Native) applications and libraries and contain interfaces for either writing or reading logs. The log buffers are divided up in Main, System, Radio and Events sub-logs.

android-libutils provides utilities for Android NDK developers.

android-bionic-uapi provides the part of the Linux API that is safe to use for user space. It also includes system_properties.h and _system_properties.h.