Description CSparseJ is a Java port of CSparse (a Concise Sparse matrix package). CSparse is a small yet featurerich sparse matrix package written specifically for the book "Direct Methods for Sparse Linear Systems" by Tim Davis. The algorithms contained in CSparse have been chosen with five goals in mind:
All classes of CSparseJ are implemented in both single and double precision. Benchmark CSparseJ 1.0 was benchmarked against CSparse 2.2.3. The timings in the table below are an average among 10 calls of each routine. They do not incorporate the "warm up phase" (first two calls require more time) for Java code. Testbed:
Average execution time (in seconds) for solving a system of linear equations using LU and QR factorization with natural ordering. License CSparse: a Concise Sparse matrix package. Copyright (c) 2006, Timothy A. Davis. http://www.cise.ufl.edu/research/sparse/CSparse  CSparseJ is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. CSparseJ is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this Module; if not, write to the Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 021101301 USA Download The source code distribution, besides Ant build file, contains also Eclipse project files. version 1.0 (June 13, 2009) Changelog binary:
doc:
source:

Software >