The ARPACK included in MathKeisan is based on the original version written by Rich Lehoucq, Kristi Maschhoff, Danny Sorensen and Chao Yang (Rice University).
Following are the ARPACK Copyright Notice, the ARPACK List of Conditions, and the ARPACK Disclaimer:
Copyright © 2001, Rice University Developed by D.C. Sorensen, R.B. Lehoucq, C. Yang, and K. Maschhoff. All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
THIS SOFTWARE IS PROVIDED BY RICE AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL RICE OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
The PARPACK included in MathKeisan is based on the original version written by Rich Lehoucq, Kristi Maschhoff, Danny Sorensen and Chao Yang (Rice University).
The BLACS included in MathKeisan is based on the original version 1.1 with patch03 written by J.J. Dongarra, and R.C. Whaley (University of Tennessee, Knoxville).
The BLAS and PARBLAS in MathKeisan are based on the original version of BLAS which was developed by J.J. Dongarra (Argonne National Lab.), J. Du Croz (Numerical Algorithms Group Ltd.), I. S. Duff (AERE Harwell), S. Hammarling (Numerical Algorithms Group Ltd.), R. J. Hanson (Sandia National Lab.), D. Kincaid (University of Texas), F.T. Krogh, C.L. Lawson (Jet Propulsion Lab.).
The CBLAS in MathKeisan is based on the BLAS Technical Forum reference implementation by K. Teranishi (University of Tennessee) with updates by J. Horner (University of Tennessee). The specification was authored by R. Whaley (University of Tennessee).
The LAPACK in MathKeisan is based on the original version of LAPACK, version 3.0 + UPDATES, which was developed by the LAPACK project team composed of E. Anderson (University of Tennessee, Knoxville), Z. Bai (University of Kentucky and University of California, Davis), C. Bischof (Institute for Scientific Computing, Technical University Aachen, Germany), S. Blackford (University of Tennessee, Knoxville), J. Demmel (University of California, Berkeley), J. Dongarra (University of Tennessee, Knoxville, and Oak Ridge National Lab.), J. Du Croz (Numerical Algorithms Group Ltd.), A. Greenbaum (University of Washington), S. Hammarling (Numerical Algorithms Group Ltd.), A. McKenney, D. Sorensen (Rice University).
The METIS in MathKeisan is based on the original version 4.0 developed at University of Minnesota and Army HPC research center by George Karypis and Vipin Kumar. The METIS Copyright notice is below:
---------------------------------------------------------------- This software package includes/uses METIS, developed by George Karypis and Vipin Kumar at the University of Minnesota. Additional information about METIS can be found at http://www.cs.umn.edu/~karypis/metis METIS is © 1997 Regents of the University of Minnesota. Twin Cities. All Rights Reserved. ----------------------------------------------------------------
The ParMETIS in MathKeisan is based on the original version 3.1 developed at University of Minnesota and Army HPC research center by George Karypis and Vipin Kumar.
The ScaLAPACK included in MathKeisan is based on the original version 1.8.0 written by L. S. Blackford (University of Tennessee, Knoxville), J. Choi (Soongsil University, Korea), A. Cleary (Lawrence Livermore National Lab.), E. D'Azevedo (Oak Ridge National Lab.), J. Demmel (University of California, Berkeley), I. Dhillon (University of California, Berkeley), J. Dongarra (University of Tennessee, Knoxville, and Oak Ridge National Lab.), P. Du (University of Tennessee, Knoxville), S. Hammarling (Numerical Algorithms Group Ltd.), G. Henry (Intel Corporation), J. Langou (University of Tennessee, Knoxville), J Langou (University of Colorado, Denver), P. Luszczek (University of Tennessee, Knoxville), O. Marques (Lawrence Berkeley National Lab.) A. Petitet (University of Tennessee, Knoxville), K. Stanley (University of California, Berkeley), D. Walker (University of Wales, Cardiff), R. C. Whaley (University of Tennessee, Knoxville).
The algorithm used in the solver is similar to that described by J. W. Liu, E. Ng, and B. Peyton, "On finding supernodes for sparse matrix computations." SIAM J. Matrix Anal. Apply., 14:242-252, 1993.
The Sparse BLAS in MathKeisan is based on the ACM Algorithm 692 by David S. Dodson (Convex Computer Corp.), and Roger G. Grimes and John G. Lewis (Boeing).