adolc
- Ebuilds: 2, Stable: 9999, Testing: 9999 Description:
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.
Homepage:https://projects.coin-or.org/ADOL-C/
alglib
- Ebuilds: 2, Stable: 3.20.0, Testing: 4.07.0 Description:
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.
Homepage:https://www.alglib.net/ License: GPL-2+
amd
- Ebuilds: 2, Stable: 2.4.6-r1, Testing: 3.0.3, 2.4.6-r1 Description:
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.
Homepage:https://people.engr.tamu.edu/davis/suitesparse.html License: BSD
arborx
- Ebuilds: 3, Testing: 2.0 Description:
ArborX is an open-source library designed to provide performance
portable algorithms for geometric search, similarly to nanoflann
and Boost Geometry.
Homepage:https://github.com/arborx/ArborX License: LGPL-2.1+
armadillo
- Ebuilds: 2, Stable: 15.0.3, Testing: 15.0.3 Description:
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.
Homepage:https://arma.sourceforge.net License: Apache-2.0
arpack
- Ebuilds: 2, Stable: 3.9.1, Testing: 9999 Description:
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.
Homepage:http://www.caam.rice.edu/software/ARPACK/ https://github.com/opencollab/arpack-ng
atlas
- Ebuilds: 3, Stable: 3.11.41, Testing: 3.11.41, 3.10.3 Description:
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.
Homepage:https://math-atlas.sourceforge.net License: BSD
blis
- Ebuilds: 3, Testing: 2.0 Description:
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.
Homepage:https://github.com/flame/blis License: BSD
branca
- Ebuilds: 1, Testing: 0.8.2 Description:
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.
Homepage:https://github.com/python-visualization/branca License: MIT
brial
- Ebuilds: 2, Stable: 1.2.12, Testing: 1.2.12-r1 Description:
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.
Homepage:https://github.com/BRiAl/BRiAl License: BSD GPL-2+
btf
- Ebuilds: 2, Stable: 1.2.6, Testing: 2.0.3 Description:
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).
Homepage:https://people.engr.tamu.edu/davis/suitesparse.html License: LGPL-2.1+
buddy
- Ebuilds: 1, Testing: 2.4-r1 Description:
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.
Homepage:https://sourceforge.net/projects/buddy/ License: buddy
camd
- Ebuilds: 2, Stable: 2.4.6-r1, Testing: 3.0.3, 2.4.6-r1 Description:
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).
Homepage:https://people.engr.tamu.edu/davis/suitesparse.html License: BSD
cantera
- Ebuilds: 5, Stable: 3.1.0, Testing: 3.2.0 Description:
Cantera is an open-source suite of object-oriented software tools
for problems involving chemical kinetics, thermodynamics, and/or transport processes.
Homepage:https://www.cantera.org License: BSD
cartopy
- Ebuilds: 2, Testing: 0.25.0 Description:
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.
Homepage:https://scitools.org.uk/cartopy License: BSD
ccfits
- Ebuilds: 1, Stable: 2.5, Testing: 2.5 Description:
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.
Homepage:https://heasarc.gsfc.nasa.gov/fitsio/CCfits/ License: BSD
ccolamd
- Ebuilds: 2, Stable: 2.9.6, Testing: 3.0.3, 2.9.6 Description:
Constrained COLAMD computes an column approximate minimum degree ordering
algorithm, (like COLAMD), but it can also be given a set of ordering
constraints.
Homepage:https://people.engr.tamu.edu/davis/suitesparse.html License: BSD
cdd+
- Ebuilds: 1, Stable: 077a, Testing: 077a Description:
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.
Homepage:http://www.ifor.math.ethz.ch/~fukuda/cdd_home/ License: GPL-2
cddlib
- Ebuilds: 2, Stable: 094m-r2, Testing: 094n Description:
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.
Homepage:https://www.inf.ethz.ch/personal/fukudak/cdd_home/ License: GPL-2+
cdf
- Ebuilds: 2, Stable: 3.9.0, Testing: 3.9.1 Description:
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.
Homepage:https://cdf.gsfc.nasa.gov License: CDF
ceres-solver
- Ebuilds: 1, Stable: 2.2.0-r1, Testing: 2.2.0-r1 Description:
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
Homepage:http://ceres-solver.org/ License: sparse? ( BSD ) !sparse? ( LGPL-2.1 )
cfitsio
- Ebuilds: 1, Stable: 4.6.3, Testing: 4.6.3 Description:
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.
Homepage:https://heasarc.gsfc.nasa.gov/docs/software/fitsio/fitsio.html License: ISC
cgcode
- Ebuilds: 1, Stable: 1.0-r2, Testing: 1.0-r2 Description: Conjugate gradient Codes for large sparse linear systems
Homepage:http://fetk.org/codes/cgcode/index.html License: GPL-2
cgnslib
- Ebuilds: 5, Stable: 4.5.0, Testing: 4.5.1 Description:
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.
Homepage:
https://cgns.github.io/
https://github.com/CGNS/CGNS
License: ZLIB
clblas
- Ebuilds: 1, Testing: 2.12-r2 Description:
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.
Homepage:https://github.com/clMathLibraries/clBLAS License: Apache-2.0
clblast
- Ebuilds: 4, Testing: 1.6.3 Description:
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.
Homepage:https://github.com/CNugteren/CLBlast License: Apache-2.0
cln
- Ebuilds: 1, Stable: 1.3.7, Testing: 1.3.7 Description:
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.
Homepage:https://www.ginac.de/CLN/ License: GPL-2
cmpfit
- Ebuilds: 1, Testing: 1.4 Description:
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.
Homepage:https://pages.physics.wisc.edu/~craigm/idl/cmpfit.html License: public-domain minpack
coinor-alps
- Ebuilds: 1, Testing: 1.5.7 Description:
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.
Homepage:https://projects.coin-or.org/CHiPPS/ License: EPL-1.0
coinor-bcp
- Ebuilds: 1, Testing: 1.4.4 Description:
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.
Homepage:https://projects.coin-or.org/Bcp/ License: CPL-1.0
coinor-bcps
- Ebuilds: 1, Testing: 0.94.5 Description:
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.
Homepage:https://projects.coin-or.org/CHiPPS/ License: EPL-1.0
coinor-blis
- Ebuilds: 1, Testing: 0.94.8 Description:
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.
Homepage:https://projects.coin-or.org/CHiPPS/ License: EPL-1.0
coinor-bonmin
- Ebuilds: 1, Testing: 1.8.8 Description:
BONMIN (Basic Open-source Nonlinear Mixed INteger programming) is an
open-source code for solving general MINLP (Mixed Integer NonLinear
Programming) problems.
Homepage:https://projects.coin-or.org/Bonmin/ License: EPL-1.0
coinor-cbc
- Ebuilds: 2, Testing: 2.10.12 Description:
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.
Homepage:https://github.com/coin-or/Cbc/ License: EPL-1.0
coinor-cgl
- Ebuilds: 2, Testing: 0.60.9 Description:
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.
Homepage:https://projects.coin-or.org/Cgl/ License: EPL-1.0
coinor-clp
- Ebuilds: 3, Testing: 1.17.10 Description:
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.
Homepage:https://github.com/coin-or/Clp License: EPL-1.0
coinor-couenne
- Ebuilds: 1, Testing: 0.5.8-r1 Description:
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.
Homepage:https://projects.coin-or.org/Couenne/ License: EPL-1.0
coinor-csdp
- Ebuilds: 1, Testing: 6.2.0 Description:
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.
Homepage:https://projects.coin-or.org/Csdp/ License: EPL-2.0
coinor-dip
- Ebuilds: 1, Testing: 0.95.0-r2 Description:
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.
Homepage:https://projects.coin-or.org/Dip/ License: EPL-1.0
coinor-dylp
- Ebuilds: 1, Testing: 1.10.4-r1 Description:
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).
Homepage:https://github.com/coin-or/DyLP/ License: EPL-1.0
coinor-flopcpp
- Ebuilds: 1, Testing: 1.2.5 Description:
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.
Homepage:https://projects.coin-or.org/FlopC++/ License: EPL-1.0
coinor-mp
- Ebuilds: 1, Testing: 1.8.4 Description:
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.
Homepage:https://projects.coin-or.org/CoinMP/ License: CPL-1.0
coinor-osi
- Ebuilds: 2, Testing: 0.108.11 Description:
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.
Homepage:https://github.com/coin-or/Osi/ License: EPL-1.0
coinor-sample
- Ebuilds: 1, Testing: 1.2.12 Description:
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.
Homepage:https://github.com/coin-or-tools/Data-Sample/ License: EPL-1.0
coinor-smi
- Ebuilds: 1, Testing: 0.96.1 Description:
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.
Homepage:https://projects.coin-or.org/Smi/ License: CPL-1.0
coinor-symphony
- Ebuilds: 1, Testing: 5.6.17 Description:
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).
Homepage:https://projects.coin-or.org/SYMPHONY/ License: EPL-1.0
coinor-utils
- Ebuilds: 3, Testing: 2.11.12 Description:
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.
Homepage:https://github.com/coin-or/CoinUtils/ License: EPL-1.0
coinor-vol
- Ebuilds: 1, Testing: 1.5.4 Description:
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.
Homepage:https://github.com/coin-or/Vol/ License: EPL-1.0
colamd
- Ebuilds: 2, Stable: 2.9.6, Testing: 3.0.3, 2.9.6 Description:
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.
Homepage:https://people.engr.tamu.edu/davis/suitesparse.html License: BSD
colpack
- Ebuilds: 1, Stable: 1.0.10, Testing: 1.0.10 Description:
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.
Homepage:https://cscapes.cs.purdue.edu/coloringpage/ License: GPL-3 LGPL-3
cqrlib
- Ebuilds: 1, Stable: 1.1.4, Testing: 1.1.4 Description: Utility library for quaternion arithmetic / rotation math (ANSI C implemented)
Homepage:http://cqrlib.sourceforge.net/ License: LGPL-2.1
cxsparse
- Ebuilds: 2, Stable: 3.2.0, Testing: 4.0.3 Description:
CXSparse is an extended version of CSparse, a sparse matrix package,
with support for double or complex matrices, with int or long
integers.
Homepage:https://people.engr.tamu.edu/davis/suitesparse.html License: LGPL-2.1+
dealii
- Ebuilds: 2, Testing: 9999 Description:
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.
Homepage:https://www.dealii.org/
dlib
- Ebuilds: 3, Testing: 20.0 Description:
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.
Homepage:https://dlib.net/ License: Boost-1.0
dmlc-core
- Ebuilds: 2, Testing: 0.5 Description:
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.
Homepage:https://github.com/dmlc/dmlc-core
dsdp
- Ebuilds: 1, Stable: 5.8-r4, Testing: 5.8-r4 Description:
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.
Homepage:https://www.mcs.anl.gov/hs/software/DSDP/ License: BSD
fetk
- Ebuilds: 1, Stable: 1.5, Testing: 1.5 Description:
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).
Homepage:http://fetk.org/ License: GPL-2
fflas-ffpack
- Ebuilds: 1, Stable: 2.5.0-r1, Testing: 2.5.0-r1 Description:
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.
Homepage:https://linbox-team.github.io/fflas-ffpack/ License: LGPL-2.1+
fftw
- Ebuilds: 2, Stable: 3.3.10-r1, Testing: 9999 Description:
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.
Homepage:https://www.fftw.org/ License: GPL-2+
flann
- Ebuilds: 1, Stable: 1.9.2_p20221027-r1, Testing: 1.9.2_p20221027-r1 Description:
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.
Homepage:https://github.com/flann-lib/flann License: BSD
fplll
- Ebuilds: 1, Stable: 5.5.0, Testing: 5.5.0 Description: Implementations of the floating-point LLL reduction algorithm
Homepage:https://github.com/fplll/fplll License: LGPL-2.1+
galib
- Ebuilds: 1, Testing: 2.4.7-r2 Description:
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.
Homepage:http://lancet.mit.edu/ga/ License: BSD examples? ( GPL-2 )
gaul-devel
- Ebuilds: 1, Testing: 0.1849-r2 Description:
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.
Homepage:https://gaul.sourceforge.net License: GPL-2+
gdal
- Ebuilds: 3, Stable: 3.12.1, 3.9.3-r1, Testing: 3.12.1, 3.11.4-r1 Description:
GDAL is the Geospatial Data Abstraction Library, a set of tools for
converting between geospatial raster data formats (includes OGR for
vector data).
Homepage:https://gdal.org/ License: BSD Info-ZIP MIT
geos
- Ebuilds: 5, Stable: 3.13.0, Testing: 3.14.1 Description:
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.
Homepage:https://libgeos.org/ License: LGPL-2.1
gerris
- Ebuilds: 1, Testing: 20131206-r1 Description:
Gerris Flow Solver is a software program for the solution of the partial
differential equations describing fluid flow.
Homepage:http://gfs.sourceforge.net/ License: GPL-2
getdata
- Ebuilds: 2, Testing: 0.11.0-r2 Description:
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.
Homepage:https://getdata.sourceforge.net License: LGPL-2.1+
ginkgo
- Ebuilds: 4, Testing: 1.10.0 Description:
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.
Homepage:https://ginkgo-project.github.io/
gsl
- Ebuilds: 2, Stable: 2.7.1-r3, Testing: 2.7.1-r3 Description:
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.
Homepage:https://www.gnu.org/software/gsl/ License: GPL-3+
gts
- Ebuilds: 1, Stable: 20121130, Testing: 20121130 Description:
Gerris Flow Solver is a software program for the solution of the partial
differential equations describing fluid flow.
Homepage:http://gts.sourceforge.net/ License: LGPL-2
hdf
- Ebuilds: 1, Stable: 4.2.15-r2, Testing: 4.2.15-r2 Description:
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.
Homepage:https://www.hdfgroup.org/hdf4.html License: NCSA-HDF
hdf5
- Ebuilds: 4, Stable: 1.14.6-r2, Testing: 1.14.6-r2, 1.14.6-r1 Description:
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.
Homepage:https://github.com/HDFGroup/hdf5/ License: NCSA-HDF
htslib
- Ebuilds: 5, Stable: 1.20, Testing: 1.23 Description: C library for high-throughput sequencing data formats
Homepage:http://www.htslib.org/ License: MIT
idlcoyote
- Ebuilds: 2, Testing: 99999999 Description:
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.
Homepage:http://www.idlcoyote.com/ License: BSD GPL-2
idlmarkwardt
- Ebuilds: 1, Testing: 20160319-r1 Description:
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
Homepage:http://cow.physics.wisc.edu/~craigm/idl/idl.html License: Markwardt
iml
- Ebuilds: 1, Stable: 1.0.5-r1, Testing: 1.0.5-r1 Description: a free library of C source code which implements algorithms for computing exact solutions to dense systems of linear equations over the integers
Homepage:https://www.cs.uwaterloo.ca/~astorjoh/iml.html License: GPL-2 BSD
inchi
- Ebuilds: 1, Stable: 1.06-r1, Testing: 1.06-r1 Description: Program and library for generating standard and non-standard InChI and InChIKeys
Homepage:https://www.iupac.org/inchi/ License: IUPAC-InChi
ipopt
- Ebuilds: 1, Testing: 3.14.4-r1 Description:
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).
Homepage:https://github.com/coin-or/Ipopt License: EPL-1.0
itpp
- Ebuilds: 1, Stable: 4.3.1-r2, Testing: 4.3.1-r2 Description:
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 .
Homepage:https://itpp.sourceforge.net License: GPL-3+
jama
- Ebuilds: 1, Testing: 1.2.5-r1 Description:
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.
Homepage:https://math.nist.gov/tnt/ License: public-domain
kissfft
- Ebuilds: 3, Stable: 131.2.0, Testing: 9999 Description: Fast Fourier Transform (FFT) library that tries to Keep it Simple, Stupid
Homepage:https://github.com/mborgerding/kissfft
klu
- Ebuilds: 2, Stable: 1.3.9-r2, Testing: 2.0.3 Description:
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.
Homepage:https://people.engr.tamu.edu/davis/suitesparse.html License: LGPL-2.1+
lapack
- Ebuilds: 3, Stable: 3.12.1-r2, Testing: 3.12.1-r2 Description:
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.
Homepage:https://www.netlib.org/lapack/ License: BSD
ldl
- Ebuilds: 2, Stable: 2.2.6, Testing: 3.0.3 Description:
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.
Homepage:http://people.engr.tamu.edu/davis/suitesparse.html License: LGPL-2.1+
lemon
- Ebuilds: 1, Testing: 1.3.1-r2 Description:
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.
Homepage:https://lemon.cs.elte.hu/trac/lemon/ License: Boost-1.0
levmar
- Ebuilds: 1, Testing: 2.6-r1 Description:
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.
Homepage:https://www.ics.forth.gr/~lourakis/levmar/ License: GPL-2
libaec
- Ebuilds: 1, Stable: 1.1.4, Testing: 1.1.4 Description:
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.
Homepage:https://gitlab.dkrz.de/k202009/libaec License: BSD-2
libbraiding
- Ebuilds: 1, Stable: 1.3.1, Testing: 1.3.1 Description:
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.
Homepage:https://github.com/miguelmarco/libbraiding License: GPL-3+
libcerf
- Ebuilds: 2, Stable: 2.5, 1.17, Testing: 2.5 Description: Efficient and accurate implementation of complex error functions
Homepage:https://jugit.fz-juelich.de/mlz/libcerf License: MIT
libdap
- Ebuilds: 2, Stable: 3.20.9-r1, Testing: 3.21.1 Description:
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
Homepage:https://www.opendap.org License: || ( LGPL-2.1 URI )
libecpint
- Ebuilds: 1, Testing: 1.0.6-r1 Description:
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.
Homepage:https://github.com/robashaw/libecpint License: MIT
libigl
- Ebuilds: 1, Stable: 2.5.0, Testing: 2.5.0 Description:
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.
Homepage:https://libigl.github.io/ License: GPL-2+ MPL-2.0
libint
- Ebuilds: 3, Stable: 2.11.0, Testing: 2.11.0 Description:
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.
Homepage:https://github.com/evaleev/libint License: GPL-2
libnova
- Ebuilds: 1, Stable: 0.16.0, Testing: 0.16.0 Description:
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.
Homepage:https://libnova.sourceforge.net/ License: LGPL-2
libqalculate
- Ebuilds: 2, Stable: 5.8.2, Testing: 5.9.0 Description: A modern multi-purpose calculator library
Homepage:https://qalculate.github.io/ License: GPL-2+
libsc
- Ebuilds: 2, Testing: 2.8.7 Description:
The SC Library provides support for parallel scientific applications.
This support library is primarily used by <pkg>sci-libs/p4est</pkg>.
Homepage:http://www.p4est.org/
libsemigroups
- Ebuilds: 2, Testing: 3.0.3 Description:
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).
Homepage:https://github.com/libsemigroups/libsemigroups License: GPL-3+
libsigrok
- Ebuilds: 2, Testing: 9999 Description:
libsigrok is a shared library written in C, which provides the basic
hardware access drivers for logic analyzers and other supported devices,
as well as input/output file format support.
Homepage:https://sigrok.org/wiki/Libsigrok License: GPL-3
libsvm
- Ebuilds: 1, Stable: 3.30, Testing: 3.30 Description:
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.
Homepage:https://www.csie.ntu.edu.tw/~cjlin/libsvm/ License: BSD
libticables2
- Ebuilds: 1, Testing: 1.3.5-r1 Description:
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.
Homepage:http://lpg.ticalc.org/prj_tilp/ License: GPL-2
libticalcs2
- Ebuilds: 1, Testing: 1.1.9-r1 Description:
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
Homepage:http://lpg.ticalc.org/prj_tilp/ License: GPL-2
libticonv
- Ebuilds: 1, Testing: 1.1.5-r1 Description:
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.
Homepage:http://lpg.ticalc.org/prj_tilp/ License: GPL-2
libtifiles2
- Ebuilds: 1, Testing: 1.1.7-r1 Description:
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.
Homepage:http://lpg.ticalc.org/prj_tilp/ License: GPL-2
libxc
- Ebuilds: 1, Stable: 5.1.7, Testing: 5.1.7 Description:
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.
Homepage:https://octopus-code.org/wiki/Libxc License: MPL-2.0
linbox
- Ebuilds: 1, Stable: 1.7.1, Testing: 1.7.1 Description:
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).
Homepage:https://linalg.org/ License: GPL-2+ LGPL-2.1
lis
- Ebuilds: 2, Testing: 2.1.3 Description:
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.
Homepage:https://www.ssisc.org/lis/index.en.html License: BSD
lmfit
- Ebuilds: 1, Stable: 9.0-r1, Testing: 9.0-r1 Description: library for Levenberg-Marquardt least-squares minimization and curve fitting
Homepage:https://jugit.fz-juelich.de/mlz/lmfit License: BSD-2
lrslib
- Ebuilds: 2, Stable: 073, Testing: 073 Description: 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.
Homepage:https://cgm.cs.mcgill.ca/~avis/C/lrs.html License: GPL-2+
m4ri
- Ebuilds: 2, Stable: 20240729, Testing: 20250128-r1 Description:
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.
Homepage:https://github.com/malb/m4ri License: GPL-2+
m4rie
- Ebuilds: 3, Stable: 20250103-r1, Testing: 20250128 Description:
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.
Homepage:https://github.com/malb/m4rie License: GPL-2+
mathgl
- Ebuilds: 1, Testing: 8.0.3 Description:
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
Homepage:https://mathgl.sourceforge.net License: LGPL-3+
matio
- Ebuilds: 2, Stable: 1.5.28, Testing: 1.5.28 Description:
matio is an ISO C library (with a limited Fortran 90 interface) for
reading and writing Matlab MAT files.
Homepage:https://sourceforge.net/projects/matio/ License: BSD-2
mc
- Ebuilds: 1, Stable: 1.5-r1, Testing: 1.5-r1 Description: 2D/3D AFEM code for nonlinear geometric PDE
Homepage:http://fetk.org/codes/mc/index.html License: GPL-2
metis
- Ebuilds: 1, Stable: 5.2.1-r2, Testing: 5.2.1-r2 Description:
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.
Homepage:https://github.com/KarypisLab/METIS License: Apache-2.0
mkl
- Ebuilds: 2, Testing: 2025.3.1.8 Description:
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.
Homepage:https://www.intel.com/content/www/us/en/developer/tools/oneapi/onemkl.html License: ISSL
mpfi
- Ebuilds: 1, Stable: 1.5.4_p20220401, Testing: 1.5.4_p20220401 Description:
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.
Homepage:https://perso.ens-lyon.fr/nathalie.revol/software.html https://gitlab.inria.fr/mpfi/mpfi License: GPL-3 LGPL-3 LGPL-2.1+
mumps
- Ebuilds: 1, Testing: 5.3.5-r1 Description:
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.
Homepage:https://mumps-solver.org/ License: public-domain
nanoflann
- Ebuilds: 2, Testing: 9999 Description:
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 <pkg>sci-libs/flann</pkg> library.
Homepage:https://github.com/jlblancoc/nanoflann
netcdf
- Ebuilds: 3, Stable: 4.9.3-r2, Testing: 4.9.3-r2, 4.9.2 Description:
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.
Homepage:https://www.unidata.ucar.edu/software/netcdf/ License: UCAR-Unidata
netcdf-cxx
- Ebuilds: 3, Stable: 4.3.1-r1, Testing: 4.3.1-r1 Description:
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.
Homepage:https://www.unidata.ucar.edu/software/netcdf/ License: UCAR-Unidata
netcdf-fortran
- Ebuilds: 3, Testing: 4.6.1 Description:
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.
Homepage:https://www.unidata.ucar.edu/software/netcdf/ License: UCAR-Unidata
nlopt
- Ebuilds: 2, Stable: 2.10.0-r1, Testing: 2.10.0-r1 Description:
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.
Homepage:https://github.com/stevengj/nlopt License: LGPL-2.1 MIT
numkit
- Ebuilds: 1, Testing: 1.3.1 Description: Numerical first aid kit (with numpy/scipy)
Homepage:https://numkit.readthedocs.io License: BSD
oc
- Ebuilds: 1, Testing: 2.0-r1 Description:
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.
Homepage:https://opendap.org/ License: LGPL-2
octomap
- Ebuilds: 1, Testing: 1.10.0-r1 Description:
The OctoMap library implements a 3D occupancy grid mapping approach, providing data structures and mapping algorithms in C++ particularly suited for robotics.
Homepage:https://octomap.github.io/ License: BSD qt6? ( GPL-2 )
openblas
- Ebuilds: 3, Stable: 0.3.31, 0.3.30-r5, Testing: 0.3.32 Description:
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.
Homepage:https://github.com/OpenMathLib/OpenBLAS License: BSD
opencascade
- Ebuilds: 3, Stable: 7.8.1, Testing: 9999 Description: Development platform for CAD/CAE, 3D surface/solid modeling and data exchange
Homepage:https://www.opencascade.com
openlibm
- Ebuilds: 1, Stable: 0.8.3, Testing: 0.8.3 Description:
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.
Homepage:https://github.com/JuliaLang/openlibm License: public-domain MIT ISC BSD-2 LGPL-2.1+
orocos-bfl
- Ebuilds: 1, Testing: 0.8.0 Description:
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.
Homepage:https://orocos.org/bfl License: LGPL-2.1
p4est
- Ebuilds: 2, Testing: 2.8.7 Description:
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.
Homepage:http://www.p4est.org/
parmetis
- Ebuilds: 1, Stable: 4.0.3_p20230326-r1, Testing: 4.0.3_p20230326-r1 Description:
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.
Homepage:https://github.com/KarypisLab/ParMETIS License: all-rights-reserved
pastix
- Ebuilds: 1, Stable: 6.0.3, Testing: 6.0.3 Description:
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.
Homepage:https://solverstack.gitlabpages.inria.fr/pastix/ https://gitlab.inria.fr/solverstack/pastix License: CeCILL-C
pcl
- Ebuilds: 2, Stable: 1.14.1-r3, Testing: 9999 Description:
The Point Cloud Library (PCL) is a standalone, large scale, open project for 2D/3D image and point cloud processing.
Homepage:https://pointclouds.org/ License: BSD
pdal
- Ebuilds: 3, Stable: 2.9.2, Testing: 2.10.0 Description:
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.
Homepage:https://pdal.io/ License: BSD
pgplot
- Ebuilds: 2, Stable: 5.2.2-r9, Testing: 5.2.2-r9 Description:
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.
Homepage:https://www.astro.caltech.edu/~tjp/pgplot/ License: free-noncomm
plplot
- Ebuilds: 1, Testing: 5.15.0_p15-r1 Description: 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.
Homepage:https://plplot.sourceforge.net License: LGPL-2
primegen
- Ebuilds: 1, Stable: 0.97-r3, Testing: 0.97-r3 Description:
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.
Homepage:https://cr.yp.to/primegen.html License: public-domain
punc
- Ebuilds: 1, Stable: 1.5-r1, Testing: 1.5-r1 Description:
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.
Homepage:http://fetk.org/codes/punc/index.html License: GPL-2
pyshp
- Ebuilds: 3, Testing: 3.0.3 Description: Pure Python read/write support for ESRI Shapefile format
Homepage:https://pypi.org/project/pyshp/ License: MIT
qfits
- Ebuilds: 1, Testing: 6.2.0-r1 Description:
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.
Homepage:https://www.eso.org/sci/software/eclipse/qfits/ License: GPL-2
scalapack
- Ebuilds: 1, Testing: 2.2.0_p20240704 Description:
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.
Homepage:https://www.netlib.org/scalapack/ License: BSD
scotch
- Ebuilds: 2, Stable: 7.0.8, Testing: 7.0.8 Description:
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.
Homepage:https://www.labri.u-bordeaux.fr/perso/pelegrin/scotch/ https://gitlab.inria.fr/scotch/scotch License: CeCILL-2
spglib
- Ebuilds: 2, Testing: 2.7.0 Description: Spglib is a C library for finding and handling crystal symmetries
Homepage:https://github.com/spglib/spglib/ License: BSD
spqr
- Ebuilds: 2, Stable: 2.0.9-r4, Testing: 3.0.3 Description:
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.
Homepage:https://people.engr.tamu.edu/davis/suitesparse.html License: GPL-2+
spr
- Ebuilds: 1, Testing: 3.3.2-r2 Description:
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.
Homepage:https://statpatrec.sourceforge.net/ License: GPL-2
suitesparse
- Ebuilds: 1, Stable: 5.4.0, Testing: 5.4.0 Description:
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
Homepage:https://people.engr.tamu.edu/davis/suitesparse.html License: metapackage
suitesparseconfig
- Ebuilds: 2, Stable: 5.4.0, Testing: 7.0.0, 5.4.0 Description:
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.
Homepage:https://people.engr.tamu.edu/davis/suitesparse.html License: public-domain
sundials
- Ebuilds: 7, Stable: 7.3.0, Testing: 7.5.0 Description:
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.
Homepage:https://computing.llnl.gov/projects/sundials License: BSD
superlu
- Ebuilds: 3, Stable: 7.0.1, Testing: 7.0.1, 4.3-r4 Description:
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.
Homepage:https://portal.nersc.gov/project/sparse/superlu/ License: BSD
superlu_mt
- Ebuilds: 1, Stable: 3.1-r1, Testing: 3.1-r1 Description:
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).
Homepage:https://portal.nersc.gov/project/sparse/superlu/ License: BSD
symengine
- Ebuilds: 1, Stable: 0.14.0-r3, Testing: 0.14.0-r3 Description:
SymEngine is a standalone fast C++ symbolic manipulation
library. Optional thin wrappers allow usage of the library from R,
Python, Julia, Ruby, Haskell.
Homepage:https://github.com/symengine/symengine/ License: MIT
szip
- Ebuilds: 1, Stable: 2.1.1, Testing: 2.1.1 Description:
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.
Homepage:https://www.hdfgroup.org/doc_resource/SZIP/ License: szip
taucs
- Ebuilds: 1, Testing: 2.2.1 Description:
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
Homepage:https://github.com/sivantoledo/taucs/ License: LGPL-2.1
tnt
- Ebuilds: 1, Testing: 3.0.12 Description:
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.
Homepage:https://math.nist.gov/tnt/ License: public-domain
trilinos
- Ebuilds: 4, Testing: 17.0.0 Description:
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.
Homepage:http://trilinos.sandia.gov/ License: BSD LGPL-2.1
udunits
- Ebuilds: 1, Stable: 2.2.28, Testing: 2.2.28 Description:
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.
Homepage:https://www.unidata.ucar.edu/software/udunits/ License: UCAR-BSD
ufconfig
- Ebuilds: 1, Stable: 3.7.1, Testing: 3.7.1 Description:
UFconfig is a set of configuration files for the SuiteSparse matrix libraries
from CISE at University of Florida. It contains some headers and
makefiles.
Homepage:http://www.cise.ufl.edu/research/sparse/UFconfig License: LGPL-2.1
umfpack
- Ebuilds: 3, Stable: 5.7.9-r1, Testing: 6.1.0, 5.7.9-r1 Description:
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.
Homepage:https://people.engr.tamu.edu/davis/suitesparse.html License: GPL-2+
xylib
- Ebuilds: 1, Testing: 1.6-r2 Description:
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.
Homepage:https://github.com/wojdyr/xylib License: LGPL-2.1