Ports Search

The current version of the library includes the following functionality: * Multifrontal Supernodal Cholesky Factorization. * Left-Looking Supernodal Cholesky Factorization. * Drop-Tolerance Incomplete-Cholesky Factorization. * LDL^T 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. * Matrix Operations. * Matrix Input/Output. * Matrix Generators. * Iterative Solvers. * Vaidya's Preconditioners. * Recursive Vaidya's Preconditioners. * Multilevel-Support-Graph Preconditioners. * Utility Routines. Copyright (c) 2001 by Sivan Toledo, Tel-Aviv University, stoledo@tau.ac.il. All Rights Reserved.

TestU01 is a software library, implemented in the ANSI C language, and offering a collection of utilities for the empirical statistical testing of uniform random number generators. The library implements several types of random number generators in generic form, as well as many specific generators proposed in the literature or found in widely-used software. It provides general implementations of the classical statistical tests for random number generators, as well as several others proposed in the literature, and some original ones. These tests can be applied to the generators predefined in the library and to user-defined generators. Specific tests suites for either sequences of uniform random numbers in [0,1] or bit sequences are also available. Basic tools for plotting vectors of points produced by generators are provided as well. Additional software permits one to perform systematic studies of the interaction between a specific test and the structure of the point sets produced by a given family of random number generators. That is, for a given kind of test and a given class of random number generators, to determine how large should be the sample size of the test, as a function of the generator's period length, before the generator starts to fail the test systematically.

TetGen is a program for generating tetrahedral meshes for arbitrary 3D domains. The main purpose of TetGen is to create high-quality tetrahedral meshes for solving partial differential equations using finite element and finite volume methods. This program, based on Delaunay methods, currently generates meshes including exact constrained Delaunay tetrahedralizations and quality (conforming Delaunay) meshes. For a 3D point set, it generates its exact Delaunay tetrahedralization and convex hull as well. The program is written in ANSI C++. It is highly portable, it should be very easy to compile and run on all major computer systems. It can be also used as a library embedded into other applications.

The TiMBL software package is a fast, decision-tree-based implementation of k-nearest neighbor classification. The package includes the IB1, IB2, TRIBL, TRIBL2, and IGTree algorithms, and offers various weighting metrics.

Triangle generates exact Delaunay triangulations, constrained Delaunay triangulations, Voronoi diagrams, and quality conforming Delaunay triangulations. The latter can be generated with no small angles, and are thus suitable for finite element analysis. Show Me graphically displays (using X) the contents of geometric files, especially those generated by Triangle, my two-dimensional quality mesh generator and Delaunay triangulator. Show Me can also write PostScript images to files.

This portable, modular Fortran 90 software package implements the thick-restart Lanczos method, for use with real symmetric or complex Hermitian eigenvalue problems where a small number of eigevalues and eigenvectors are needed, and the matrices involved may be too large to store in computer memory. Most of the arithmetic computations in the software are done through calls to BLAS and LAPACK. The software can be instructed to write checkpoint files so that it can be restarted is a later time.

This Tiny Vector and Matrix template library uses Meta and Expression Templates to evaluate results at compile time, thus making it fast for low-end systems. Temporaries are avoided because of this. The dimensions are static and bounded at compile time.

UFC (Unified Form-assembly Code) is a unified framework for finite element assembly.

The Free Software Foundation's "units" unit conversion and calculation utility. GNU units converts quantities expressed in various scales to their equivalents in other scales. Units can only handle multiplicative scale changes. For example, it cannot convert Celsius to Fahrenheit but it can convert temperature differences between those temperature scales. The units are defined externally in an extensive, well annotated data file that defines over 2000 units. You can also provide your own data file. Note that this port will install the utility with a 'g' prefix, e.g. gunits, but the texinfo documentation will refer to it without the 'g' prefix.

UNU.RAN (Universal Non-Uniform RAndom Number generator) is a collection of algorithms for generating non-uniform pseudorandom variates as a library of C functions designed and implemented by the ARVAG (Automatic Random VAriate Generation) project group in Vienna, and released under the GNU Public License (GPL). It is especially designed for situations where: - a non-standard distribution or a truncated distribution is needed; - experiments with different types of distributions are made; - random variates for variance reduction techniques are used; or - fast generators of predictable quality are necessary. UNU.RAN provides generators that are superior in many aspects to those found in quite a number of other libraries; however, due to its more sophisticated programming interface, it might not be as easy to use. It uses an object-oriented interface in which distributions and generators are treated as independent objects, so that different methods for generating non-uniform random variates may be chosen according to various criteria, such as speed, quality, and variance reduction. It is flexible enough to permit sampling from non-standard distributions, such as distributions that arise in a model and can only be computed in complicated subroutines.