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.
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.
Bonmin is a code for solving general MINLP (Mixed Integer NonLinear Programming) problems. It builds on top of Cbc and Ipopt.
UMFPACK is a set of routines for solving unsymmetric sparse linear systems using the Unsymmetric MultiFrontal method and direct sparse LU factorization.
reduceLCS is an implementation of the Reduce-Expand algorithm for LCS. It is a fast program to compute the approximate Longest Commons Subsequence of a set of strings.
GNU C-Graph is a tool for demonstrating the theory of convolution. Thus, it can serve as an excellent aid to students of signal and systems theory in visualizing the convolution process. Rather than forcing the student to write code, the program offers an intuitive interface with interactive dialogs to guide them.
GKlib is a library of various helper routines and frameworks used by software from KarypisLab, such as METIS.
GNU Units converts numeric quantities between units of measure. It can handle scale changes through adaptive usage of standard scale prefixes (micro-, kilo-, etc.). It can also handle nonlinear conversions such as Fahrenheit to Celsius. Its interpreter is powerful enough to be used effectively as a scientific calculator.
KLU is a method for computing the LU factorization of sparse for real and complex matrices.
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 basic DUNE geometry classes.
GNU Octave is a high-level interpreted language that is specialized for numerical computations. It can be used for both linear and non-linear applications and it provides great support for visualizing results. Work may be performed both at the interactive command-line as well as via script files.
The Common Data Access toolbox (CODA) provides a set of interfaces for reading remote sensing data from earth observation data files. It consists of command line applications and interfaces to the C, Fortran, Python, and Java programming languages.
METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes, and producing fill-reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes.
nauty (No AUTomorphisms, Yes?) is a set of procedures for computing automorphism groups of graphs and digraphs.
nauty computes graph information in the form of a set of generators, the size of the group, and the orbits of the group; it can also produce a canonical label. The nauty suite is written in C and comes with a command-line interface, a collection of command-line tools, and an Application Programming Interface (API).
This package provides the static libraries required to run programs compiled against the nauty library.
DUNE, the Distributed and Unified Numerics Environment is a modular toolbox for solving partial differential equations (PDEs) with grid-based methods.
This is the iterative solver template library which provides generic sparse matrix/vector classes and a variety of solvers based on these classes. A special feature is the use of templates to exploit the recursive block structure of finite element matrices at compile time. Available solvers include Krylov methods, (block-) incomplete decompositions and aggregation-based algebraic multigrid.
The Zoltan library is a collection of data management services for parallel, unstructured, adaptive, and dynamic applications. It simplifies the load-balancing, data movement, unstructured communication, and memory usage difficulties that arise in dynamic applications such as adaptive finite-element methods, particle methods, and crash simulations. Zoltan's data-structure neutral design also lets a wide range of applications use it without imposing restrictions on application data structures. Its object-based interface provides a simple and inexpensive way for application developers to use the library and researchers to make new capabilities available under a common interface.
Mongoose is a library for graph partitioning by computing edge cuts using a coarsening and refinement framework.
Qalculate! is a multi-purpose calculator; this package contains its command line interface qalc and library libqalculate. Features include:
arbitrary precision and interval arithmetic
currency conversion
physical constants
plotting via gnuplot
symbolic calculations (including integrals and equations)
uncertainty propagation
unit calculations and conversions
user-defined functions
Aris is a program for performing logical proofs. It supports propositional and predicate logic, as well as Boolean algebra and arithmetical logic. In addition to its predefined inference and equivalence rules, Aris also supports references to older proofs. Its use of standard logical symbols and its natural deduction interface make it easy to use for beginners.
MUMPS (MUltifrontal Massively Parallel sparse direct Solver) solves a sparse system of linear equations A x = b using Gaussian elimination.
This package contains a set of routines for computing the LDL' factorization of sparse, symmetric matrices. Its focus lies on concise code.
Gfan is a software package for computing Gröbner fans and tropical varieties.
HDF5 is a suite that makes possible the management of extremely large and complex data collections.
PETSc, pronounced PET-see (the S is silent), is a suite of data structures and routines for the scalable (parallel) solution of scientific applications modeled by partial differential equations.
CLP is a high quality linear programming solver. Its main strengths are its dual and primal Simplex algorithms. It also has a barrier algorithm for linear and quadratic objectives. There are limited facilities for nonlinear and quadratic objectives using the Simplex algorithm.