Ports Search

The general purpose of this library is to provide C language procedures related to cartographic processes. Procedures for each of the processes will be strictly categorized and although they may share common subfunctions they will not intersect in scope.

lrng is a collection of uniform pseudorandom number generators, written in C, and based on algorithms by Francois Panneton, Pierre L'Ecuyer, and Makoto Matsumoto.

FaCiLe is a constraint programming library on integer and integer set finite domains written in OCaml. It offers all usual facilities to create and manipulate finite domain variables, arithmetic expressions and constraints, built-in global constraints and search and optimization goals. FaCiLe allows as well to build easily user-defined constraints and goals, making pervasive use of OCaml higher-order functionals to provide a simple and flexible interface for the user.

Msieve is a library and utility for factoring large integers using the most powerful modern algorithms. It features a stable and very fast implementation of a self-initializing multiple polynomial quadratic sieve (MPQS), plus a somewhat experimental general number field sieve (GNFS) implementation. Primary design goals are speed, portability and ease of use. Msieve claims to be the fastest implementation for factoring general inputs between 40 and 100 decimal digits, but can handle larger input as well.

The Matrix Template Library (MTL) is a high-performance generic component library that provides comprehensive linear algebra functionality for a wide variety of matrix formats. As with the Standard Template Library (STL), MTL uses a five-fold approach, consisting of generic functions, containers, iterators, adaptors, and function objects, all developed specifically for high performance numerical linear algebra. Within this framework, MTL provides generic algorithms corresponding to the mathematical operations that define linear algebra. Similarly, the containers, adaptors, and iterators are used to represent and to manipulate concrete linear algebra objects such as matrices and vectors.

MUMPS is a Distributed Multifrontal Solver (F90, MPI based) with Dynamic Distributed Scheduling to accomodate both numerical fill-in and multi-user environment. - Solution of large linear systems with symmetric positive definite matrices; general symmetric matrices; general unsymmetric matrices. - Version for complex arithmetic. - Parallel factorization and solve phases (uniprocessor version also available). - Iterative refinement and backward error analysis. - Various matrix input formats: assembled format; distributed assembled format; elemental format. - Partial factorization and Schur complement matrix. - Several orderings interfaced : AMD, AMF, PORD, METIS

ocamlgsl is an interface to GSL (GNU scientific library), for the Objective Caml langage.

The FFLAS-FFPACK library provides dense linear algebra routines over word-size prime finite fields.

Bit::ShiftReg is a perl module that implements rotate left, rotate right, arithmetic shift left, and logical shift right operations with carry flag for all C integer types. The results depend on the number of bits with that the integer types unsigned char, unsigned short, unsigned int, and unsigned long have on your machine. The module automatically determines the number of bits of each integer type and adjusts its internal constants accordingly.

This module is about the native floating point numerical data type. A floating point number is one of the types of datum that can appear in the numeric part of a Perl scalar. This module supplies constants describing the native floating point type, classification functions, and functions to manipulate floating point values at a low level.