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.
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.
CXSparse is a collection of sparse matrix algorithms for direct methods on both real and complex matrices.
ALUGrid is an adaptive, loadbalancing, unstructured implementation of the DUNE grid interface supporting either simplices or cubes.
UMFPACK is a set of routines for solving unsymmetric sparse linear systems using the Unsymmetric MultiFrontal method and direct sparse LU factorization.
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.
SLEPc, the Scalable Library for Eigenvalue Problem Computations, is based on PETSc, the Portable, Extensible Toolkit for Scientific Computation. It employs the MPI standard for all message-passing communication. slepc4py provides Python bindings to almost all functions of SLEPc.
ARPACK-NG is a collection of Fortran77 subroutines designed to solve large scale eigenvalue problems.
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 Cython interface to the C++ library primecount.
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.
muParser is an extensible high performance math parser library. It is based on transforming an expression into a bytecode and precalculating constant parts of it.
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.
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.
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 DUNE UG grid classes.
KLU is a method for computing the LU factorization of sparse for real and complex matrices.
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.
This package contains software that will allow you to use existing neural network potential parameterizations to predict energies and forces (with standalone tools but also in conjunction with the MD software LAMMPS). In addition it is possible to train new neural network potentials with the provided training tools.
This DUNE module provides interface and implementation for shape functions defined on the DUNE reference elements. In addition to the shape function, interpolation operators and special keys are provided which can be used to assemble global function spaces on finite-element grids.
This package provides an interface and implementation for shape functions defined on the DUNE reference elements. In addition to the shape function, interpolation operators and special keys are provided which can be used to assemble global function spaces on finite-element grids.
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.
This package provides a tool to determine the backbone of a satisfiable formula. The backbone is the set of literals that are set to true in all models.
libcerf is a self-contained numeric library that provides an efficient and accurate implementation of complex error functions, along with Dawson, Faddeeva, and Voigt functions.
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.
This package provides a collection of basic programming tools for numerical computation, including Fast Fourier Transforms, Spherical Harmonic Transforms, non-equispaced Fourier transforms, as well as some concrete applications like 4pi convolution on the sphere and gridding/degridding of radio interferometry data.
An implementation of the maxflow algorithm described in An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Computer Vision. Yuri Boykov and Vladimir Kolmogorov. In IEEE Transactions on Pattern Analysis and Machine Intelligence, September 2004