Enter the query into the form above. You can look for specific version of a package by using @ symbol like this: gcc@10.
API method:
GET /api/packages?search=hello&page=1&limit=20
where search is your query, page is a page number and limit is a number of items on a single page. Pagination information (such as a number of pages and etc) is returned
in response headers.
If you'd like to join our channel webring send a patch to ~whereiseveryone/toys@lists.sr.ht adding your channel as an entry in channels.scm.
Gappa is a tool intended to help verifying and formally proving properties on numerical programs dealing with floating-point or fixed-point arithmetic. It has been used to write robust floating-point filters for CGAL and it is used to certify elementary functions in CRlibm. While Gappa is intended to be used directly, it can also act as a backend prover for the Why3 software verification platform or as an automatic tactic for the Coq proof assistant.
fpylll is a Python wrapper for fplll.
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.
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.
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.
The Littlewood-Richardson Calculator (lrcalc) is a program designed to compute Littlewood-Richardson coefficients. It computes single Littlewood-Richardson coefficients, products of Schur functions, or skew Schur functions. In addition it computes products in the small quantum cohomology ring of a Grassmann variety. The software package also includes a program that performs fast computation of the more general multiplicative structure constants of Schubert polynomials.
Kiss FFT attempts to be a reasonably efficient, moderately useful FFT that can use fixed or floating data types and can easily be incorporated into a C program.
LinBox is a C++ template library for exact linear algebra computation with dense, sparse, and structured matrices over the integers and over finite fields.
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.
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.
GiNaC is a C++ library for symbolic computation. Contrary to other CAS it does not try to provide extensive algebraic capabilities and a simple programming language but instead accepts a given language (C++) and extends it by a set of algebraic capabilities.
Giac/Xcas is a computer algebra system. It has a compatibility mode for maple, mupad and the TI89. It is available as a standalone program (graphic or text interfaces) or as a C++ library.
Clac is a command line, stack-based calculator with postfix notation that displays the stack contents at all times. As you type, the stack changes are reflected immediately.
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).
Kiss FFT is a mixed-radix Fast Fourier Transform based up on the principle, 'Keep It Simple, Stupid.'
xtensor is a C++ library meant for numerical analysis with multi-dimensional array expressions.
xtensor provides:
an extensible expression system enabling lazy broadcasting.
an API following the idioms of the C++ standard library.
tools to manipulate array expressions and build upon xtensor.
The la4j library is a Java library that provides Linear Algebra primitives (matrices and vectors) and algorithms. The key features of the la4j library are:
No dependencies and tiny size
Fluent object-oriented/functional API
Sparse (CRS, CCS) and dense (1D/2D arrays) matrices
Linear systems solving (Gaussian, Jacobi, Zeidel, Square Root, Sweep and other)
Matrices decomposition (Eigenvalues/Eigenvectors, SVD, QR, LU, Cholesky and other)
MatrixMarket/CSV IO formats support for matrices and vectors
Sollya is a computer program whose purpose is to provide an environment for safe floating-point code development. It is particularly targeted to the automated implementation of mathematical floating-point libraries (libm). Amongst other features, it offers a certified infinity norm, an automatic polynomial implementer, and a fast Remez algorithm.
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. This package also includes parform, a version of FORM parallelized using OpenMPI.
The eclib package includes mwrank (for 2-descent on elliptic curves over Q) and modular symbol code; it has been written by John Cremona to compute his elliptic curve database.
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.
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.
libsemigroups is a C++14 library containing implementations of several algorithms for computing finite, and finitely presented, semigroups and monoids.
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.