Ports Search

LASPack (version 1.12.2) LASPack is a package for solving large sparse systems of linear equations like those which arise from discretization of partial differential equations. Main features: - The primary aim of LASPack is the implementation of efficient iterative methods for the solution of systems of linear equations. - Beside the obligatory Jacobi, succesive over-relaxation, Chebyshev, and conjugate gradient solvers, LASPack contains selected state-of-the-art algorithms which are commonly used for large sparse systems: - CG-like methods for non-symmetric systems: CGN, GMRES, BiCG, QMR, CGS, and BiCGStab, - multilevel methods such as multigrid and conjugate gradient method preconditioned by multigrid and BPX preconditioners. A complete description of the package (including the installation procedure) you may find in LASPack Reference Manual:

libflame contains implementations of many dense linear algebra operations that are provided by the BLAS and LAPACK libraries. (However, not all FLAME implementations support every datatype, and, in many cases, libflame uses a different naming convention for the routines.) The library is a product of the Formal Linear Algebra Methods Environment (FLAME), which encompasses a new notation for expressing algorithms, a methodology for systematic derivation of algorithms, Application Program Interfaces (APIs) for representing the algorithms in code, and tools for mechanical derivation, implementation and analysis of algorithms and implementations.

Matrix Math is software to quickly and easily compute functions of matrices of any size. It supports addition, subtraction, multiplication, inversion, division, and will support whatever else is necessary.

nauty is a program for computing automorphism groups of graphs and digraphs. It can also produce a canonical labelling.

This is a collection of stopgap replacements for standard math functions missing from libm in various supported versions of FreeBSD. The functions are slower than the existing libm functions, but are more accurate than many naive replacements. Exceptions are largely ignored. N. Beebe's extended C version of the ELEFUNT package is used to provide regression tests for some of the real-valued functions.

The package is intended for scientists and engineers who need to manipulate a variety of types of matrices using standard matrix operations. Emphasis is on the kind of operations needed in statistical calculations such as least squares, linear equation solve and eigenvalues.

libocas implements an Optimized Cutting Plane Algorithm (OCAS) for training linear SVM classifiers from large-scale data. The computational effort of OCAS scales with O(m log m) where m is the sample size. In an extensive empirical evaluation, OCAS significantly outperforms current state-of-the-art SVM solvers. libocas also implements the COFFIN framework for efficient training of translation invariant image classifiers from virtual examples.

Hoc, the High Order Calculator, is an interpreted language for floating-point calculations. Its most basic use is as a powerful and convenient calculator, interactively evaluating expressions such as 1+2*sin(0.7). But hoc is no ordinary calculator: It also lets you assign values to variables, define your own functions, and use loops, conditionals, and everything else you'd expect in a programming language. Hoc was developed by Brian Kernighan and Rob Pike, and introduced in their 1984 book The Unix Programming Environment. This version has been extended and improved by Nadav Y. Har'El.

libranlip is a C++ library created by G. Beliakov, which generates random variates with arbitrary Lipschitz-continuous densities via the acceptance / rejection method. The density should have a dimension of no more than about five. The user needs to supply the density function using a simple syntax, and then call the methods of construction and generation provided in libranlip.