Taucs

Taucs 2.2+, svn revision 3

A C library of solvers from sparse library algebra, by Sivan Toledo, with Doron Chen and Vladimir Rotkin.
Available from http://www.tau.ac.il/~stoledo/taucs/ (main home page) and http://code.google.com/p/taucs (code repository).

The Enlighten precompute use a modified version of source control revision 3 of Taucs from their google code repository. The source control revision is a significant improvement over the last official version of 2.2. http://code.google.com/p/taucs/updates/list

It has been modified from the source control version, primarily to remove a (new since 2.2) dependency on "pfunc.h" and other external libraries, and fix a few minor compilation issue to allow the code to build in our build system.

Taucs may be licensed under LGPL, or the license below. We use this license:

TAUCS License
Your use or distribution of TAUCS or any derivative code implies that you agree to
this License OR to the GNU LGPL.

THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY
EXPRESSED OR IMPLIED. ANY USE IS AT YOUR OWN RISK.

Permission is hereby granted to use or copy this program, provided that the Copyright, this License, and the Availability of the original version is retained on all copies. User documentation of any code that uses this code or any derivative code must cite the Copyright, this License, the Availability note, and "Used by permission." If this code or any derivative code is accessible from within MATLBA, then typing "help taucs" must
cite the Copyright, and "type taucs" must also cite this License and the Availability note. Permission to modify the code and to distribute modified code is granted, provided the Copyright, this License, and the Availability note are retained, and a notice that the code was modified is included. This software is provided to you free of charge.

Availability
As of version 2.1, we distribute the code in 4 formats: zip and tarred-gzipped (tgz), with or without binaries for external libraries. The bundled external libraries should allow you to build the test programs on Linux, Windows, and MacOS X without installing additional software. We recommend that you download the full distributions, and then perhaps replace the bundled libraries by higher performance ones (e.g., with a BLAS library that is specifically optimized for your machine). If you want to conserve bandwidth and you want to install the required libraries yourself, download the lean distributions. The zip and tgz files are identical, except that on Linux, Unix, and MacOS, unpacking the tgz file ensures that the configure script is marked as executable (unpack with tar zxvpf), otherwise you will have to change its permissions manually.

COLAMD

An external library included with Taucs, with separate license:


   COLAMD:  An approximate minimum degree column ordering algorithm.

    Purpose:

                Colamd computes a permutation Q such that the Cholesky factorization of
                (AQ)'(AQ) has less fill-in and requires fewer floating point operations
                than A'A.  This also provides a good ordering for sparse partial
                pivoting methods, P(AQ) = LU, where Q is computed prior to numerical
                factorization, and P is computed during numerical factorization via
                conventional partial pivoting with row interchanges.  Colamd is the
                column ordering method used in SuperLU, part of the ScaLAPACK library.
                It is also available as user-contributed software for Matlab 5.2,
                available from MathWorks, Inc. (http://www.mathworks.com).  This
                routine can be used in place of COLMMD in Matlab.  By default, the \
                and / operators in Matlab perform a column ordering (using COLMMD)
                prior to LU factorization using sparse partial pivoting, in the
                built-in Matlab LU(A) routine.

    Authors:

                The authors of the code itself are Stefan I. Larimore and Timothy A.
                Davis (davis@cise.ufl.edu), University of Florida.  The algorithm was
                developed in collaboration with John Gilbert, Xerox PARC, and Esmond
                Ng, Oak Ridge National Laboratory.

    Date:

                August 3, 1998.  Version 1.0.

    Acknowledgements:

                This work was supported by the National Science Foundation, under
                grants DMS-9504974 and DMS-9803599.

    Notice:

                Copyright (c) 1998 by the University of Florida.  All Rights Reserved.

                THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY
                EXPRESSED OR IMPLIED.  ANY USE IS AT YOUR OWN RISK.

                Permission is hereby granted to use or copy this program for any
                purpose, provided the above notices are retained on all copies.
                User documentation of any code that uses this code must cite the
                Authors, the Copyright, and "Used by permission."  If this code is
                accessible from within Matlab, then typing "help colamd" or "colamd"
                (with no arguments) must cite the Authors.  Permission to modify the
                code and to distribute modified code is granted, provided the above
                notices are retained, and a notice that the code was modified is
                included with the above copyright notice.  You must also retain the
                Availability information below, of the original version.

                This software is provided free of charge.

    Availability:

                This file is located at

                                http://www.cise.ufl.edu/~davis/colamd/colamd.c

                The colamd.h file is required, located in the same directory.
                The colamdmex.c file provides a Matlab interface for colamd.
                The symamdmex.c file provides a Matlab interface for symamd, which is
                a symmetric ordering based on this code, colamd.c.  All codes are
                purely ANSI C compliant (they use no Unix-specific routines, include
                files, etc.).