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.
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.
Open CASCADE is a set of libraries for the development of applications dealing with 3D CAD data or requiring industrial 3D capabilities. It includes C++ class libraries providing services for 3D surface and solid modeling, CAD data exchange, and visualization. It is used for development of specialized software dealing with 3D models in design (CAD), manufacturing (CAM), numerical simulation (CAE), measurement equipment (CMM), and quality control (CAQ) domains.
This is the certified version of the Open Cascade Technology (OCCT) library.
Open CASCADE is a set of libraries for the development of applications dealing with 3D CAD data or requiring industrial 3D capabilities. It includes C++ class libraries providing services for 3D surface and solid modeling, CAD data exchange, and visualization. It is used for development of specialized software dealing with 3D models in design (CAD), manufacturing (CAM), numerical simulation (CAE), measurement equipment (CMM), and quality control (CAQ) domains.
This is the certified version of the Open Cascade Technology (OCCT) library.
The C code of lrslib implements the reverse search algorithm for vertex enumeration and convex hull problems. Its input file format is compatible with cddlib. All computations are done exactly in either multiple precision or fixed integer arithmetic. Output is not stored in memory, so even problems with very large output sizes can sometimes be solved.
MUMPS (MUltifrontal Massively Parallel sparse direct Solver) solves a sparse system of linear equations A x = b using Gaussian elimination.
Libqalculate is a multi-purpose cli desktop calculator and library. It provides basic and advanced functionality. Features include customizable functions, unit calculations, and conversions, physical constants, symbolic calculations (including integrals and equations), arbitrary precision, uncertainty propagation, interval arithmetic, plotting and a user-friendly cli.
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.
This is a C version of the minpack minimization package. It has been derived from the fortran code using f2c and some limited manual editing. Extern C linkage permits the package routines to be called from C++.
This package provides a command-line interface to Mathics3.
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.
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.
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.
Elemental is a modern C++ library for distributed-memory dense and sparse-direct linear algebra, conic optimization, and lattice reduction.
HDF5 is a suite that makes possible the management of extremely large and complex data collections.
TypeTree is a template library for constructing and operating on statically typed trees of objects.
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.
The p4est software library enables the dynamic management of a collection of adaptive octrees, conveniently called a forest of octrees. p4est is designed to work in parallel and scales to hundreds of thousands of processor cores.
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.
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.
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.
CXSparse is a collection of sparse matrix algorithms for direct methods on both real and complex matrices.
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.
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.
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.