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.
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. This package variant uses ECL as the underlying Lisp implementation.
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.
feedgnuplot is a tool to plot realtime and stored data from the command line, using gnuplot. It can read data from a pipe or file, make a variety of transformations, and render the result in the terminal or with an external viewer.
CUDD is a library for manipulating decision diagrams. It supports binary decision diagrams, algebraic decision diagrams, and zero-suppressed binary decision diagrams.
The Combinatorial BLAS (CombBLAS) is an extensible distributed-memory parallel graph library offering a small but powerful set of linear algebra primitives specifically targeting graph analytics.
This package provides a tool to determine the backbone of a satisfiable formula. The backbone is the set of literals that are set to true in all models.
The terminal calculator is a small program to help users of the GNU/Linux terminal do calculations simply and quickly. The formula to be calculated can be fed to tcalc through the command line.
Metamath is a tiny formal language and that can express theorems in abstract mathematics, with an accompyaning metamath executable that verifies databases of these proofs. There is a public database, set.mm, implementing first-order logic and Zermelo-Frenkel set theory with Choice, along with a large swath of associated, high-level theorems, e.g.: the fundamental theorem of arithmetic, the Cauchy-Schwarz inequality, Stirling's formula, etc. See the Metamath book.
MiniZinc is a high-level modeling language for constraint satisfaction and optimization problems. Models are compiled to FlatZinc, a language understood by many solvers.
CVXOPT is a package for convex optimization based on the Python programming language. Its main purpose is to make the development of software for convex optimization applications straightforward by building on Python’s extensive standard library and on the strengths of Python as a high-level programming language.
MUMPS (MUltifrontal Massively Parallel sparse direct Solver) solves a sparse system of linear equations A x = b using Gaussian elimination.
This package uses PLT trampolines to provide a BLAS and LAPACK demuxing library.
This package provides a computer algebra module for Lie groups. Documentation is available on http://www-math.univ-poitiers.fr/~maavl/pdf/LiE-manual.pdf.
This header-only C++ library implements conversion to and from half-precision floating point formats.
SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems of linear equations on high performance machines. The library is written in C and is callable from either C or Fortran. The library routines perform an LU decomposition with partial pivoting and triangular system solves through forward and back substitution. The library also provides threshold-based ILU factorization preconditioners.
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 DUNE UG grid classes.
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.
Ruy is a matrix multiplication library. Its focus is to cover the matrix multiplication needs of neural network inference engines. Its initial user has been TensorFlow Lite, where it is used by default on the ARM CPU architecture.
HDF4 is a library and multi-object file format for storing and managing data between machines. HDF4 is an older hierarchical data format, incompatible with HDF5.
UMFPACK is a set of routines for solving unsymmetric sparse linear systems using the Unsymmetric MultiFrontal method and direct sparse LU factorization.
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.
HDF4 is a library and multi-object file format for storing and managing data between machines. HDF4 is an older hierarchical data format, incompatible with HDF5.
HPCombi is a C++17 header-only library using the SSE and AVX instruction sets, and some equivalents, for very fast manipulation of combinatorial objects such as transformations, permutations, and boolean matrices of small size.
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:
non-linear least squares problems with bounds constraints;
general unconstrained optimization problems.