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.
PDELab is a partial differential equations solver toolbox built on top of DUNE, the Distributed and Unified Numerics Environment.
SuiteSparse is a suite of sparse matrix algorithms, including: UMFPACK, multifrontal LU factorization; CHOLMOD, supernodal Cholesky; SPQR, multifrontal QR; KLU and BTF, sparse LU factorization, well-suited for circuit simulation; ordering methods (AMD, CAMD, COLAMD, and CCOLAMD); CSparse and CXSparse, a concise sparse Cholesky factorization package; and many other packages.
This package contains all of the above-mentioned parts.
This package uses PLT trampolines to provide a BLAS and LAPACK demuxing library.
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.
PALP is a set of programs for calculations with lattice polytopes and applications to toric geometry.
Calc is an arbitrary precision arithmetic system that uses a C-like language. It can be used as a calculator, an algorithm prototyper and as a mathematical research tool, and it comes with built in mathematical and programmatic functions.
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 grid classes.
This package provides a Mathics3 frontend for Jupyter Notebook and Marimo.
This package provides a free LDL factorisation routine for quasi-definite linear systems: Ax=b.
wxMaxima is a graphical user interface for the Maxima computer algebra system. It eases the use of Maxima by making most of its commands available through a menu system and by providing input dialogs for commands that require more than one argument. It also implements its own display engine that outputs mathematical symbols directly instead of depicting them with ASCII characters.
wxMaxima also features 2D and 3D inline plots, simple animations, mixing of text and mathematical calculations to create documents, exporting of input and output to TeX, and a browser for Maxima's manual including command index and full text searching.
Mongoose is a library for graph partitioning by computing edge cuts using a coarsening and refinement framework.
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.
This package provides character tables and a tokenizer for Mathics and the Wolfram language.
Voro++ is a software library for carrying out three-dimensional computations of the Voronoi tessellation. A distinguishing feature of the Voro++ library is that it carries out cell-based calculations, computing the Voronoi cell for each particle individually. It is particularly well-suited for applications that rely on cell-based statistics, where features of Voronoi cells (eg. volume, centroid, number of faces) can be used to analyze a system of particles.
Voro++ comprises of several C++ classes that can be built as a static library. A command-line utility is also provided that can use most features of the code. The direct cell-by-cell construction makes the library particularly well-suited to handling special boundary conditions and walls. It employs algorithms that are tolerant for numerical precision errors, it exhibits high performance, and it has been successfully employed on very large particle systems.
CXSparse is a collection of sparse matrix algorithms for direct methods on both real and complex matrices.
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.
This package provides a Cython interface to the C++ library primecount.
TypeTree is a template library for constructing and operating on statically typed trees of objects.
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.
CCOLAMD is library for computing a permutation vector for a matrix with which the LU factorization becomes sparser. It is a variant of COLAMD which has the the option to apply constraints to the ordering.
PDELab is a partial differential equations solver toolbox built on top of DUNE, the Distributed and Unified Numerics Environment.
This library provides portable Arbitrary-precision unsigned integer arithmetic in C, for calculating with large numbers. Basic arithmetic (+, -, *, /, %) and bitwise operations (&, |, ^. <<, >>) plus increments, decrements and comparisons are supported.
SLEPc is a software library for the solution of large sparse eigenproblems on parallel computers. It can be used for the solution of linear eigenvalue problems formulated in either standard or generalized form, as well as other related problems such as the singular value decomposition. The emphasis of the software is on methods and techniques appropriate for problems in which the associated matrices are sparse, for example, those arising after the discretization of partial differential equations.
qalculate-gtk is the GTK frontend for the Qalculate! multi-purpose calculator.