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.
The SPQR (SuiteSparseQR) package provides sparse QR factorization based on the multifrontal method, using BLAS for the frontal 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. This package variant uses ECL as the underlying Lisp implementation.
Vc provides portable, zero-overhead C++ types for explicitly data-parallel programming. It is a library designed to ease explicit vectorization of C++ code. Its types enable explicitly stating data-parallel operations on multiple values. The parallelism is therefore added via the type system. Vc has an intuitive API and provides portability between different compilers and compiler versions as well as portability between different vector instruction sets. Thus, an application written with Vc can be compiled for:
AVX and AVX2
SSE2 up to SSE4.2 or SSE4a
Scalar
MIC
NEON (in development)
NVIDIA GPUs / CUDA (in development)
The ELPA library provides efficient and scalable direct eigensolvers for symmetric 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 grid classes.
HDF5 is a suite that makes possible the management of extremely large and complex data collections.
GKlib is a library of various helper routines and frameworks used by software from KarypisLab, such as METIS.
lp_solve is a mixed integer linear programming solver based on the revised simplex and the branch-and-bound methods.
HPCombi is a C++17 header-only library using the SSE and AVX instruction sets, and some equivalents, for very fast manipulation of combinatorial objects such as transformations, permutations, and boolean matrices of small size.
This package provides a SAT solver based on conflict-driven clause learning.
This package uses PLT trampolines to provide a BLAS and LAPACK demuxing library.
CUDD is a library for manipulating decision diagrams. It supports binary decision diagrams, algebraic decision diagrams, and zero-suppressed binary decision diagrams.
Qhull computes the convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulation, and furthest-site Voronoi diagram. The source code runs in 2-d, 3-d, 4-d, and higher dimensions. Qhull implements the Quickhull algorithm for computing the convex hull. It handles roundoff errors from floating point arithmetic. It computes volumes, surface areas, and approximations to the convex hull.
Qhull does not support triangulation of non-convex surfaces, mesh generation of non-convex objects, medium-sized inputs in 9-D and higher, alpha shapes, weighted Voronoi diagrams, Voronoi volumes, or constrained Delaunay triangulations.
HDF-EOS2 is a software library built on HDF4 which supports the construction of data structures used in NASA's Earth Observing System (Grid, Point and Swath).
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.
Bonmin is a code for solving general MINLP (Mixed Integer NonLinear Programming) problems. It builds on top of Cbc and Ipopt.
Kiwi is an efficient C++ implementation of the Cassowary constraint solving algorithm. Kiwi has been designed from the ground up to be lightweight and fast. Kiwi ranges from 10x to 500x faster than the original Cassowary solver with typical use cases gaining a 40x improvement. Memory savings are consistently > 5x.
optizelle is a software library designed to solve nonlinear optimization problems. Four types of problem are considered: unconstrained, equality constrained, inequality constrained and constrained. Constraints may be applied as values of functions or sets of partial differential equations (PDEs).
Solution algorithms such as the preconditioned nonlinear conjugate gradient method, sequential quadratic programming (SQP) and the primal-dual interior-point method are made available. Interfaces are provided for applications written in C++ and Python. Parallel computation is supported via MPI.
GNU Dionysus is a convenient system for quickly retrieving the values of mathematical constants used in science and engineering. Values can be searched using a simple command-line tool, choosing from three databases: universal constants, atomic numbers, and constants related to semiconductors.
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.
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.
hmat-oss is hierarchical matrix library written in C++ with a C API. It contains a LU and LLt solver, and a few other things.
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.
ScaLAPACK is a Fortran 90 library of high-performance linear algebra routines on parallel distributed memory machines. ScaLAPACK solves dense and banded linear systems, least squares problems, eigenvalue problems, and singular value problems.