Ports Search

BlockSolve95 is a scalable parallel software library primarily intended for the solution of sparse linear systems that arise from physical models, especially problems involving multiple degrees of freedom at each node. For example, when the finite element method is used to solve practical problems in structural engineering, each node typically has two to five degrees of freedom; BlockSolve95 is designed to take advantage of problems with this type of local structure. BlockSolve95 is also reasonably efficient for problems that have only one degree of freedom associated with each node, such as the three- dimensional Poisson problem. BlockSolve95 is general purpose; we do not require that the matrices have any particular structure other than being sparse and being symmetric in structure (but not necessarily in value).

This is a reference implementation of the C interface to the legacy Fortran Basic Linear Algebra Subprograms (BLAS), as described in Annex B of the BLAS Technical Forum (BLAST) Standard.

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

CVC3 is an automatic theorem prover for Satisfiability Modulo Theories (SMT) problems. It can be used to prove the validity (or, dually, the satisfiability) of first-order formulas in a large number of built-in logical theories and their combination. CVC3 is the last offspring of a series of popular SMT provers, which originated at Stanford University with the SVC system. In particular, it builds on the code base of CVC Lite, its most recent predecessor. Its high level design follows that of the Sammy prover. CVC3 works with a version of first-order logic with polymorphic types and has a wide variety of features including: * several built-in base theories: rational and integer linear arithmetic, arrays, tuples, records, inductive data types, bit vectors, and equality over uninterpreted function symbols; * support for quantifiers; * an interactive text-based interface; * a rich C and C++ API for embedding in other systems; * proof and model generation abilities; * predicate subtyping; * essentially no limit on its use for research or commercial purposes (see license).

Diehard is a battery of tests for random number generators developed by Dr. George Marsaglia of Florida State University Department of Statistics. Originally developed for testing pseudo-random generators, Diehard has since become a de facto standard for testing RNGs.

EdenMath is a scientific calculator. It does standard arithmetic, probability, and trigonometric functions. LICENSE: GPL2 or later

bc is an arbitrary precision numeric processing language. Syntax is similar to C but differs in many substantial areas. It supports interactive execution of statements. The bc utility is included in the POSIX 1003.1-2008 standard.

This port installs the prerequisites for Mathworks (r) Matlab for Linux and an installer script (matlab-installer), which automates the somewhat tricky process of installing Linux Matlab. Installing Matlab requires Matlab installation media and a license file and installation key from Mathworks, Inc.

Agda is a dependently typed functional programming language: It has inductive families, which are similar to Haskell's GADTs, but they can be indexed by values and not just types. It also has parameterised modules, mixfix operators, Unicode characters, and an interactive Emacs interface (the type checker can assist in the development of your code). Agda is also a proof assistant: It is an interactive system for writing and checking proofs. Agda is based on intuitionistic type theory, a foundational system for constructive mathematics developed by the Swedish logician Per Martin-Lof. It has many similarities with other proof assistants based on dependent types, such as Coq, Epigram and NuPRL.

Instances of numeric classes for functions and tuples.