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.
SCOTCH is a set of programs and libraries which implement the static mapping and sparse matrix reordering algorithms developed within the SCOTCH project. Its purpose is to apply graph theory, with a divide and conquer approach, to scientific computing problems such as graph and mesh partitioning, static mapping, and sparse matrix ordering, in application domains ranging from structural mechanics to operating systems or bio-chemistry.
The GNU Scientific Library is a library for numerical analysis in C and C++. It includes a wide range of mathematical routines, with over 1000 functions in total. Subject areas covered by the library include: differential equations, linear algebra, Fast Fourier Transforms and random numbers.
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.
This package contains a set of routines for computing the LDL' factorization of sparse, symmetric matrices. Its focus lies on concise code.
This package provides a computer algebra system--an alternative to Wolfram.
The ELPA library provides efficient and scalable direct eigensolvers for symmetric matrices.
The C-library cddlib implements the Double Description Method of Motzkin et al. for generating all vertices (i.e. extreme points) and extreme rays of a general convex polyhedron given by a system of linear inequalities in arbitrary dimension. It can also be used for the converse operation of computing convex hulls.
PyGLM is a Python extension library which brings the OpenGL Mathematics (GLM) library to Python.
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.
Arcane is a development environment for parallel numerical calculation code. It supports the architectural aspects of a calculation code, such as data structures for meshing and parallelism, as well as more environment-related aspects such as dataset configuration.
Glucose is a SAT solver based on a scoring scheme introduced in 2009 for the clause learning mechanism of so called “Modern” SAT solvers. It is designed to be parallel.
HYPRE is a software library of high performance preconditioners and solvers for the solution of large, sparse linear systems of equations. It features multigrid solvers for both structured and unstructured grid problems.
SUNDIALS is a family of software packages implemented with the goal of providing robust time integrators and nonlinear solvers that can easily be incorporated into existing simulation codes.
The dune-functions module provides an abstraction layer for global finite element functions. Its two main concepts are functions implemented as callable objects, and bases of finite element spaces.
CyLP is a Python interface to COIN-OR’s Linear and mixed-integer program solvers (CLP, CBC, and CGL). CyLP’s unique feature is that you can use it to alter the solution process of the solvers from within Python. For example, you may define cut generators, branch-and-bound strategies, and primal/dual Simplex pivot rules completely in Python.
MUMPS (MUltifrontal Massively Parallel sparse direct Solver) solves a sparse system of linear equations A x = b using Gaussian elimination.
LAPACK is a Fortran 90 library for solving the most commonly occurring problems in numerical linear algebra.
SMTInterpol is an SMT solver, that can compute Craig interpolants for various theories.
Frama-C is an extensible and collaborative platform dedicated to source-code analysis of C software. The Frama-C analyzers assist you in various source-code-related activities, from the navigation through unfamiliar projects up to the certification of critical software.
This package contains an implementation of the POPF planner described in Forward-Chaining Partial Order Planning, that has been updated to compile with newer C++ compilers.
COLAMD is library for computing a permutation vector for a matrix with which the LU factorization becomes sparser.
SCS (splitting conic solver) is a numerical optimization package for solving large-scale convex cone problems.
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.
HDF5 is a suite that makes possible the management of extremely large and complex data collections.