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 search send a patch to ~whereiseveryone/toys@lists.sr.ht adding your channel as an entry in channels.scm.
Spectra stands for Sparse Eigenvalue Computation Toolkit as a Redesigned ARPACK. It is a C++ library for large scale eigenvalue problems, built on top of Eigen. It is implemented as a header-only C++ library and can be easily embedded in C++ projects that require calculating eigenvalues of large matrices.
Singular is a computer algebra system for polynomial computations, with special emphasis on commutative and non-commutative algebra, algebraic geometry and singularity theory.
SymEngine is a standalone fast C++ symbolic manipulation library. Optional thin wrappers allow usage of the library from other languages.
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.
LinBox is a C++ template library for exact linear algebra computation with dense, sparse, and structured matrices over the integers and over finite fields.
PARI/GP is a widely used computer algebra system designed for fast computations in number theory (factorisations, algebraic number theory, elliptic curves...), but it also contains a large number of other useful functions to compute with mathematical entities such as matrices, polynomials, power series, algebraic numbers, etc., and a lot of transcendental functions. PARI is also available as a C library to allow for faster computations.
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).
lmfit is a C library for Levenberg-Marquardt least-squares minimization and curve fitting. It is mature code, based on decades-old algorithms from the FORTRAN library MINPACK.
PyNormaliz provides an interface to Normaliz via libNormaliz. It offers the complete functionality of Normaliz, and can be used interactively from Python.
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.
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
fpylll is a Python wrapper for fplll.
This package provides an alternative implementation of bc calculator.
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.
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.
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.
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.
This package provides a Python wrapper for Fourier Local Correlation Tracking.
fplll contains implementations of several lattice algorithms. The implementation relies on floating-point orthogonalization, and LLL is central to the code, hence the name.
It includes implementations of floating-point LLL reduction algorithms, offering different speed/guarantees ratios. It contains a wrapper choosing the estimated best sequence of variants in order to provide a guaranteed output as fast as possible. In the case of the wrapper, the succession of variants is oblivious to the user.
It includes an implementation of the BKZ reduction algorithm, including the BKZ-2.0 improvements (extreme enumeration pruning, pre-processing of blocks, early termination). Additionally, Slide reduction and self dual BKZ are supported.
It also includes a floating-point implementation of the Kannan-Fincke-Pohst algorithm that finds a shortest non-zero lattice vector. For the same task, the GaussSieve algorithm is also available in fplll. Finally, it contains a variant of the enumeration algorithm that computes a lattice vector closest to a given vector belonging to the real span of the lattice.
PARI/GP is a widely used computer algebra system designed for fast computations in number theory (factorisations, algebraic number theory, elliptic curves...), but it also contains a large number of other useful functions to compute with mathematical entities such as matrices, polynomials, power series, algebraic numbers, etc., and a lot of transcendental functions. PARI is also available as a C library to allow for faster computations.
GP2C, the GP to C compiler, translates GP scripts to PARI programs.
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.
Givaro is a C++ library implementing the basic arithmetic of various algebraic objects: prime fields, extension fields, finite fields, finite rings, polynomials, algebraic numbers, arbitrary precision integers and rationals (C++ wrappers over gmp), fixed precision integers. It also provides data-structures and templated classes for the manipulation of compound objects, such as vectors, matrices and univariate polynomials.
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.
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.