{"category":{"categoryid":318,"name":"sci-libs","summary":"The sci-libs category contains various science-related libraries."},"packages":[{"categoryid":318,"description":"Header-only C++ interface for libhdf5","firstseen":"2023-10-27T03:53:18.628029","name":"HighFive","packageid":76690},{"categoryid":318,"description":"acceleration package for neural network computations","firstseen":"2022-05-18T13:53:42.589204","name":"NNPACK","packageid":74982},{"categoryid":318,"description":"Visual Servoing Platform: visual tracking and visual servoing library","firstseen":"2015-03-12T14:37:49.547120","maintainer":"aballier@gentoo.org","maintainername":"Alexis Ballier","name":"ViSP","packageid":63212,"summary":"ViSP standing for Visual Servoing Platform is a modular cross platform library that allows prototyping and developing applications using visual tracking and visual servoing technics at the heart of the researches done by Inria Lagadic team. ViSP is able to compute control laws that can be applied to robotic systems. It provides a set of visual features that can be tracked using real time image processing or computer vision algorithms. ViSP provides also simulation capabilities. ViSP can be useful in robotics, computer vision, augmented reality and computer animation."},{"categoryid":318,"description":"library of floating-point neural network inference operators","firstseen":"2022-05-17T14:07:31.959670","name":"XNNPACK","packageid":74980},{"categoryid":318,"description":"Automatic differentiation system for C\/C++","firstseen":"2012-07-10T14:38:16.682291","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"adolc","packageid":59563,"summary":"The ADOLC system automatically calculates exact derivatives of a C\/C++ function. It uses C++ overloading to record arithmetic operations, which it plays back later in various ways to calculate the requested values."},{"categoryid":318,"description":"Numerical analysis and data processing library","firstseen":"2013-06-22T13:41:01.197238","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"alglib","packageid":60915,"summary":"ALGLIB is a cross-platform numerical analysis and data processing library. It supports several programming languages (C++, C#, Pascal, VBA) and several operating systems (Windows, Linux, Solaris). ALGLIB features include: * Linear algebra (direct algorithms, EVD\/SVD) * Solvers (linear and nonlinear) * Interpolation * Optimization * Fast Fourier transforms * Numerical integration * Linear and nonlinear least-squares fitting * Ordinary differential equations * Special functions * Statistics (descriptive statistics, hypothesis testing) * Data analysis (classification\/regression, including neural networks) * Multiple precision versions of linear algebra, interpolation optimization and * others algorithms (using MPFR for floating point computations) Why to choose ALGLIB? Because it is: * portable. It can be compiled almost anywhere using almost any compiler (see compatibility matrix for more info). * easy to use. It supports many programming languages. If you use one language, you don't need to study another (FORTRAN, for example) to compile and link an external library. * open source. It can be used for free under GPL 2+. * suited for commercial users too. Those who want to use ALGLIB in commercial applications can buy commercial license without copyleft requirement."},{"categoryid":318,"description":"Library to order a sparse matrix prior to Cholesky factorization","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"amd","packageid":42168,"summary":"AMD is a set of routines for ordering a sparse matrix prior to Cholesky factorization (or for LU factorization with diagonal pivoting). There are versions in both C and Fortran."},{"categoryid":318,"description":"Library for performance portable algorithms for geometric search","firstseen":"2022-06-12T07:29:14.049834","name":"arborx","packageid":75058,"summary":"ArborX is an open-source library designed to provide performance portable algorithms for geometric search, similarly to nanoflann and Boost Geometry."},{"categoryid":318,"description":"Streamlined C++ linear algebra library","firstseen":"2011-03-07T14:39:04.589836","maintainer":"dilfridge@gentoo.org","maintainername":"Gentoo Science Project","name":"armadillo","packageid":57047,"summary":"Armadillo is a C++ linear algebra library (matrix maths) aiming towards a good balance between speed and ease of use. Integer, floating point and complex numbers are supported, as well as a subset of trigonometric and statistics functions. Various matrix decompositions are provided through optional integration with LAPACK and ATLAS libraries. A delayed evaluation approach is employed (during compile time) to combine several operations into one and reduce (or eliminate) the need for temporaries. This is accomplished through recursive templates and template meta-programming."},{"categoryid":318,"description":"Arnoldi package library to solve large scale eigenvalue problems","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"arpack","packageid":51416,"summary":"The ARnoldi PACKage is a library of routines capable of solving large scale symmetric, nonsymmetric, and generalized eigenproblems. The software is designed to compute a few eigenvalues with user specified features such as those of largest real part or largest magnitude. Storage requirements are on the order of n*k locations. No auxiliary storage is required. A set of Schur basis vectors for the desired k-dimensional eigen-space is computed which is numerically orthogonal to working precision. Numerically accurate eigenvectors are available on request."},{"categoryid":318,"description":"Arbitrary precision float arithmetics and functions","firstseen":"2010-05-04T00:54:45.661860","maintainer":"grozin@gentoo.org","maintainername":"Andrey Grozin","name":"arprec","packageid":47825},{"categoryid":318,"description":"Automatically Tuned Linear Algebra Software","firstseen":"2016-03-08T14:45:23.589958","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"atlas","packageid":65103,"summary":"ATLAS is an approach for the automatic generation and optimization of numerical software. Currently ATLAS supplies optimized versions for the complete set of linear algebra kernels known as the Basic Linear Algebra Subroutines (BLAS) for both c and F77 interfaces. It can also build a subset of the linear algebra routine LAPACK library or the full LAPACK using the reference LAPACK from Netlib."},{"categoryid":318,"description":"Advanced molecule editor and visualizer 2 - libraries","firstseen":"2014-01-17T14:45:42.163541","maintainer":"sci-chemistry@gentoo.org","maintainername":"Gentoo Chemistry Project","name":"avogadrolibs","packageid":61838},{"categoryid":318,"description":"BLAS-like Library Instantiation Software Framework","firstseen":"2019-06-26T06:44:43.067433","name":"blis","packageid":69909,"summary":"BLIS is a portable software framework for instantiating high-performance BLAS-like dense linear algebra libraries. The framework was designed to isolate essential kernels of computation that, when optimized, immediately enable optimized implementations of most of its commonly used and computationally intensive operations. BLIS is written in ISO C99 and available under a new\/modified\/3-clause BSD license. While BLIS exports a new BLAS-like API, it also includes a BLAS compatibility layer which gives application developers access to BLIS implementations via traditional BLAS routine calls. An object-based API unique to BLIS is also available."},{"categoryid":318,"description":"Compute Automorphism Groups and Canonical Labelings of Graphs","firstseen":"2015-03-09T14:36:01.288124","maintainer":"ottxor@gentoo.org","maintainername":"Christoph Junghans","name":"bliss","packageid":63198},{"categoryid":318,"description":"spinoff from folium, host the non-map-specific features","firstseen":"2021-08-01T14:28:06.030199","name":"branca","packageid":73264,"summary":"This library is a spinoff from folium, that would host the non-map-specific features. It may become a HTML+JS generation library in the future. It is based on Jinja2 only."},{"categoryid":318,"description":"A C++ library for polynomials over boolean rings","firstseen":"2020-03-20T00:24:41.147614","name":"brial","packageid":70939,"summary":"BRiAl is a C++ library (the successor to PolyBoRi) that provides high-level data types for Boolean polynomials and monomials, exponent vectors, as well as for the underlying polynomial rings and subsets of the powerset of the Boolean variables."},{"categoryid":318,"description":"Algorithm for matrix permutation into block triangular form","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"btf","packageid":47580,"summary":"The Block Triangular Form is a library of routines offering permutation of an unsymmetric matrix (square or rectangular) into its block upper triangular form (more precisely, it computes a Dulmage-Mendelsohn decomposition)."},{"categoryid":318,"description":"Binary Decision Diagram Package","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"buddy","packageid":43091,"summary":"A Binary Decision Diagram library, with :many highly efficient vectorized BDD operations,dynamic variable reordering,automated garbage collection,a C++ interface with automatic reference counting,and much more."},{"categoryid":318,"description":"A deep learning framework","firstseen":"2022-06-26T09:11:37.637346","name":"caffe2","packageid":75096},{"categoryid":318,"description":"Library to order a sparse matrix prior to Cholesky factorization","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"camd","packageid":49083,"summary":"Constrained Approximate Minimum Degree ordering is a set of routines for ordering a sparse matrix prior to Cholesky factorization (or for LU factorization with diagonal pivoting)."},{"categoryid":318,"description":"Object-oriented tool suite for chemical kinetics, thermodynamics, and transport","firstseen":"2018-11-28T11:12:40.064062","name":"cantera","packageid":69561,"summary":"Cantera is an open-source suite of object-oriented software tools for problems involving chemical kinetics, thermodynamics, and\/or transport processes."},{"categoryid":318,"description":"Python package for geospatial data processing and analysis","firstseen":"2020-03-29T19:13:36.753350","name":"cartopy","packageid":70961,"summary":"Cartopy is a Python package designed for geospatial data processing in order to produce maps and other geospatial data analyses. Key features of cartopy are its object oriented projection definitions, and its ability to transform points, lines, vectors, polygons and i images between those projections."},{"categoryid":318,"description":"C++ interface for cfitsio","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"ccfits","packageid":46883,"summary":"CCfits is an object oriented interface to the cfitsio library. It is designed to make the capabilities of cfitsio available to programmers working in C++. It is written in ANSI C++ and implemented using the C++ Standard Library with namespaces, exception handling, and member template functions."},{"categoryid":318,"description":"Constrained Column approximate minimum degree ordering algorithm","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"ccolamd","packageid":54582,"summary":"Constrained COLAMD computes an column approximate minimum degree ordering algorithm, (like COLAMD), but it can also be given a set of ordering constraints."},{"categoryid":318,"description":"Another implementation of the double description method","firstseen":"2010-11-13T14:34:00.987409","maintainer":"sci-mathematics@gentoo.org","maintainername":"Gentoo Mathematics Project","name":"cdd+","packageid":56540,"summary":"The program cdd+ is a C++ implementation of the Double Description Method of Motzkin et al. for generating all vertices (i.e. extreme points) and extreme rays of a general convex polyhedron in R^d given by a system of linear inequalities: P = { x : A x <= b } where A is an m x d real matrix and b is a real m dimensional vector."},{"categoryid":318,"description":"C library implementing the Double Description Method","firstseen":"2010-11-09T14:34:10.608032","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"cddlib","packageid":56517,"summary":"The C-library cddlib is a C implementation of the Double Description Method of Motzkin et al. for generating all vertices (i.e. extreme points) and extreme rays of a general convex polyhedron in R^d given by a system of linear inequalities: P = { x=(x1, ..., xd)^T : b - A x >= 0 } where A is a given m x d real matrix, b is a given m-vector and 0 is the m-vector of all zeros. The program can be used for the reverse operation (i.e. convex hull computation). This means that one can move back and forth between an inequality representation and a generator (i.e. vertex and ray) representation of a polyhedron with cdd. Also, cdd can solve a linear programming problem, i.e. a problem of maximizing and minimizing a linear function over P."},{"categoryid":318,"description":"Common Data Format I\/O library for multi-dimensional data sets","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"cdf","packageid":50831,"summary":"Common Data Format (CDF) is a conceptual data abstraction for storing multi-dimensional data sets. The basic component of CDF is a software programming interface that is a device independent view of the CDF data model. The application developer is insulated from the actual physical file format for reasons of conceptual simplicity, device independence, and future expandability. CDF files created on any given platform can be transported to any other platform on to which CDF is ported and used with any CDF tools or layered applications. A more detailed introduction to CDF can be found in the CDF User's Guide. A comparison between CDF, netCDF, HDF and HDF5 is available at http:\/\/cdf.gsfc.nasa.gov\/html\/FAQ.html."},{"categoryid":318,"description":"Nonlinear least-squares minimizer","firstseen":"2012-11-20T14:36:19.681228","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"ceres-solver","packageid":60035,"summary":"Ceres Solver is a portable C++ library that allows for modeling and solving large complicated nonlinear least squares problems. It features: * automatic differentiation * robust loss functions * local parameterizations * threaded Jacobian evaluators and linear solvers * Levenberg-Marquardt and Dogleg (Powell, Subspace) solvers * Dense QR and Cholesky factorization (using Eigen) for small problems * Sparse Cholesky factorization (using SuiteSparse) for large sparse problems * Specialized solvers for bundle adjustment problems in computer vision * Iterative linear solvers for general sparse and bundle adjustment problems"},{"categoryid":318,"description":"C and Fortran library for manipulating FITS files","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci-astronomy@gentoo.org","maintainername":"Gentoo Astronomy Project","name":"cfitsio","packageid":55687,"summary":"CFITSIO is a library of C and Fortran subroutines for reading and writing data files in FITS (Flexible Image Transport System) data format. CFITSIO provides simple high-level routines for reading and writing FITS files that insulate the programmer from the internal complexities of the FITS format. CFITSIO also provides advanced features for manipulating and filtering the information in FITS files."},{"categoryid":318,"description":"Conjugate gradient Codes for large sparse linear systems","firstseen":"2010-10-31T14:36:36.232433","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"cgcode","packageid":56457},{"categoryid":318,"description":"CFD General Notation System standard library","firstseen":"2014-07-25T13:39:06.291559","maintainer":"slis@gentoo.org","maintainername":"Gentoo Science Project","name":"cgnslib","packageid":62414,"summary":"The Computational Fluid Dynamics General Notation System (CGNS) provides a general, portable, and extensible standard for the storage and retrieval of computational fluid dynamics (CFD) analysisdata. It consists of a collection of conventions, and free and open software implementing those conventions. It is self-descriptive, machine-independent, well-documented, and administered by an international steering committee."},{"categoryid":318,"description":"Sparse Cholesky factorization and update\/downdate library","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"cholmod","packageid":47950},{"categoryid":318,"description":"f2c'ed version of LAPACK","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"clapack","packageid":48831,"summary":"LAPACK is a comprehensive library that does linear algebra operations including matrix inversions, least squared solutions to linear sets of equations, eigenvector analysis, singular value decomposition, etc. It is a very comprehensive and reputable package that has found extensive use in the scientific community. This package installs the reference C implementation from Netlib, generated from f2c."},{"categoryid":318,"description":"Clashscore-db for clashlist","firstseen":"2010-07-22T14:35:51.977734","maintainer":"sci-chemistry@gentoo.org","maintainername":"Gentoo Chemistry Project","name":"clashscore-db","packageid":56078},{"categoryid":318,"description":"Library containing BLAS routines for OpenCL","firstseen":"2017-01-04T16:09:22.898679","name":"clblas","packageid":66350,"summary":"clBLAS is the code for the OpenCL BLAS portion of clMath. The complete set of BLAS level 1, 2 and 3 routines is implemented. See Netlib BLAS for the list of supported routines. In addition to GPU devices, the library also supports running on CPU devices to facilitate debugging and multicore programming."},{"categoryid":318,"description":"Tuned OpenCL BLAS","firstseen":"2017-01-04T16:09:22.898679","name":"clblast","packageid":66351,"summary":"CLBlast is a modern, lightweight, performant and tunable OpenCL BLAS library written in C++11. It is designed to leverage the full performance potential of a wide variety of OpenCL devices from different vendors, including desktop and laptop GPUs, embedded GPUs, and other accelerators. CLBlast implements BLAS routines: basic linear algebra subprograms operating on vectors and matrices."},{"categoryid":318,"description":"Class library (C++) for numbers","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci-mathematics@gentoo.org","maintainername":"Gentoo Mathematics Project","name":"cln","packageid":46201,"summary":"A Class Library for Numbers is a library for computations with all kinds of numbers in arbitrary precision. It has a set of number classes, including integers (with unlimited precision), reals with various precisions (including unlimited), rationals, complex numbers and polynomials. The kernel is written in assembly language. It uses automatic garbage collection."},{"categoryid":318,"description":"C implementation of the MINPACK nonlinear optimization library","firstseen":"2011-06-10T14:41:09.644410","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"cminpack","packageid":57507,"summary":"Minpack includes software for solving nonlinear equations and nonlinear least squares problems. Five algorithmic paths each include a core subroutine and an easy-to-use driver. The algorithms proceed either from an analytic specification of the Jacobian matrix or directly from the problem functions. The paths include facilities for systems of equations with a banded Jacobian matrix, for least squares problems with a large amount of data, and for checking the consistency of the Jacobian matrix with the functions. This is the C re-write of the original fortran minpack implementation."},{"categoryid":318,"description":"MINPACK-1 Least Squares Fitting Library in C","firstseen":"2012-11-20T14:36:19.681228","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"cmpfit","packageid":60036,"summary":"MPFIT uses the Levenberg-Marquardt technique to solve the least-squares problem. In its typical use, MPFIT will be used to fit a user-supplied function (the \"model\") to user-supplied data points (the \"data\") by adjusting a set of parameters. MPFIT is based upon MINPACK-1 (LMDIF.F) by More' and collaborators."},{"categoryid":318,"description":"Ampl Solver Library (ASL)","firstseen":"2024-10-14T08:35:28.668562","name":"coinasl","packageid":77770},{"categoryid":318,"description":"COIN-OR Framework for implementing parallel graph search algorithms","firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-alps","packageid":61811,"summary":"CHiPPS is the COIN-OR High-Performance Parallel Search Framework, a framework for implementing parallel algorithms based on tree search. The current CHiPPS architecture consists of three layers. The Abstract Library for Parallel Search (ALPS) is the base layer of a hierarchy consisting of implementations of various tree search algorithms for specific problem types."},{"categoryid":318,"description":"COIN-OR Branch-Cut-Price Framework","firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-bcp","packageid":61812,"summary":"BCP is a parallel framework for implementing branch, cut, and price algorithms for solving mixed integer programs (MIPs). BCP provides the user with an object-oriented framework that can be used to develop an efficient problem class specific MIP solver without all the implementational effort. involved with implementing a branch and bound framework from scratch."},{"categoryid":318,"description":"COIN-OR BiCePS data handling library","firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-bcps","packageid":61813,"summary":"CHiPPS is the COIN-OR High-Performance Parallel Search Framework, a framework for implementing parallel algorithms based on tree search. The current CHiPPS architecture consists of three layers. The Branch, Constrain, and Price Software (BiCePS) is a data management layer built on top of ALPS for implementing relaxation-based branch and bound algorithms."},{"categoryid":318,"description":"COIN-OR BiCePS Linear Integer Solver","firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-blis","packageid":61814,"summary":"CHiPPS is the COIN-OR High-Performance Parallel Search Framework, a framework for implementing parallel algorithms based on tree search. The current CHiPPS architecture consists of three layers. The BiCePS Linear Integer Solver (BLIS) is a concretization of the BiCePS layer for solving mixed-integer linear programs."},{"categoryid":318,"description":"COIN-OR Basic Open-source Nonlinear Mixed INteger programming","firstseen":"2014-01-16T14:35:40.742019","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-bonmin","packageid":61833,"summary":"BONMIN (Basic Open-source Nonlinear Mixed INteger programming) is an open-source code for solving general MINLP (Mixed Integer NonLinear Programming) problems."},{"categoryid":318,"description":"COIN-OR branch-and-cut mixed integer program solver","firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-cbc","packageid":61815,"summary":"COIN-OR Branch-and-Cut is a Mixed integer linear programming solver. It uses many of the COIN-OR components and is designed to be used with COIN-OR CLP or COIN-OR Dylp. It is available as a library and as a standalone solver."},{"categoryid":318,"description":"COIN-OR cut-generation library","firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-cgl","packageid":61816,"summary":"The COIN-OR Cut Generation Library (Cgl) is an open collection of cutting plane implementations (\"cut generators\") for use in teaching, research, and applications. Cgl can be used with other COIN-OR packages that make use of cuts, such as the mixed-integer linear programming."},{"categoryid":318,"description":"COIN-OR linear programming solver","firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-clp","packageid":61817,"summary":"Clp (Coin-OR linear programming) is an open-source linear programming solver written in C++. It is primarily meant to be used as a callable library, but a basic, stand-alone executable version is also available. It is designed to find solutions of constrained linear mathematical optimization problems."},{"categoryid":318,"description":"COIN-OR Convex Over and Under ENvelopes for Nonlinear Estimation","firstseen":"2014-01-16T14:35:40.742019","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-couenne","packageid":61834,"summary":"Couenne (Convex Over and Under ENvelopes for Nonlinear Estimation) is a spatial branch and bound algorithm that implements linearization, bound reduction, and branching techniques for Mixed-integer, Nonlinear Programming (MINLP) problems. The purpose of Couenne is to find global optima of nonconvex MINLPs."},{"categoryid":318,"description":"COIN-OR C++ Algorithmic Differentiation","firstseen":"2014-01-16T14:35:40.742019","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-cppad","packageid":61835,"summary":"We refer to the step by step conversion from an algorithm that computes function values to an algorithm that computes derivative values as Algorithmic Differentiation (AD); often referred to as automatic differentiation. Given a C++ algorithm that computes function values, CppAD generates an algorithm that computes corresponding derivative values (of arbitrary order using either forward or reverse mode)."},{"categoryid":318,"description":"COIN-OR C Library for Semi-Definite Programming","firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-csdp","packageid":61818,"summary":"CSDP is a library of routines that implements a predictor corrector variant of the semidefinite programming algorithm of Helmberg, Rendl, Vanderbei, and Wolkowicz. The main advantages of this code are that it is written to be used as a callable subroutine, it is written in C for efficiency, the code runs in parallel on shared memory multi-processor systems, and it makes effective use of sparsity in the constraint matrices. CSDP has been compiled on many different systems. The code should work on any system with an ANSI C Compiler and BLAS\/LAPACK libraries."},{"categoryid":318,"description":"COIN-OR Decomposition in Integer Programming library","firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-dip","packageid":61819,"summary":"DIP (Decomposition for Integer Programming) is an open-source extensible software framework for implementing decomposition-based bounding algorithms for use in solving large-scale discrete optimization problems. The framework provides a simple API for experimenting with various decomposition-based algorithms, such as Dantzig-Wolfe decomposition, Lagrangian relaxation, and various cutting plane methods."},{"categoryid":318,"description":"COIN-OR dynamic simplex linear program solver","firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-dylp","packageid":61820,"summary":"DyLP is designed to find solutions of constrained linear mathematical optimization problems. To this end, it is using a full implementation of the so called dynamic simplex algorithm for linear programming. DyLP is part of the larger COIN-OR initiative (Computational Infrastructure for Operations Research)."},{"categoryid":318,"description":"COIN-OR algebraic modeling language for linear optimization","firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-flopcpp","packageid":61821,"summary":"The COIN-OR Formulation of Linear Optimization Problems in C++ (FLOPC++) is a linear optimization modelling language that can be specified in a declarative style, similar to algebraic modelling languages such as GAMS and AMPL, within a C++ program. As a result the traditional strengths of algebraic modelling languages are preserved, while embedding linear optimization models in software applications is facilitated."},{"categoryid":318,"description":"COIN-OR lightweight API for COIN-OR libraries CLP, CBC, and CGL","firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-mp","packageid":61822,"summary":"The COmputational INfrastructure for Operations Research (COIN-OR) MP is a C-API interface library that supports most of the functionality of the CLP (Coin LP), CBC (Coin Branch-and-Cut), and CGL (Cut Generation Library) projects."},{"categoryid":318,"description":"COIN-OR netlib models","firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-netlib","packageid":61823},{"categoryid":318,"description":"COIN-OR Open Solver Interface","firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-osi","packageid":61824,"summary":"The COIN-OR Open Solver Interface is a uniform API for interacting with callable solver libraries. It supports linear programming solvers as well as the ability to \"finish off\" a mixed-integer problem calling the solver library's MIP solver."},{"categoryid":318,"description":"COIN-OR Sample models","firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-sample","packageid":61825,"summary":"The COmputational INfrastructure for Operations Research (COIN-OR) sample models. These datasets are required to run the test suites of most COIN-OR packages in Gentoo."},{"categoryid":318,"description":"COIN-OR Stochastic modelling interface","firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-smi","packageid":61826,"summary":"The COIN-OR Stochastic Modeling Interface (SMI) is an interface for problems in which uncertainty and optimization appear together. There are many modeling and algorithmic approaches that could belong here, like: recourse programming, chance constrained programming, stochastic control and dynamic programming, robust optimization, etc, etc. SMI is intended to be like OSI in the sense that an SmiXX object is an implementation derived from a base class that takes care of a number of commonly encountered programming issues, like handling probability distributions, managing problem generation, interacting with solvers to obtain solution information, etc."},{"categoryid":318,"description":"COIN-OR solver for mixed-integer linear programs","firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-symphony","packageid":61827,"summary":"SYMPHONY is a generic mixed-integer linear programs (MILP) solver, callable library, and extensible framework for implementing customized solvers. SYMPHONY has a number of advanced capabilities, including the ability to solve multi-objective MILPs, the ability to warm start its solution procedure. SYMPHONY is part of the larger COIN-OR initiative (Computational Infrastructurefor Operations Research)."},{"categoryid":318,"description":"COIN-OR Matrix, Vector and other utility classes","firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-utils","packageid":61828,"summary":"CoinUtils (Coin-or Utilities) is a collection of classes that are generally useful to COmputational INfrastructure for Operations Research (COIN-OR) projects. These include vector, matrix, mps file reading classes."},{"categoryid":318,"description":"COIN-OR volume algorithm linear program solver","firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-vol","packageid":61829,"summary":"Volume Algorithm is part of COIN-OR (COmputational INfrastructure for Operations Research) project. Vol is an implementation of a subgradient method that produces primal as well as dual solutions."},{"categoryid":318,"description":"Column approximate minimum degree ordering algorithm","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"colamd","packageid":46628,"summary":"The COLumn Approximate Minimum Degree ordering algorithm computes a permutation vector P such that the LU factorization of A (:,P) tends to be sparser than that of A. The Cholesky factorization of (A (:,P))\\'*(A (:,P)) will also tend to be sparser than that of A\\'*A. SYMAMD is a symmetric minimum degree ordering method based on COLAMD, available as a MATLAB-callable function. It constructs a matrix M such that M\\'*M has the same pattern as A, and then uses COLAMD to compute a column ordering of M."},{"categoryid":318,"description":"C++ algorithms for specialized vertex coloring problems","firstseen":"2012-04-13T14:35:47.898872","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"colpack","packageid":59129,"summary":"ColPack is a package comprising of implementations of algorithms for the specialized vertex coloring problems as well as algorithms for a variety of related supporting tasks in derivative computation."},{"categoryid":318,"description":"High Performance Composable Kernel for AMD GPUs","firstseen":"2024-03-08T19:42:23.330062","name":"composable-kernel","packageid":77156},{"categoryid":318,"description":"Utility library for quaternion arithmetic \/ rotation math (ANSI C implemented)","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"cqrlib","packageid":43205},{"categoryid":318,"description":"Extended sparse matrix package","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"cxsparse","packageid":48965,"summary":"CXSparse is an extended version of CSparse, a sparse matrix package, with support for double or complex matrices, with int or long integers."},{"categoryid":318,"description":"Access and share datasets for Audio, Computer Vision, and NLP tasks","firstseen":"2023-05-07T21:35:29.506194","name":"datasets","packageid":76121},{"categoryid":318,"description":"The DICOM Toolkit","firstseen":"2015-11-30T14:39:40.906146","maintainer":"sci-biology@gentoo.org","name":"dcmtk","packageid":64748},{"categoryid":318,"description":"Solving partial differential equations with the finite element method","firstseen":"2019-08-05T07:39:31.134254","name":"dealii","packageid":70040,"summary":"deal.II is a C++ program library targeted at the computational solution of partial differential equations using adaptive finite elements. It uses state-of-the-art programming techniques to offer you a modern interface to the complex data structures and algorithms required."},{"categoryid":318,"description":"Extremely fast library for floating-point convolution","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"djbfft","packageid":54198,"summary":"D.J. Bernstein Fast Fourier Transform (djbfft) is an extremely fast library for floating-point convolution. The current version holds most of the speed records for double-precision FFTs on general-purpose computers. djbfft provides power-of-2 complex FFTs, real FFTs at twice the speed, and fast multiplication of complex arrays. Single precision and double precision are equally supported."},{"categoryid":318,"description":"Numerical and networking C++ library","firstseen":"2012-06-08T14:37:40.491746","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"dlib","packageid":59442,"summary":"dlib is a C++ library for developing portable applications dealing with networking, threads, graphical interfaces, data structures, linear algebra, machine learning, XML and text parsing, numerical optimization, Bayesian nets, and numerous other tasks."},{"categoryid":318,"description":"Common bricks library for building distributed machine learning","firstseen":"2017-07-19T17:13:56.110619","name":"dmlc-core","packageid":67893,"summary":"Distributed Machine Learning Common Codebase Core is the backbone library to support all DMLC projects, offers the bricks to build efficient and scalable distributed machine learning libraries."},{"categoryid":318,"description":"Software for interior-point for semidefinite programming","firstseen":"2011-03-07T14:39:04.589836","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"dsdp","packageid":57048,"summary":"The DSDP software is a free open source implementation of an interior-point method for semidefinite programming. It provides primal and dual solutions, exploits low-rank structure and sparsity in the data, and has relatively low memory requirements for an interior-point method. It allows feasible and infeasible starting points and provides approximate certificates of infeasibility when no feasible solution exists. The dual-scaling algorithm implemented in this package has a convergence proof and worst-case polynomial complexity under mild assumptions on the data. Furthermore, the solver offers scalable parallel performance for large problems and a well documented interface. Some of the most popular applications of semidefinite programming and linear matrix inequalities (LMI) are model control, truss topology design, and semidefinite relaxations of combinatorial and global optimization problems."},{"categoryid":318,"description":"A set of encoding\/decoding APIs and tools for WMO GRIB, BUFR, and GTS messages","firstseen":"2020-03-09T23:58:04.560273","name":"eccodes","packageid":70899,"summary":"This is the new open source BUFR\/GRIB library (from ECMWF) supporting C, F90, and Python interfaces."},{"categoryid":318,"description":"makes evaluating, comparing models and reporting their performance easier","firstseen":"2023-05-16T21:49:24.803333","name":"evaluate","packageid":76149},{"categoryid":318,"description":"Model developed to store and retrieve transient data for finite element analyses","firstseen":"2012-12-13T14:36:22.683950","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"exodusii","packageid":60123,"summary":"EXODUS II is a model developed to store and retrieve transient data for finite element analyses. It is used for preprocessing, postprocessing, as well as code to code data transfer. ExodusII is based on netcdf."},{"categoryid":318,"description":"The Flexible Collision Library","firstseen":"2014-11-29T14:39:27.777863","maintainer":"aballier@gentoo.org","maintainername":"Alexis Ballier","name":"fcl","packageid":62842,"summary":"FCL is a library for performing three types of proximity queries on a pair of geometric models composed of triangles."},{"categoryid":318,"description":"The Finite Element ToolKit - Meta package","firstseen":"2011-04-16T14:37:37.296770","maintainer":"sci-chemistry@gentoo.org","maintainername":"Gentoo Chemistry Project","name":"fetk","packageid":57239,"summary":"The Finite Element ToolKit (FETK) is a collaboratively developed, evolving collection of adaptive finite element method (AFEM) software libraries and tools for solving coupled systems of nonlinear geometric partial differential equations (PDE). The FETK libraries and tools are written in an object-oriented form of ANSI-C and in C++, and include a common portability layer (MALOC) for all of FETK, a collection of standard numerical libraries (PUNC), a stand-alone high-quality surface and volume simplex mesh generator (GAMer), a stand-alone networked polygon display tool (SG), a general nonlinear finite element modeling kernel (MC), and a MATLAB toolkit (MCLite) for protyping finite element methods and examining simplex meshes using MATLAB. The entire FETK Suite of tools is highly portable (from iPhone to Blue Gene\/L), thanks to use of a small abstraction layer (MALOC)."},{"categoryid":318,"description":"Library for dense linear algebra over word-size finite fields","firstseen":"2020-04-03T17:50:28.574649","name":"fflas-ffpack","packageid":70981,"summary":"FFLAS-FFPACK is a library for basic linear algebra operations over a finite field. It is inspired by the BLAS interface (Basic Linear Algebra Subprograms) and the LAPACK library for numerical linear algebra, and shares part of their design. Yet it differs in many aspects due to the specifics of computing over a finite field: it is generic with respect to the finite field, so as to accommodate a large variety of field sizes and implementations; consequently, all routines use C++ template generics and the library is primarily meant to be used as a source code library, to be included and compiled in the user's software."},{"categoryid":318,"description":"Fast C library for the Discrete Fourier Transform","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"fftw","packageid":46108,"summary":"The Fastest Fourier Transform in the West is a C subroutine library for computing the Discrete Fourier Transform (DFT) in one or more dimensions, of both real and complex data, and of arbitrary input size. It is becoming the FFT library of choice for most applications. Benchmarks, performed on a variety of platforms, show that FFTW's performance is typically superior to that of other publicly available FFT software."},{"categoryid":318,"description":"Fast approximate nearest neighbor searches in high dimensional spaces","firstseen":"2011-05-01T14:38:43.990757","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"flann","packageid":57311,"summary":"FLANN is a library for performing fast approximate nearest neighbor searches in high dimensional spaces. It contains a collection of algorithms we found to work best for nearest neighbor search and a system for automatically choosing the best algorithm and optimum parameters depending on the dataset. FLANN is written in C++ and contains bindings for the following languages: C, MATLAB and Python."},{"categoryid":318,"description":"ONNXIFI with Facebook Extension","firstseen":"2022-06-14T11:37:50.866932","name":"foxi","packageid":75061},{"categoryid":318,"description":"Implementations of the floating-point LLL reduction algorithm","firstseen":"2013-07-16T13:36:35.254682","name":"fplll","packageid":61016},{"categoryid":318,"description":"Library for genetic algorithms in C++ programs","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"galib","packageid":51388,"summary":"GAlib contains a set of C++ genetic algorithm objects. The library includes tools for using genetic algorithms to do optimization in any C++ program using any representation and genetic operators."},{"categoryid":318,"description":"Geometry-preserving Adaptive MeshER","firstseen":"2010-11-02T14:34:07.577095","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"gamer","packageid":56465},{"categoryid":318,"description":"Genetic Algorithm Utility Library","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"gaul-devel","packageid":44941,"summary":"The Genetic Algorithm Utility Library is a flexible programming library designed to aid in the development of applications that use genetic, or evolutionary, algorithms. It provides data structures and functions for handling and manipulation of the data required for serial and parallel evolutionary algorithms. Additional stochastic algorithms are provided for comparison to the genetic algorithms. Much of the functionality is also available through a simple S-Lang interface."},{"categoryid":318,"description":"Translator library for raster geospatial data formats (includes OGR support)","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci-geosciences@gentoo.org","maintainername":"Gentoo Geosciences Project","name":"gdal","packageid":50066,"summary":"GDAL is the Geospatial Data Abstraction Library, a set of tools for converting between geospatial raster data formats (includes OGR for vector data)."},{"categoryid":318,"description":"Geometry engine library for Geographic Information Systems","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci-geosciences@gentoo.org","maintainername":"Gentoo Geosciences Project","name":"geos","packageid":49968,"summary":"Geometric Engine Open Source provides a spatial object model and fundamental geometric functions. It implements the geometry model defined in the OpenGIS Consortium Simple Features Specification for SQL. Functions provided include: spatial predicates (based on the DE-9IM model), overlay functions (intersection, difference, union, symmetric difference), buffer, convex hull, area and distance functions, and topological validity checking."},{"categoryid":318,"description":"Gerris Flow Solver","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"gerris","packageid":49938,"summary":"Gerris Flow Solver is a software program for the solution of the partial differential equations describing fluid flow."},{"categoryid":318,"description":"Reference implementation of the Dirfile, format for time-ordered binary data","firstseen":"2010-09-14T18:10:40.387401","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"getdata","packageid":56276,"summary":"The GetData Project is the reference implementation of the Dirfile Standards, a filesystem-based, column-oriented database format for time-ordered binary data. The Dirfile database format is designed to provide a fast, simple format for storing and reading data."},{"categoryid":318,"description":"Numerical linear algebra software package","firstseen":"2020-04-30T22:47:58.301758","name":"ginkgo","packageid":71067,"summary":"Ginkgo is a high-performance linear algebra library for manycore systems, with a focus on sparse solution of linear systems. It is implemented using modern C++, with GPU kernels implemented in CUDA."},{"categoryid":318,"description":"C++ library for arithmetic and algebraic computations","firstseen":"2020-01-01T19:52:51.678029","name":"givaro","packageid":70556},{"categoryid":318,"description":"Helper routines and frameworks used by KarypisLab software","firstseen":"2023-05-02T15:09:38.851121","name":"gklib","packageid":76105},{"categoryid":318,"description":"library of floating-point neural network inference operators","firstseen":"2022-06-12T11:50:26.003501","name":"gloo","packageid":75059},{"categoryid":318,"description":"Three-dimensional finite element mesh generator","firstseen":"2019-08-05T07:39:31.134254","name":"gmsh","packageid":70041},{"categoryid":318,"description":"The GNU Scientific Library","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"gsl","packageid":46545,"summary":"The GNU Scientific Library (GSL) is a collection of routines for numerical analysis. The routines are written from scratch by the GSL team in C, and present a modern API for C programmers, while allowing wrappers to be written for very high level languages. GSL includes data types and routines for complex numbers, vectors, matrices, basic linear algebra subroutines (BLAS), eigensystems, simulated annealing, minimization, root finding, pseudo-random numbers, least-squares fitting, fast Fourier transforms (FFT), differential equations, quadrature, Monte Carlo integration, special functions, physical constants, and much more."},{"categoryid":318,"description":"GNU Triangulated Surface Library","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"gts","packageid":48450,"summary":"Gerris Flow Solver is a software program for the solution of the partial differential equations describing fluid flow."},{"categoryid":318,"description":"General purpose library and format for storing scientific data","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"hdf","packageid":52587,"summary":"The Hierarchical Data Format is a general purpose library and file format for storing scientific data. HDF can store two primary objects: datasets and groups. A dataset is essentially a multidimensional array of data elements, and a group is a structure for organizing objects in an HDF file. Using these two basic objects, one can create and store almost any kind of scientific data structure, such as images, arrays of vectors, and structured and unstructured grids. You can also mix and match them in HDF files according to your needs."},{"categoryid":318,"description":"General purpose library and file format for storing scientific data","firstseen":"2010-05-04T00:54:45.661860","maintainer":"xarthisius@gentoo.org","maintainername":"Kacper Kowalik","name":"hdf5","packageid":42259,"summary":"HDF5 is a file format and library for storing scientific data. HDF5 was designed and implemented to address the deficiencies of HDF4.x. It has a more powerful and flexible data model, supports files larger than 2 GB, and supports parallel I\/O."},{"categoryid":318,"description":"ROCm BLAS marshalling library","firstseen":"2022-01-30T09:19:19.136987","name":"hipBLAS","packageid":74316},{"categoryid":318,"description":"Common files shared by hipBLAS and hipBLASLt","firstseen":"2025-01-05T22:21:10.808800","name":"hipBLAS-common","packageid":78101},{"categoryid":318,"description":"General matrix-matrix operations library for AMD Instinct accelerators","firstseen":"2024-06-26T11:50:25.685877","name":"hipBLASLt","packageid":77595},{"categoryid":318,"description":"Wrapper of rocPRIM or CUB for GPU parallel primitives","firstseen":"2021-01-24T08:39:58.295421","name":"hipCUB","packageid":72425},{"categoryid":318,"description":"CU \/ ROCM agnostic hip FFT implementation","firstseen":"2021-11-30T07:09:04.283439","name":"hipFFT","packageid":73687},{"categoryid":318,"description":"CU \/ ROCM agnostic hip RAND implementation","firstseen":"2023-07-30T05:55:09.190144","name":"hipRAND","packageid":76367},{"categoryid":318,"description":"CU \/ ROCM agnostic marshalling library for LAPACK routines on the GPU","firstseen":"2024-03-08T19:42:23.330062","name":"hipSOLVER","packageid":77157},{"categoryid":318,"description":"ROCm SPARSE marshalling library","firstseen":"2021-01-24T08:39:58.295421","name":"hipSPARSE","packageid":72426},{"categoryid":318,"description":"C library for high-throughput sequencing data formats","firstseen":"2014-09-21T13:51:26.076524","maintainer":"sci-biology@gentoo.org","maintainername":"Gentoo Biology Project","name":"htslib","packageid":62539},{"categoryid":318,"description":"a client library to interact with the Hugging Face Hub","firstseen":"2023-04-12T09:48:39.420112","name":"huggingface_hub","packageid":76026},{"categoryid":318,"description":"Parallel matrix preconditioners library","firstseen":"2012-01-22T14:35:51.179677","maintainer":"sci-mathematics@gentoo.org","maintainername":"Gentoo Mathematics Project","name":"hypre","packageid":58724,"summary":"Hypre is a set of matrix preconditioning libraries to aid in the solution of large systems of linear equations."},{"categoryid":318,"description":"Intel® Optimization for Chainer","firstseen":"2024-03-01T18:50:58.729319","name":"ideep","packageid":77146},{"categoryid":318,"description":"GDL library from D. Fannings IDL courses","firstseen":"2016-03-22T14:39:52.391887","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"idlcoyote","packageid":65198,"summary":"The Coyote Library evolved from work David Fanning was doing teaching IDL courses and answering IDL questions on the IDL newsgroup. It is meant to be a well-documented library that demonstrates how to write solid IDL\/GDL programs that are easy to maintain and extend."},{"categoryid":318,"description":"Craig Markwardt IDL procedures (MPFIT, CMSVLIB, etc)","firstseen":"2012-02-02T14:35:50.240891","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"idlmarkwardt","packageid":58794,"summary":"Library of IDL software procedures that Craig Markwardt is making available to the general public. It contains: * Curve Fitting and Function Minimization * Read and Write SAVE Files * Graphics Programs * Mathematics * Ephemeris and Timing * Array \/ Set Operations * Input \/ Output"},{"categoryid":318,"description":"Set of libraries designed to rapidly develop robot applications","firstseen":"2020-05-15T18:24:03.183726","name":"ignition-common","packageid":71143},{"categoryid":318,"description":"Classes and tools for interacting with Ignition Fuel","firstseen":"2020-05-15T18:24:03.183726","name":"ignition-fuel-tools","packageid":71144},{"categoryid":318,"description":"A small, fast, and high performance math library for robot applications","firstseen":"2015-09-16T13:38:27.722518","maintainer":"aballier@gentoo.org","maintainername":"Alexis Ballier","name":"ignition-math","packageid":64098},{"categoryid":318,"description":"Integer Matrix Library","firstseen":"2019-08-19T08:22:08.954529","name":"iml","packageid":70093,"summary":"a free library of C source code which implements algorithms for computing exact solutions to dense systems of linear equations over the integers"},{"categoryid":318,"description":"Program and library for generating standard and non-standard InChI and InChIKeys","firstseen":"2011-03-27T14:40:03.143348","maintainer":"sci-chemistry@gentoo.org","maintainername":"Gentoo Chemistry Project","name":"inchi","packageid":57149},{"categoryid":318,"description":"INDI Astronomical Control Protocol library","firstseen":"2010-05-04T00:54:45.661860","maintainer":"kde@gentoo.org","maintainername":"Gentoo KDE Project","name":"indilib","packageid":49593},{"categoryid":318,"description":"Interior-Point Optimizer for large-scale nonlinear optimization","firstseen":"2014-01-16T14:35:40.742019","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"ipopt","packageid":61837,"summary":"Ipopt is a solver for large-scale nonlinear continuous optimization. It can be used from modeling environments, such as AMPL, GAMS, or Matlab, and it is also available as a callable library with interfaces to C++, C, and Fortran. Ipopt uses an interior point method, together with a filter linear search procedure. Ipopt is part of the larger COIN-OR initiative (Computational Infrastructure for Operations Research)."},{"categoryid":318,"description":"C++ library of mathematical, signal processing and communication","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"itpp","packageid":48357,"summary":"IT++ is a C++ library of mathematical, signal processing and communication classes and functions. Its main use is in simulation of communication systems and for performing research in the area of communications. The kernel of the library consists of generic vector and matrix classes, and a set of accompanying routines. Such a kernel makes IT++ similar to MATLAB or GNU Octave ."},{"categoryid":318,"description":"Java-like matrix C++ templates","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"jama","packageid":55168,"summary":"JAMA\/C++: a translation of the Java Matrix Library, developed by the Mathworks and NIST, into C++ . It includes the following routines: * classical matrix linear algebra * QR * SVD * Cholesky * Eigenvalue solver It is based on NIST's Template Numerical Toolkit."},{"categoryid":318,"description":"Evaluate an automatic speech recognition system","firstseen":"2023-05-14T17:56:24.409248","name":"jiwer","packageid":76146},{"categoryid":318,"description":"Application Programming Interface for atomistic simulations","firstseen":"2017-07-17T01:59:27.827511","name":"kim-api","packageid":67882},{"categoryid":318,"description":"part of the PyTorch Profiler","firstseen":"2022-05-26T07:03:10.399041","name":"kineto","packageid":75019},{"categoryid":318,"description":"A Fast Fourier Transform (FFT) library that tries to Keep it Simple, Stupid","firstseen":"2021-04-23T18:22:48.328857","name":"kissfft","packageid":72786},{"categoryid":318,"description":"Sparse LU factorization for circuit simulation","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"klu","packageid":43936,"summary":"KLU is a sparse LU factorization algorithm well-suited for use in circuit simulation. It is also part of the University of Florida sparse matrix suite."},{"categoryid":318,"description":"BLAS, CBLAS, LAPACK, LAPACKE reference implementations","firstseen":"2019-06-26T03:43:56.737398","name":"lapack","packageid":69908,"summary":"The BLAS (Basic Linear Algebra Subprograms) are high quality \"building block\" routines for performing basic vector and matrix operations. Level 1 BLAS do vector-vector operations, Level 2 BLAS do matrix-vector operations, and Level 3 BLAS do matrix-matrix operations. Because the BLAS are efficient, portable, and widely available, they're commonly used in the development of high quality linear algebra software, LAPACK for example. This packages implements the reference FORTRAN 77 library, the reference C library as a wrapper to the FORTRAN 77 BLAS library. LAPACK is a comprehensive library that does linear algebra operations including matrix inversions, least squared solutions to linear sets of equations, eigenvector analysis, singular value decomposition, etc. It is a very comprehensive and reputable package that has found extensive use in the scientific community. This package installs the reference FORTRAN 77 implementation from Netlib."},{"categoryid":318,"description":"Simple but educational LDL^T matrix factorization algorithm","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"ldl","packageid":53778,"summary":"LDL is a set of concise routines for factorizing symmetric positive-definite sparse matrices, with some applicability to symmetric indefinite matrices. Its primary purpose is to illustrate much of the basic theory of sparse matrix algorithms in as concise a code as possible, including an elegant new method of sparse symmetric factorization that computes the factorization row-by-row but stores it column-by-column. The entire symbolic and numeric factorization consists of a total of only 49 lines of code. The package is written in C, and includes a MATLAB interface."},{"categoryid":318,"description":"C++ template static library of common data structures and algorithms","firstseen":"2014-01-14T14:46:49.842361","maintainer":"mmokrejs@gmail.com","maintainername":"Martin Mokrejs","name":"lemon","packageid":61807,"summary":"LEMON stands for Library for Efficient Modeling and Optimization in Networks. It is a C++ template library providing efficient implementations of common data structures and algorithms with focus on combinatorial optimization tasks connected mainly with graphs and networks."},{"categoryid":318,"description":"Levenberg-Marquardt nonlinear least squares C library","firstseen":"2014-08-08T13:38:10.991383","maintainer":"amynka@gentoo.org","maintainername":"Gentoo 3D print","name":"levmar","packageid":62446,"summary":"levmar is a native ANSI C implementation of the Levenberg-Marquardt optimization algorithm. Both unconstrained and constrained (under linear equations, inequality and box constraints) Levenberg-Marquardt variants are included. The LM algorithm is an iterative technique that finds a local minimum of a function that is expressed as the sum of squares of nonlinear functions."},{"categoryid":318,"description":"Adaptive Entropy Coding library","firstseen":"2016-03-19T14:41:34.095936","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"libaec","packageid":65166,"summary":"Libaec provides fast lossless compression of 1 up to 32 bit wide signed or unsigned integers (samples). The library achieves best results for low entropy data as often encountered in space imaging instrument data or numerical model output from weather or climate simulations. While floating point representations are not directly supported, they can also be efficiently coded by grouping exponents and mantissa."},{"categoryid":318,"description":"Expose the functionality of cbraid as a shared library","firstseen":"2020-01-15T14:09:58.385538","name":"libbraiding","packageid":70603,"summary":"This is a project to expose the functionality of the cbraid program as a shared library. The original goal was to include it as a component of SageMath, but it can be used in any other C++ program."},{"categoryid":318,"description":"Library for collision detection between two convex shapes","firstseen":"2014-10-24T13:37:02.106838","maintainer":"aballier@gentoo.org","maintainername":"Alexis Ballier","name":"libccd","packageid":62718,"summary":"libccd is library for a collision detection between two convex shapes. libccd implements variation on Gilbert–Johnson–Keerthi algorithm plus Expand Polytope Algorithm (EPA) and also implements algorithm Minkowski Portal Refinement (MPR, a.k.a. XenoCollide) as described in Game Programming Gems 7."},{"categoryid":318,"description":"Efficient and accurate implementation of complex error functions","firstseen":"2014-07-22T13:37:14.910350","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"libcerf","packageid":62399},{"categoryid":318,"description":"Code to work with mmCIF and PDB files","firstseen":"2021-09-02T13:26:57.983056","name":"libcifpp","packageid":73314},{"categoryid":318,"description":"Implementation of a C++ SDK for DAP 2.0 and 3.2","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci-geosciences@gentoo.org","maintainername":"Gentoo Geosciences Project","name":"libdap","packageid":54902,"summary":"libdap is a C++ implementation of OPeNDAP which allows access to data over the internet, from programs that weren't originally designed for that purpose, as well as some that were. While OPeNDAP s the original developer of the Data Access Protocol (DAP) which it's software uses, many other groups have adopted DAP and provide compatible clients, servers and software development kits. DAP is a NASA community standard: http:\/\/www.esdswg.org\/spg\/rfc\/ese-rfc-004"},{"categoryid":318,"description":"Efficient evaluation of integrals over ab initio effective core potentials","firstseen":"2020-10-03T22:24:21.641008","name":"libecpint","packageid":72062,"summary":"Libecpint is a C++ library for the efficient evaluation of integrals over ab initio effective core potentials, using a mixture of generated, recursive code and Gauss-Chebyshev quadrature. It is designed to be standalone and generic."},{"categoryid":318,"description":"reading, writing, and editing of XLS (BIFF8 format) files using C++","firstseen":"2010-10-18T14:34:07.554031","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"libexcelformat","packageid":56399},{"categoryid":318,"description":"An auto-parallelizing library to speed up computer simulations","firstseen":"2014-05-19T13:37:53.484814","maintainer":"slis@gentoo.org","name":"libgeodecomp","packageid":62215,"summary":"LibGeoDecomp (Library for Geometric Decomposition codes) is an auto-parallelizing library for computer simulations. It is specifically targeted computational science applications in the context of supercomputers and heterogeneous systems. The library eases development of such tightly coupled codes by essentially taking over the parallel programming: it handles both, the parallelization itself and parameter tuning. This enables scientists to focus on their simulation code, rather than the technical details of the parallel computer."},{"categoryid":318,"description":"Library for reading TIFF files with embedded tags for geographic information","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci-geosciences@gentoo.org","maintainername":"Gentoo Geosciences Project","name":"libgeotiff","packageid":55698},{"categoryid":318,"description":"Library of routines for IF97 water & steam properties","firstseen":"2012-06-06T14:38:54.980890","maintainer":"mgorny@gentoo.org","maintainername":"Michał Górny","name":"libh2o","packageid":59435},{"categoryid":318,"description":"C++ bindings for libh2o","firstseen":"2012-06-06T14:38:54.980890","maintainer":"mgorny@gentoo.org","maintainername":"Michał Górny","name":"libh2oxx","packageid":59436},{"categoryid":318,"description":"Library to compute the homfly polynomial of a link","firstseen":"2020-08-12T22:21:10.884585","name":"libhomfly","packageid":71869},{"categoryid":318,"description":"A simple C++ geometry processing library","firstseen":"2020-12-13T14:39:24.808692","name":"libigl","packageid":72267,"summary":"ibigl is a simple C++ geometry processing library with a wide functionality including construction of sparse discrete differential geometry operators and finite-elements matrices such as the cotangent Laplacian and diagonalized mass matrix, simple facet and edge-based topology data structures, mesh-viewing utilities for OpenGL and GLSL, and many core functions for matrix manipulation which make Eigen feel a lot more like MATLAB."},{"categoryid":318,"description":"Matrix elements (integrals) evaluation over Cartesian Gaussian functions","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"libint","packageid":44954,"summary":"libint is two things: 1. a library of C\/C++ functions for efficient evaluation of several kinds of two-body molecular integrals over Gaussian functions; 2. the optimizing compiler that generates a Libint library."},{"categoryid":318,"description":"Library for sci-biology\/mauve","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci-biology@gentoo.org","maintainername":"Gentoo Biology Project","name":"libmuscle","packageid":44815},{"categoryid":318,"description":"Celestial Mechanics and Astronomical Calculation Library","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci-astronomy@gentoo.org","maintainername":"Gentoo Astronomy Project","name":"libnova","packageid":43380,"summary":"libnova is a general purpose, double precision, astronomical calculation library. The intended audience of libnova is C \/ C++ programmers, astronomers and anyone else interested in calculating positions of astronomical objects."},{"categoryid":318,"description":"Library for reading OriginLab OPJ project files","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"liborigin","packageid":43063},{"categoryid":318,"description":"PDB Record I\/O Libraries -- c version","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"libpdb","packageid":45537},{"categoryid":318,"description":"PDB Record I\/O Libraries -- c++ version","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"libpdb++","packageid":52569},{"categoryid":318,"description":"A modern multi-purpose calculator library","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"libqalculate","packageid":52579},{"categoryid":318,"description":"Support for parallel scientific applications","firstseen":"2017-05-26T17:43:34.213399","name":"libsc","packageid":66871,"summary":"The SC Library provides support for parallel scientific applications. This support library is primarily used by"},{"categoryid":318,"description":"C++ library for semigroups and monoids","firstseen":"2024-01-22T11:43:13.819329","name":"libsemigroups","packageid":77033,"summary":"libsemigroups is a C++14 library containing implementations of several algorithms for computing finite, and finitely presented, semigroups and monoids. Namely: * the Froidure-Pin algorithm for computing finite semigroups; * the Todd-Coxeter algorithm for finitely presented semigroups and monoids; * the Knuth-Bendix algorithm for finitely presented semigroups and monoids; * the Schreier-Sims algorithm for permutation groups; * a preliminary implementation of the Konieczny and Lallement- McFadden algorithm for computing finite semigroups which act on sets; * an implementation of the Radoszewski-Rytter algorithm for testing equivalence of words in free bands; * an implementation of the algorithm for solving the word problem for small overlap monoids, and for computing normal forms in such monoids; * a version of Sims low index subgroup algorithm for computing one-sided congruences of a semigroup or monoid; * a version of Stephen's procedure for finitely presented semigroups and monoids (for a given word w this procedure is for determining words equivalent to w or that are left divisors of w)."},{"categoryid":318,"description":"Basic hardware drivers for logic analyzers and input\/output file format support","firstseen":"2022-08-27T09:17:13.013972","name":"libsigrok","packageid":75385},{"categoryid":318,"description":"Provide (streaming) protocol decoding functionality","firstseen":"2014-06-14T13:39:27.501434","maintainer":"embedded@gentoo.org","maintainername":"Embedded Gentoo","name":"libsigrokdecode","packageid":62310},{"categoryid":318,"description":"C++ implementation of R*-tree, an MVR-tree and a TPR-tree with C API","firstseen":"2013-02-11T14:36:32.644932","name":"libspatialindex","packageid":60346},{"categoryid":318,"description":"Library for Support Vector Machines","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"libsvm","packageid":42810,"summary":"The LIBSVM library is used to calculate Support Vector Machine optimizations with a great variety of options. It includes one-class, two-class, multiclass, regression-mode, and probablistic output functionality. It is primarily of interest to machine-learning researchers and artificial intelligence application developers."},{"categoryid":318,"description":"Library to handle different link cables for TI calculators","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"libticables2","packageid":42426,"summary":"This library provides functions to use Texas Instruments link cables for TI calculators. It currently supports all cables on i386, including the USB one. Supported cables may vary depending on your architecture."},{"categoryid":318,"description":"Library for communication with TI calculators","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"libticalcs2","packageid":52781,"summary":"The libticalcs provides a set of functions to communicate with Texas Instruments calculators. It implements the TI protocol for each type of calculator, independently of the link cable used to establish the link. All graphing calculators from Texas Instruments are supported"},{"categoryid":318,"description":"Charset conversion library for TI calculators","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"libticonv","packageid":45971,"summary":"The libticonv package is a library which handles the various TI charsets and conversion to\/from UTF-8\/16 through a set of functions which constitutes a common API."},{"categoryid":318,"description":"Library for TI calculator files","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"libtifiles2","packageid":55111,"summary":"The libtifiles is a library providing support for operations on Texas Instruments calculators files. All formats for all calculators are supported read\/write ; the library is also able to manipulate the group files, which means it is able to group and ungroup variables into such group files."},{"categoryid":318,"description":"A library of exchange-correlation functionals for use in DFT","firstseen":"2018-10-02T13:06:27.391319","name":"libxc","packageid":69435,"summary":"Libxc is a library of exchange-correlation functionals for density-functional theory. The aim is to provide a portable, well tested and reliable set of exchange and correlation functionals that can be used by all the ETSF codes and also other codes. In Libxc you can find different types of functionals: LDA, GGA, hybrids, and mGGA (experimental). These functionals depend on local information, in the sense that the value of the potential at a given point depends only on the values of the density -- and the gradient of the density and the kinetic energy density, for the GGA and mGGA cases. It can calculate the functional itself and its derivative; for some functionals, higher-order derivatives are available. Libxc is written in C and has Fortran bindings. It is released under the LGPL license (v. 3.0). Contributions are welcome."},{"categoryid":318,"description":"C++ template library for integer and finite-field linear algebra","firstseen":"2020-05-04T14:52:53.788600","name":"linbox","packageid":71100,"summary":"LinBox is a C++ template library for exact, high-performance linear algebra computation with dense, sparse, and structured matrices over the integers and over finite fields. LinBox relies on closely aligned libraries fflas-ffpack (exact dense matrix linear algebra kernels), and Givaro (finite fields, integers, and polynomials)."},{"categoryid":318,"description":"Driver library for GPIB (IEEE 488.2) hardware","firstseen":"2011-02-01T14:40:14.004226","maintainer":"dilfridge@gentoo.org","maintainername":"Andreas K. Huettel","name":"linux-gpib","packageid":56788},{"categoryid":318,"description":"Kernel modules for GPIB (IEEE 488.2) hardware","firstseen":"2018-10-13T16:39:16.495655","name":"linux-gpib-modules","packageid":69452},{"categoryid":318,"description":"Library of Iterative Solvers for Linear Systems","firstseen":"2012-01-22T14:35:51.179677","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"lis","packageid":58725,"summary":"Lis, a Library of Iterative Solvers for linear systems, is a scalable parallel library for solving systems of linear equations and standard eigenvalue problems with real sparse matrices using iterative methods."},{"categoryid":318,"description":"library for Levenberg-Marquardt least-squares minimization and curve fitting","firstseen":"2018-06-01T00:54:48.698065","name":"lmfit","packageid":69145},{"categoryid":318,"description":"Reverse-search algorithm for vertex enumeration problems","firstseen":"2010-11-13T14:34:00.987409","maintainer":"tomka@gentoo.org","maintainername":"Thomas Kahle","name":"lrslib","packageid":56541,"summary":"lrslib is a self-contained ANSI C implementation as a callable library of the reverse search algorithm for vertex enumeration\/convex hull problems and comes with a choice of three arithmetic packages. Input file formats are compatible with Komei Fukuda's cdd package. 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."},{"categoryid":318,"description":"Method of four russian for inversion (M4RI)","firstseen":"2020-01-02T14:59:04.322477","name":"m4ri","packageid":70558,"summary":"M4RI is a library for fast arithmetic with dense matrices over F2. The name M4RI comes from the first implemented algorithm: The \"Method of the Four Russians\" inversion algorithm published by Gregory Bard. This algorithm in turn is named after the 'Method of the Four Russians' multiplication algorithm which is probably better referred to as Kronrod's method."},{"categoryid":318,"description":"Fast dense matrix arithmetic over GF(2^e) for 2 <= e <= 16","firstseen":"2020-03-06T16:15:57.111588","name":"m4rie","packageid":70888,"summary":"M4RIE is a library for fast arithmetic with dense matrices over GF(2^e) for \"e\" between 2 and 16, inclusive. The name stems from the fact that it relies heavily on M4RI."},{"categoryid":318,"description":"Math Graphics Library","firstseen":"2010-05-04T00:54:45.661860","maintainer":"grozin@gentoo.org","maintainername":"Andrey Grozin","name":"mathgl","packageid":55093,"summary":"MathGL is a library for: * making high-quality scientific graphics * the fast data plotting and data processing of large data arrays * working in window and console modes and for easy embedding into other programs"},{"categoryid":318,"description":"Library for reading and writing matlab files","firstseen":"2012-04-06T14:36:31.414652","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"matio","packageid":59100,"summary":"matio is an ISO C library (with a limited Fortran 90 interface) for reading and writing Matlab MAT files."},{"categoryid":318,"description":"2D\/3D AFEM code for nonlinear geometric PDE","firstseen":"2010-11-02T14:34:07.577095","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"mc","packageid":56468},{"categoryid":318,"description":"A library to store and exchange meshed data or computation results","firstseen":"2019-08-05T07:39:31.134254","name":"med","packageid":70042},{"categoryid":318,"description":"A package for unstructured serial graph partitioning","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"metis","packageid":43712,"summary":"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."},{"categoryid":318,"description":"AMD's Machine Intelligence Library","firstseen":"2021-11-10T05:20:43.809607","name":"miopen","packageid":73568},{"categoryid":318,"description":"Intel Math Kernel Library","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"mkl","packageid":51131,"summary":"The Intel(R) Math Kernel Library is a mathematical library mostly optimized for Intel processors (also works on AMDs). It contains BLAS and LAPACK implementations, Fast Fourier Transforms, a vector math library, and random number generators. It also has multiprocessor capacities. The package is installed as binary and has a restrictive license. Please see license terms and home page for proper use."},{"categoryid":318,"description":"Multiple precision interval arithmetic library based on MPFR","firstseen":"2011-12-17T14:36:12.649765","maintainer":"sci-mathematics@gentoo.org","maintainername":"Gentoo Mathematics Project","name":"mpfi","packageid":58584,"summary":"MPFI is intended to be a portable library written in C for arbitrary precision interval arithmetic with intervals represented using MPFR reliable floating-point numbers. It is based on the GNU MP library and on the MPFR library. The purpose of an arbitrary precision interval arithmetic is on the one hand to get guaranteed results, thanks to interval computation, and on the other hand to obtain accurate results, thanks to multiple precision arithmetic. The MPFI library is built upon MPFR in order to benefit from the correct roundings provided by MPFR. Further advantages of using MPFR are its portability and compliance with the IEEE 754 standard for floating-point arithmetic."},{"categoryid":318,"description":"MUltifrontal Massively Parallel sparse direct matrix Solver","firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"mumps","packageid":61830,"summary":"MUltifrontal Massively Parallel sparse direct Solver implements a direct solver for large sparse linear systems, with a particular focus on symmetric positive definite matrices. It can operate on distributed matrices e.g. over a cluster. It has Fortran and C interfaces, and can interface with ordering tools such as Scotch or Metis."},{"categoryid":318,"description":"C++ header-only library for Nearest Neighbor (NN) search wih KD-trees","firstseen":"2017-08-14T16:28:18.701133","name":"nanoflann","packageid":67952,"summary":"nanoflann is a C++ header-only library for building KD-Trees, mostly optimized for 2D or 3D point clouds. This library is a fork (and a subset) of the"},{"categoryid":318,"description":"Function library efficiently solving the Nearest Neighbor Problem","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"neartree","packageid":42418},{"categoryid":318,"description":"Enhancement to the EXODUSII finite element database model","firstseen":"2012-12-14T14:36:27.231291","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"nemesis","packageid":60125,"summary":"NEMESIS is an enhancement to the EXODUSII finite element database model used to store and retrieve data for unstructured parallel finite element analyses. NEMESIS adds data structures which facilitate the partitioning of a scalar (standard serial) EXODUSII file onto parallel disk systems found on many parallel computers. Since the NEMESIS application programming interface (API) can be used to append information to an existing EXODUSII database, any existing software that reads EXODUSII files can be used on files which contain NEMESIS information. The NEMESIS information is written and read via C or C++ callable functions which compromise the NEMESIS I API."},{"categoryid":318,"description":"Scientific library and interface for array oriented data access","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"netcdf","packageid":47137,"summary":"NetCDF (network Common Data Form) is an interface for scientific data access and a freely-distributed software library that provides an implementation of the interface. The netCDF library also defines a machine-independent format for representing scientific data. Together, the interface, library, and format support the creation, access, and sharing of scientific data."},{"categoryid":318,"description":"C++ library for netCDF","firstseen":"2012-04-19T14:38:40.192438","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"netcdf-cxx","packageid":59155,"summary":"NetCDF (network Common Data Form) is an interface for scientific data access and a freely-distributed software library that provides an implementation of the interface. The netCDF library also defines a machine-independent format for representing scientific data. Together, the interface, library, and format support the creation, access, and sharing of scientific data. This is the C++ library which links to the C library."},{"categoryid":318,"description":"Scientific library and interface for array oriented data access","firstseen":"2012-04-19T14:38:40.192438","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"netcdf-fortran","packageid":59156,"summary":"NetCDF (network Common Data Form) is an interface for scientific data access and a freely-distributed software library that provides an implementation of the interface. The netCDF library also defines a machine-independent format for representing scientific data. Together, the interface, library, and format support the creation, access, and sharing of scientific data. This is the FORTRAN 77 and 90 library on top of the C library."},{"categoryid":318,"description":"library for nonequispaced discrete Fourier transformations","firstseen":"2013-05-07T13:37:36.099573","maintainer":"ottxor@gentoo.org","maintainername":"Christoph Junghans","name":"nfft","packageid":60731},{"categoryid":318,"description":"Non-linear optimization library","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"nlopt","packageid":54040,"summary":"NLopt is a library for nonlinear optimization, providing a common interface for a number of different free optimization routines available online as well as original implementations of various other algorithms. Its features include: * Callable from variety of languages (C, C++, Fortran, Python, Octave) * A common interface for many different algorithms—try a different algorithm just by changing one parameter. * Both global and local optimization algorithms. * Both derivative-free and gradient-based optimization algorithms. * Algorithms for unconstrained optimization, bound-constrained optimization, and general nonlinear inequality constraints."},{"categoryid":318,"description":"Numerical first aid kit (with numpy\/scipy)","firstseen":"2019-08-23T13:52:51.790972","name":"numkit","packageid":70098},{"categoryid":318,"description":"Network Data Access Protocol client C library","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"oc","packageid":47588,"summary":"The New OPeNDAP C API (oc) is an OPeNDAP DAP 2.0 client implementation written in generic C. This new API allows for more funcionality and less complexity than the original C API."},{"categoryid":318,"description":"An Efficient Probabilistic 3D Mapping Framework Based on Octrees","firstseen":"2014-10-29T14:38:07.804099","maintainer":"aballier@gentoo.org","maintainername":"Alexis Ballier","name":"octomap","packageid":62743,"summary":"The OctoMap library implements a 3D occupancy grid mapping approach, providing data structures and mapping algorithms in C++ particularly suited for robotics."},{"categoryid":318,"description":"Open Geographical Datastore Interface, a GIS support library","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"ogdi","packageid":43360},{"categoryid":318,"description":"Assembly Constraints and Multibody Dynamics code","firstseen":"2025-01-10T16:53:04.321990","name":"ondselsolver","packageid":78109},{"categoryid":318,"description":"Open Neural Network Exchange (ONNX)","firstseen":"2022-05-19T13:42:17.940589","name":"onnx","packageid":74989},{"categoryid":318,"description":"Optimized BLAS library based on GotoBLAS2","firstseen":"2019-07-06T16:05:57.673782","name":"openblas","packageid":69930,"summary":"OpenBLAS is an optimized Basic Linear Algebra Subprograms (BLAS) library based on GotoBLAS2 1.13 BSD version. It was forked when Mr. Kazushige Goto left TACC and GotoBLAS became unmaintained. In general, BLAS is the computational kernel (\"the bottom of the food chain\") in linear algebra or scientific applications. Thus, if your BLAS implementation is highly optimized, the whole application can substantially benefit. OpenBLAS has optimized code for modern architectures, and has accrued many other features and bug fixes beyond GotoBLAS."},{"categoryid":318,"description":"Development platform for CAD\/CAE, 3D surface\/solid modeling and data exchange","firstseen":"2011-03-03T14:37:41.106127","maintainer":"xmw@gentoo.org","maintainername":"Michael Weber","name":"opencascade","packageid":57025},{"categoryid":318,"description":"High quality system independent, open source libm","firstseen":"2014-04-03T13:37:16.649289","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"openlibm","packageid":62093,"summary":"OpenLibm is an effort to have a high quality, portable, standalone C mathematical library (libm). It can be used standalone in applications and programming language implementations. The project was born out of a need to have a good libm for the Julia programming langage that worked consistently across compilers and operating systems, and in 32-bit and 64-bit environments."},{"categoryid":318,"description":"Bayesian Filtering Library","firstseen":"2014-11-26T14:38:06.517027","maintainer":"aballier@gentoo.org","maintainername":"Alexis Ballier","name":"orocos-bfl","packageid":62831,"summary":"The Bayesian Filtering Library (BFL) provides an application independent framework for inference in Dynamic Bayesian Networks, i.e., recursive information processing and estimation algorithms based on Bayes' rule, such as (Extended) Kalman Filters, Particle Filters (or Sequential Monte Carlo methods), etc."},{"categoryid":318,"description":"Kinematics and Dynamics Library (KDL)","firstseen":"2014-10-31T14:38:46.887691","maintainer":"aballier@gentoo.org","maintainername":"Alexis Ballier","name":"orocos_kdl","packageid":62748,"summary":"The Kinematics and Dynamics Library (KDL) develops an application independent framework for modelling and computation of kinematic chains, such as robots, biomechanical human models, computer-animated figures, machine tools, etc. It provides class libraries for geometrical objects (point, frame, line,... ), kinematic chains of various families (serial, humanoid, parallel, mobile,... ), and their motion specification and interpolation."},{"categoryid":318,"description":"Scalable Algorithms for Parallel Adaptive Mesh Refinement on Forests of Octrees","firstseen":"2017-05-26T17:43:34.213399","name":"p4est","packageid":66872,"summary":"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 scale to hundreds of thousands of processor cores."},{"categoryid":318,"description":"Parallel (MPI) unstructured graph partitioning library","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"parmetis","packageid":51368,"summary":"ParMETIS is an MPI-based parallel library that implements a variety of algorithms for partitioning unstructured graphs and for computing fill-reducing orderings of sparse matrices. ParMETIS extends the functionality provided by METIS and includes routines that are especially suited for parallel AMR computations and large scale numerical simulations."},{"categoryid":318,"description":"Parallel solver for very large sparse linear systems","firstseen":"2016-02-22T14:40:58.510389","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"pastix","packageid":65047,"summary":"PaStiX (Parallel Sparse matriX package) is a scientific library that provides a high performance parallel solver for very large sparse linear systems based on direct methods. Numerical algorithms are implemented in single or double precision (real or complex) using LLt, LDLt and LU with static pivoting (for non symmetric matrices having a symmetric pattern). This solver provides also an adaptive blockwise iLU(k) factorization that can be used as a parallel preconditioner using approximated supernodes to build a coarser block structure of the incomplete factors."},{"categoryid":318,"description":"2D\/3D image and point cloud processing","firstseen":"2014-12-08T14:38:53.334934","maintainer":"aballier@gentoo.org","maintainername":"Alexis Ballier","name":"pcl","packageid":62877,"summary":"The Point Cloud Library (PCL) is a standalone, large scale, open project for 2D\/3D image and point cloud processing."},{"categoryid":318,"description":"A C++ library for translating and manipulating point cloud data","firstseen":"2022-02-28T18:31:39.467293","name":"pdal","packageid":74513,"summary":"PDAL is a C++ library for translating and manipulating point cloud data. It is very much like the GDAL library which handles raster and vector data."},{"categoryid":318,"description":"FORTRAN\/C device-independent scientific graphic library","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"pgplot","packageid":50048,"summary":"PGPLOT is a Fortran subroutine package for drawing graphs on a variety of display devices. The CPGPLOT library adds an intermediate level of wrapper functions between C programs and the PGPLOT library. These functions hide the system dependencies of calling PGPLOT behind a system independent interface."},{"categoryid":318,"description":"Multi-language scientific plotting library","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"plplot","packageid":45584,"summary":"PLplot is a library of functions that are useful for making scientific plots. It can be used from within compiled languages such as C, C++, FORTRAN and Java, as well as interactively from interpreted languages such as Octave, Python, Perl and Tcl. It is capable of producing standard x-y plots, semilog plots, log-log plots, contour plots, 3D surface plots, mesh plots, bar charts and pie charts. Multiple graphs may be composited, and it also supports a large variety of output file devices such as Postscript, PNG, JPEG, LaTeX and others. It is also possible to to use interactive devices such as xwin, tk and xterm as output devices. PLplot also offers support for extended characters inculding the Greek alphabet and a host of mathematical symbols."},{"categoryid":318,"description":"Small, fast library to generate primes in order","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci-mathematics@gentoo.org","maintainername":"Gentoo Mathematics Project","name":"primegen","packageid":42484,"summary":"primegen is a small, fast library to generate prime numbers in order. It generates the 50847534 primes up to 1000000000 in just 8 seconds on a Pentium II-350; it prints them in decimal in just 35 seconds. primegen can generate primes up to 1000000000000000, although it is not optimized for primes past 32 bits. It uses the Sieve of Atkin instead of the traditional Sieve of Eratosthenes."},{"categoryid":318,"description":"Neural network architecture for profacc","firstseen":"2013-04-25T13:35:58.729909","maintainer":"sci-biology@gentoo.org","maintainername":"Gentoo Biology Project","name":"profnet","packageid":60677},{"categoryid":318,"description":"Additional utils for profphd","firstseen":"2013-04-25T13:35:58.729909","maintainer":"sci-biology@gentoo.org","maintainername":"Gentoo Biology Project","name":"profphd-utils","packageid":60678},{"categoryid":318,"description":"PROJ coordinate transformation software","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci-geosciences@gentoo.org","maintainername":"Gentoo Geosciences Project","name":"proj","packageid":46837},{"categoryid":318,"description":"Portable Understructure for Numerical Computing","firstseen":"2010-06-09T14:35:06.041445","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"punc","packageid":55883,"summary":"PUNC (Portable Understructure for Numerical Computing) is a small standard collection of software libraries for numerical computing. The PUNC collection includes reference implementations of the standard (dense matrix) linear algebra tools BLAS and LAPACK, and also includes some newer (sparse matrix) linear algebra tools ARPACK, SuperLU, CgCode, and PMG. PUNC also provides some additional basic infrastructure such as the standard F2C header and corresponding library (libF2C), to support the use of F2C'd FORTRAN codes, and some other standard tools used to build numerical simulation software, such as the HDF5 library. While most of the libraries included in PUNC are completely stand-alone, and are the reference implementations developed by the individual library authors, PUNC also provides some Object-oriented C wrappers (written by the FETK developers) for use with Object-oriented C\/C++ codes such as FETK . This is accomplished by building PUNC on top of FETK 's MALOC library."},{"categoryid":318,"description":"Pure Python read\/write support for ESRI Shapefile format","firstseen":"2014-03-04T14:37:32.723918","maintainer":"slis@gentoo.org","name":"pyshp","packageid":61980},{"categoryid":318,"description":"Tensors and Dynamic neural networks in Python","firstseen":"2022-06-26T09:11:37.637346","name":"pytorch","packageid":75097},{"categoryid":318,"description":"Quad-double and double-double float arithmetics","firstseen":"2010-05-04T00:54:45.661860","maintainer":"grozin@gentoo.org","maintainername":"Andrey Grozin","name":"qd","packageid":52906},{"categoryid":318,"description":"ESO stand-alone C library offering easy access to FITS files","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci-astronomy@gentoo.org","maintainername":"Gentoo Astronomy Project","name":"qfits","packageid":52653,"summary":"qfits is a stand-alone library written in C to interact with files complying with the FITS format. It is fast and portable over any kind of POSIX-compliant platform. Rather than going through the FITS format specification and trying to implement some support for everything that is described there, this library was built day after day upon request. This guarantees that all the functions you will find in the library have been written for some purpose in the VLT pipeline context, and all of them are used daily in a production environment."},{"categoryid":318,"description":"Library for updating of QR and Cholesky decompositions","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"qrupdate","packageid":42063},{"categoryid":318,"description":"AMD's library for BLAS on ROCm","firstseen":"2021-08-27T13:10:22.571529","name":"rocBLAS","packageid":73305},{"categoryid":318,"description":"Next generation FFT implementation for ROCm","firstseen":"2021-01-24T08:39:58.295421","name":"rocFFT","packageid":72427},{"categoryid":318,"description":"HIP parallel primitives for developing performant GPU-accelerated code on ROCm","firstseen":"2021-01-24T08:39:58.295421","name":"rocPRIM","packageid":72428},{"categoryid":318,"description":"Generate pseudo-random and quasi-random numbers","firstseen":"2021-01-24T08:39:58.295421","name":"rocRAND","packageid":72429},{"categoryid":318,"description":"Implementation of a subset of LAPACK functionality on the ROCm platform","firstseen":"2022-01-26T14:25:31.937234","name":"rocSOLVER","packageid":74240},{"categoryid":318,"description":"Basic Linear Algebra Subroutines for sparse computation","firstseen":"2021-01-24T08:39:58.295421","name":"rocSPARSE","packageid":72430},{"categoryid":318,"description":"HIP back-end for the parallel algorithm library Thrust","firstseen":"2021-01-24T08:39:58.295421","name":"rocThrust","packageid":72431},{"categoryid":318,"description":"library for accelerating mixed precision matrix multiply-accumulate operations","firstseen":"2024-03-08T19:42:23.330062","name":"rocWMMA","packageid":77158},{"categoryid":318,"description":"AMD ROCm Performance Primitives (RPP) high-performance computer vision library","firstseen":"2024-06-26T11:50:25.685877","name":"rpp","packageid":77596},{"categoryid":318,"description":"Real-Time Appearance-Based Mapping (RGB-D Graph SLAM)","firstseen":"2014-12-20T14:39:03.621453","maintainer":"aballier@gentoo.org","maintainername":"Alexis Ballier","name":"rtabmap","packageid":62937},{"categoryid":318,"description":"Simple, safe way to store and distribute tensors","firstseen":"2023-08-12T20:20:06.902758","name":"safetensors","packageid":76379},{"categoryid":318,"description":"Subset of LAPACK routines redesigned for heterogenous (MPI) computing","firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"scalapack","packageid":61831,"summary":"The ScaLAPACK (or Scalable LAPACK) library includes a subset of LAPACK routines redesigned for distributed memory MIMD parallel computers. It is currently written in a Single-Program-Multiple-Data style using explicit message passing for interprocessor communication. It assumes matrices are laid out in a two-dimensional block cyclic decomposition."},{"categoryid":318,"description":"Software for graph, mesh and hypergraph partitioning","firstseen":"2010-05-04T00:54:45.661860","maintainer":"patrick@gentoo.org","maintainername":"Patrick Lauer","name":"scotch","packageid":52562,"summary":"SCOTCH is a software package and libraries for graph, mesh and hypergraph partitioning, static mapping, and sparse matrix block ordering. Its purpose of Scotch 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. The SCOTCH distribution is a set of programs and libraries which implement the static mapping and sparse matrix reordering algorithms developed within the SCOTCH project."},{"categoryid":318,"description":"Python framework for sequence labeling evaluation","firstseen":"2023-05-15T08:21:31.331686","name":"seqeval","packageid":76148},{"categoryid":318,"description":"Library for manipulating ESRI Shapefiles","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci-geosciences@gentoo.org","maintainername":"Gentoo Geosciences Project","name":"shapelib","packageid":51289},{"categoryid":318,"description":"A mesh and field I\/O library and scientific database","firstseen":"2014-07-24T13:39:06.969892","maintainer":"slis@gentoo.org","maintainername":"Gentoo Cluster Project","name":"silo","packageid":62412,"summary":"Silo is a library for reading and writing a wide variety of scientific data to binary, disk files. The files Silo produces and the data within them can be easily shared and exchanged between wholly independently developed applications running on disparate computing platforms."},{"categoryid":318,"description":"Spglib is a C library for finding and handling crystal symmetries","firstseen":"2020-03-14T18:28:42.321495","name":"spglib","packageid":70918},{"categoryid":318,"description":"Multithreaded multifrontal sparse QR factorization library","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"spqr","packageid":52710,"summary":"SuiteSparseQR is an implementation of the multifrontal sparse QR factorization method. Parallelism is exploited both in the BLAS and across different frontal matrices using Intel's Threading Building Blocks. It can obtain a substantial fraction of the theoretical peak performance of a multicore computer."},{"categoryid":318,"description":"Statistical analysis and machine learning library","firstseen":"2011-05-04T14:39:04.554929","maintainer":"sci-physics@gentoo.org","maintainername":"Gentoo Physics Project","name":"spr","packageid":57325,"summary":"The package implements a variety of tools for categorization of multivariate data such as boosted decision trees, bagging and random forest, bump hunting, a multi-class learner and others. It is used mostly in High Energy Physics."},{"categoryid":318,"description":"Cross-platform Sextractor and Astrometry.net-Based internal astrometric solver","firstseen":"2021-01-02T21:25:08.968949","name":"stellarsolver","packageid":72338},{"categoryid":318,"description":"Metapackage for a suite of sparse matrix tools","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"suitesparse","packageid":42578,"summary":"SuiteSparse is a suite of sparse matrix libraries from University of Florida Computer Science Department. Currently, this includes: * AMD: symmetric approximate minimum degree * BTF: permutation to block triangular form * CAMD: symmetric approximate minimum degree * CCOLAMD: constrained column approximate minimum degree * COLAMD: column approximate minimum degree * CHOLMOD: sparse supernodal Cholesky factorization and update\/downdate * CSparse: a concise sparse matrix package * CXSparse: an extended version of CSparse * KLU: sparse LU factorization, for circuit simulation * LDL: a simple LDL^T factorization * SPQR: multifrontal sparse QT factorization * UMFPACK: sparse multifrontal LU factorization * SuiteSparse_config: common configuration for all but CSparse The Gentoo package does not include the suitesparse MATLAB tools from upstream, from the packages above and the following MATLAB-only packages: * RBio: MATLAB toolbox for reading\/writing sparse matrices * LINFACTOR: solve Ax=b using LU or CHOL * MESHND: 2D and 3D mesh generation and nested dissection * SSMULT: sparse matrix times sparse matrix"},{"categoryid":318,"description":"Common configurations for all packages in suitesparse","firstseen":"2012-11-12T14:40:08.142846","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"suitesparseconfig","packageid":59991,"summary":"SuiteSparse_config is a set of configuration files for the SuiteSparse matrix libraries from CISE at University of Florida. It contains some headers and makefiles."},{"categoryid":318,"description":"Suite of nonlinear solvers","firstseen":"2017-01-03T14:36:13.843086","name":"sundials","packageid":66326,"summary":"SUite of Nonlinear and DIfferential\/ALgebraic equation Solvers was implemented with the goal of providing robust time integrators and nonlinear solvers that can easily be incorporated into existing simulation codes. The primary design goals were to require minimal information from the user, allow users to easily supply their own data structures underneath the solvers, and allow for easy incorporation of user-supplied linear solvers and preconditioners."},{"categoryid":318,"description":"Sparse LU factorization library","firstseen":"2010-06-09T14:35:06.041445","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"superlu","packageid":55880,"summary":"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 will perform an LU decomposition with partial pivoting and triangular system solves through forward and back substitution. The LU factorization routines can handle non-square matrices but the triangular solves are performed only for square matrices. The matrix columns may be preordered (before factorization) either through library or user supplied routines. This preordering for sparsity is completely separate from the factorization. Working precision iterative refinement subroutines are provided for improved backward stability. Routines are also provided to equilibrate the system, estimate the condition number, calculate the relative backward error, and estimate error bounds for the refined solutions."},{"categoryid":318,"description":"Multithreaded sparse LU factorization library","firstseen":"2016-12-29T14:36:23.682042","name":"superlu_mt","packageid":66303,"summary":"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 will perform an LU decomposition with partial pivoting and triangular system solves through forward and back substitution. The LU factorization routines can handle non-square matrices but the triangular solves are performed only for square matrices. The matrix columns may be preordered (before factorization) either through library or user supplied routines. This preordering for sparsity is completely separate from the factorization. Working precision iterative refinement subroutines are provided for improved backward stability. Routines are also provided to equilibrate the system, estimate the condition number, calculate the relative backward error, and estimate error bounds for the refined solutions. This is the multi-threaded version (POSIX threads or OpenMP)."},{"categoryid":318,"description":"Fast symbolic manipulation library, written in C++","firstseen":"2017-07-26T20:38:00.979934","name":"symengine","packageid":67912,"summary":"SymEngine is a standalone fast C++ symbolic manipulation library. Optional thin wrappers allow usage of the library from R, Python, Julia, Ruby, Haskell."},{"categoryid":318,"description":"C library for representation theory, combinatorics, and more","firstseen":"2020-01-20T21:38:29.646413","name":"symmetrica","packageid":70726},{"categoryid":318,"description":"Extended-Rice lossless compression algorithm implementation","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"szip","packageid":42423,"summary":"The Consultative Committee on Space Data Systems (CCSDS) has adopted the extended-Rice algorithm for international standards for space applications. Szip is reported to provide fast and effective compression, specifically for the EOS data generated by the NASA Earth Observatory System (EOS). It was originally developed at University of New Mexico (UNM) and integrated with HDF4 by UNM researchers and developers. It can be used for HDF 5 as well."},{"categoryid":318,"description":"Technical Analysis Library for analyzing financial markets trends","firstseen":"2010-05-04T00:54:45.661860","name":"ta-lib","packageid":46945},{"categoryid":318,"description":"ANOVA Extensions to the GNU Scientific Library","firstseen":"2011-02-20T14:37:51.672380","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"tamu_anova","packageid":56973},{"categoryid":318,"description":"C library of sparse linear solvers","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"taucs","packageid":54621,"summary":"TAUCS is a C library of sparse linear solvers. The current version of the library (1.0) includes the following functionality: * Multifrontal Supernodal Cholesky Factorization. * Left-Looking Supernodal Cholesky Factorization. * Drop-Tolerance Incomplete-Cholesky Factorization. * Out-of-Core, Left-Looking Supernodal Sparse Cholesky Factorization. * Out-of-Core Sparse LU with Partial Pivoting Factor and Solve. * Ordering Codes and Interfaces to Existing Ordering Codes. * Multilevel-Support-Graph Preconditioners. * Matrix Operations. * Matrix Input\/Output. * Matrix Generators. * Iterative Solvers. * Vaidya's Preconditioners. * Recursive Vaidya's Preconditioners. * Multilevel-Support-Graph Preconditioners. * Utility Routines"},{"categoryid":318,"description":"provides a tensor-aware channel","firstseen":"2022-05-31T12:09:56.543641","name":"tensorpipe","packageid":75031},{"categoryid":318,"description":"Template Numerical Toolkit: C++ headers for array and matrices","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"tnt","packageid":55734,"summary":"The Template Numerical Toolkit (TNT) is a collection of interfaces and reference implementations of numerical objects useful for scientific computing in C++. The toolkit defines interfaces for basic data structures, such as multidimensional arrays and sparse matrices, commonly used in numerical applications. The goal of this package is to provide reusable software components that address many of the portability and maintenance problems with C++ codes."},{"categoryid":318,"description":"Implementation of today's most used tokenizers","firstseen":"2023-04-11T22:26:01.976325","name":"tokenizers","packageid":76025},{"categoryid":318,"description":"Datasets, transforms and models to specific to computer vision","firstseen":"2025-02-14T22:57:12.973268","name":"torchvision","packageid":78164},{"categoryid":318,"description":"State-of-the-art Machine Learning for JAX, PyTorch and TensorFlow","firstseen":"2023-04-13T07:53:29.786439","name":"transformers","packageid":76028},{"categoryid":318,"description":"Scientific library collection for large scale problems","firstseen":"2019-08-05T07:39:31.134254","name":"trilinos","packageid":70043,"summary":"The Trilinos Project is an effort to develop algorithms and enabling technologies within an object-oriented software framework for the solution of large-scale, complex multi-physics engineering and scientific problems."},{"categoryid":318,"description":"Library for manipulating units of physical quantities","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"udunits","packageid":49941,"summary":"This is the Unidata Units library, which supports conversion of unit specifications between formatted and binary forms, arithmetic manipulation of unit specifications, and conversion of values between compatible scales of measurement."},{"categoryid":318,"description":"Common configuration scripts for the SuiteSparse libraries","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"ufconfig","packageid":55419,"summary":"UFconfig is a set of configuration files for the SuiteSparse matrix libraries from CISE at University of Florida. It contains some headers and makefiles."},{"categoryid":318,"description":"Unsymmetric multifrontal sparse LU factorization library","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"umfpack","packageid":50683,"summary":"UMFPACK is a set of routines for solving unsymmetric sparse linear systems, Ax=b, using the Unsymmetric MultiFrontal method. Includes a C-callable interface, and a Fortran-callable interface. MATLAB routines are not included in the Gentoo package."},{"categoryid":318,"description":"vector optimized library of kernels","firstseen":"2020-06-01T22:17:14.636254","name":"volk","packageid":71191},{"categoryid":318,"description":"3D Voronoi cell software library","firstseen":"2014-02-25T14:36:44.572196","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"voro++","packageid":61950},{"categoryid":318,"description":"The Visualization Toolkit","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"vtk","packageid":54021},{"categoryid":318,"description":"eXtensible Data Model and Format","firstseen":"2014-12-27T14:40:55.550229","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"xdmf2","packageid":62952},{"categoryid":318,"description":"Experimental x-y data reading library","firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"xylib","packageid":46911,"summary":"xylib is a portable C++ library for reading files that contain x-y data from powder diffraction, spectroscopy or other experimental methods. It supports many formats."}]}