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.
The Interior Point Optimizer (IPOPT) is a software package for large-scale nonlinear optimization. It provides C++, C, and Fortran interfaces.
LAPACK is a Fortran 90 library for solving the most commonly occurring problems in numerical linear algebra.
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.
Bitwuzla is a SMT solver for the theories of fixed-size bit-vectors, floating-point arithmetic, arrays, uninterpreted functions and their combinations.
SYMPOW is a mathematical program to compute special values of symmetric power elliptic curve L-functions; it can compute up to about 64 digits of precision.
The dune-subgrid module marks elements of another hierarchical dune grid. The set of marked elements can then be accessed as a hierarchical dune grid in its own right. Dune-Subgrid provides the full grid interface including adaptive mesh refinement.
cvc5 is a solver for SMT problems. It processes input in the standard SMT-LIB format.
SuiteSparse is a suite of sparse matrix algorithms. This package contains a library with common configuration options.
CryptoMiniSat is an incremental SAT solver with both command line and library (C++, C, Python) interfaces. The command-line interface takes a CNF as an input in the DIMACS format with the extension of XOR clauses. The library interfaces mimic this and also allow incremental solving, including assumptions.
Lis is a parallel software library for solving discretized linear equations and eigenvalue problems that arise in the numerical solution of partial differential equations using iterative methods.
4ti2 implements algorithms for solving algebraic, geometric and combinatorial problems on linear spaces. Among others, it solves systems of linear equations, computes extreme rays of polyhedral cones, solves integer programming problems and computes Markov bases for statistics.
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.
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.
mCRL2 (micro Common Representation Language 2) is a formal specification language for describing concurrent discrete event systems. Its toolset supports analysis and automatic verification, linearisation, simulation, state-space exploration and generation, and tools to optimise and analyse specifications. Also, state spaces can be manipulated, visualised and analysed.
CHOLMOD is a set of routines for factorizing sparse symmetrix positive definite matrices, updating/downdating sparse Cholesky factorizations and other related operations.
HYPRE is a software library of high performance preconditioners and solvers for the solution of large, sparse linear systems of equations on parallel computers. It features parallel multigrid solvers for both structured and unstructured grid problems.
AIGER is a format, library and set of utilities for AIGs. The focus is on conversion utilities and a generic reader and writer API.
SLEEF (SIMD Library for Evaluating Elementary Functions) is a library that implements vectorized versions of all C99 real floating point math functions. It can utilize SIMD instructions that are available on modern processors.
OpenBLAS is a Basic Linear Algebra Subprograms (BLAS) library forked from the GotoBLAS2-1.13 BSD version.
ALUGrid is an adaptive, loadbalancing, unstructured implementation of the DUNE grid interface supporting either simplices or cubes.
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.
FLANN is a library for performing fast approximate nearest neighbor searches in high dimensional spaces. It implements a collection of algorithms and a system for automatically choosing the best algorithm and optimum parameters depending on the dataset.
FLANN is written in C++ and contains bindings for C, Octave and Python.
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.
SuperLU_DIST is a parallel extension to the serial SuperLU library. It is targeted for distributed memory parallel machines. SuperLU_DIST is implemented in ANSI C, and MPI for communications.