diff --git a/AMD/Demo/amd_demo.out b/AMD/Demo/amd_demo.out index bec418af85..9592d51aae 100644 --- a/AMD/Demo/amd_demo.out +++ b/AMD/Demo/amd_demo.out @@ -1,7 +1,7 @@ -AMD version 2.2, date: Nov 30, 2009 +AMD version 2.2, date: Jan 25, 2011 AMD demo, with the 24-by-24 Harwell/Boeing matrix, can_24: -AMD version 2.2.1, Nov 30, 2009: approximate minimum degree ordering +AMD version 2.2.2, Jan 25, 2011: approximate minimum degree ordering dense row parameter: 10 (rows with more than max (10 * sqrt (n), 16) entries are considered "dense", and placed last in output permutation) @@ -115,7 +115,7 @@ Plot of input matrix pattern: 23: . . . . . . X . . . . X X . . . . . . . . . . X return value from amd_order: 0 (should be 0) -AMD version 2.2.1, Nov 30, 2009, results: +AMD version 2.2.2, Jan 25, 2011, results: status: OK n, dimension of A: 24 nz, number of nonzeros in A: 160 diff --git a/AMD/Demo/amd_demo2.out b/AMD/Demo/amd_demo2.out index 8429589967..387a8bfa77 100644 --- a/AMD/Demo/amd_demo2.out +++ b/AMD/Demo/amd_demo2.out @@ -1,7 +1,7 @@ AMD demo, with a jumbled version of the 24-by-24 Harwell/Boeing matrix, can_24: -AMD version 2.2.1, Nov 30, 2009: approximate minimum degree ordering +AMD version 2.2.2, Jan 25, 2011: approximate minimum degree ordering dense row parameter: 10 (rows with more than max (10 * sqrt (n), 16) entries are considered "dense", and placed last in output permutation) @@ -144,7 +144,7 @@ Plot of symmetric matrix to be ordered by amd_order: 23: . . . . . . X . . . . X X . . . . . . . . . . X return value from amd_order: 1 (should be 1) -AMD version 2.2.1, Nov 30, 2009, results: +AMD version 2.2.2, Jan 25, 2011, results: status: OK, but jumbled n, dimension of A: 24 nz, number of nonzeros in A: 102 diff --git a/AMD/Demo/amd_l_demo.out b/AMD/Demo/amd_l_demo.out index 2d77186f7b..bd6d04cf10 100644 --- a/AMD/Demo/amd_l_demo.out +++ b/AMD/Demo/amd_l_demo.out @@ -1,7 +1,7 @@ -AMD version 2.2, date: Nov 30, 2009 +AMD version 2.2, date: Jan 25, 2011 AMD demo, with the 24-by-24 Harwell/Boeing matrix, can_24: -AMD version 2.2.1, Nov 30, 2009: approximate minimum degree ordering +AMD version 2.2.2, Jan 25, 2011: approximate minimum degree ordering dense row parameter: 10 (rows with more than max (10 * sqrt (n), 16) entries are considered "dense", and placed last in output permutation) @@ -115,7 +115,7 @@ Plot of input matrix pattern: 23: . . . . . . X . . . . X X . . . . . . . . . . X return value from amd_l_order: 0 (should be 0) -AMD version 2.2.1, Nov 30, 2009, results: +AMD version 2.2.2, Jan 25, 2011, results: status: OK n, dimension of A: 24 nz, number of nonzeros in A: 160 diff --git a/AMD/Doc/ChangeLog b/AMD/Doc/ChangeLog index c5f4dac247..4a9468822c 100644 --- a/AMD/Doc/ChangeLog +++ b/AMD/Doc/ChangeLog @@ -1,3 +1,7 @@ +Jan 25, 2011: version 2.2.2 + + * minor fix to "make install" + Nov 30, 2009: version 2.2.1 * added "make install" and "make uninstall" diff --git a/AMD/Include/amd.h b/AMD/Include/amd.h index 606e91d6ee..82835f56dd 100644 --- a/AMD/Include/amd.h +++ b/AMD/Include/amd.h @@ -398,11 +398,11 @@ void amd_l_info (double Info [ ]) ; * Versions 1.1 and earlier of AMD do not include a #define'd version number. */ -#define AMD_DATE "Nov 30, 2009" +#define AMD_DATE "Jan 25, 2011" #define AMD_VERSION_CODE(main,sub) ((main) * 1000 + (sub)) #define AMD_MAIN_VERSION 2 #define AMD_SUB_VERSION 2 -#define AMD_SUBSUB_VERSION 1 +#define AMD_SUBSUB_VERSION 2 #define AMD_VERSION AMD_VERSION_CODE(AMD_MAIN_VERSION,AMD_SUB_VERSION) #ifdef __cplusplus diff --git a/AMD/Makefile b/AMD/Makefile index 46685e0a91..aaffb390c6 100644 --- a/AMD/Makefile +++ b/AMD/Makefile @@ -2,7 +2,7 @@ # AMD Makefile (for GNU Make or original make) #------------------------------------------------------------------------------ -VERSION = 2.2.1 +VERSION = 2.2.2 default: demos @@ -71,7 +71,7 @@ mex: # install AMD install: $(CP) Lib/libamd.a $(INSTALL_LIB)/libamd.$(VERSION).a - ( cd $(INSTALL_LIB) ; ln -s libamd.$(VERSION).a libamd.a ) + ( cd $(INSTALL_LIB) ; ln -sf libamd.$(VERSION).a libamd.a ) $(CP) Include/amd.h $(INSTALL_INCLUDE) # uninstall AMD diff --git a/AMD/README.txt b/AMD/README.txt index 1f0507a2b8..63838270ca 100644 --- a/AMD/README.txt +++ b/AMD/README.txt @@ -1,4 +1,4 @@ -AMD Version 2.2.1, Copyright (c) 2009 by Timothy A. +AMD, Copyright (c) 2009-2011 by Timothy A. Davis, Patrick R. Amestoy, and Iain S. Duff. All Rights Reserved. AMD is available under alternate licences; contact T. Davis for details. diff --git a/BTF/Doc/ChangeLog b/BTF/Doc/ChangeLog index 0597911be7..2e6278f5d9 100644 --- a/BTF/Doc/ChangeLog +++ b/BTF/Doc/ChangeLog @@ -1,3 +1,7 @@ +Jan 25, 2011: version 1.1.2 + + * minor fix to "make install" + Nov 30, 2009: version 1.1.1 * added "make install" and "make uninstall" diff --git a/BTF/Include/btf.h b/BTF/Include/btf.h index 2eadaa5097..72717fdbd8 100644 --- a/BTF/Include/btf.h +++ b/BTF/Include/btf.h @@ -250,11 +250,11 @@ UF_long btf_l_order (UF_long, UF_long *, UF_long *, double , double *, * #endif */ -#define BTF_DATE "Nov 30, 2009" +#define BTF_DATE "Jan 25, 2011" #define BTF_VERSION_CODE(main,sub) ((main) * 1000 + (sub)) #define BTF_MAIN_VERSION 1 #define BTF_SUB_VERSION 1 -#define BTF_SUBSUB_VERSION 1 +#define BTF_SUBSUB_VERSION 2 #define BTF_VERSION BTF_VERSION_CODE(BTF_MAIN_VERSION,BTF_SUB_VERSION) #ifdef __cplusplus diff --git a/BTF/Makefile b/BTF/Makefile index 198790ca83..032e917a03 100644 --- a/BTF/Makefile +++ b/BTF/Makefile @@ -1,4 +1,4 @@ -VERSION = 1.1.1 +VERSION = 1.1.2 default: library @@ -22,7 +22,7 @@ purge: distclean # install BTF install: $(CP) Lib/libbtf.a $(INSTALL_LIB)/libbtf.$(VERSION).a - ( cd $(INSTALL_LIB) ; ln -s libbtf.$(VERSION).a libbtf.a ) + ( cd $(INSTALL_LIB) ; ln -sf libbtf.$(VERSION).a libbtf.a ) $(CP) Include/btf.h $(INSTALL_INCLUDE) # uninstall BTF diff --git a/BTF/README.txt b/BTF/README.txt index 9d10c55492..299dfdf63e 100644 --- a/BTF/README.txt +++ b/BTF/README.txt @@ -1,5 +1,4 @@ -BTF Version 1.0, May 31, 2007, by Timothy A. Davis -Copyright (C) 2004-2007, University of Florida +BTF, by Timothy A. Davis, Copyright (C) 2004-2011, University of Florida BTF is also available under other licenses; contact the author for details. http://www.cise.ufl.edu/research/sparse diff --git a/CAMD/Demo/camd_demo.out b/CAMD/Demo/camd_demo.out index 29b1e0f14c..5e35d089ca 100644 --- a/CAMD/Demo/camd_demo.out +++ b/CAMD/Demo/camd_demo.out @@ -1,7 +1,7 @@ -CAMD version 2.2, date: Nov 30, 2009 +CAMD version 2.2, date: Jan 25, 2011 CAMD demo, with the 24-by-24 Harwell/Boeing matrix, can_24: -camd version 2.2, Nov 30, 2009: approximate minimum degree ordering: +camd version 2.2, Jan 25, 2011: approximate minimum degree ordering: dense row parameter: 10 (rows with more than max (10 * sqrt (n), 16) entries are considered "dense", and placed last in output permutation) diff --git a/CAMD/Demo/camd_demo2.out b/CAMD/Demo/camd_demo2.out index 4be2c41a75..d51348a4f8 100644 --- a/CAMD/Demo/camd_demo2.out +++ b/CAMD/Demo/camd_demo2.out @@ -1,7 +1,7 @@ CAMD demo, with a jumbled version of the 24-by-24 Harwell/Boeing matrix, can_24: -camd version 2.2, Nov 30, 2009: approximate minimum degree ordering: +camd version 2.2, Jan 25, 2011: approximate minimum degree ordering: dense row parameter: 10 (rows with more than max (10 * sqrt (n), 16) entries are considered "dense", and placed last in output permutation) diff --git a/CAMD/Demo/camd_l_demo.out b/CAMD/Demo/camd_l_demo.out index 949fe6c32d..1c86ad31c7 100644 --- a/CAMD/Demo/camd_l_demo.out +++ b/CAMD/Demo/camd_l_demo.out @@ -1,7 +1,7 @@ -CAMD version 2.2, date: Nov 30, 2009 +CAMD version 2.2, date: Jan 25, 2011 CAMD demo, with the 24-by-24 Harwell/Boeing matrix, can_24: -camd version 2.2, Nov 30, 2009: approximate minimum degree ordering: +camd version 2.2, Jan 25, 2011: approximate minimum degree ordering: dense row parameter: 10 (rows with more than max (10 * sqrt (n), 16) entries are considered "dense", and placed last in output permutation) diff --git a/CAMD/Doc/ChangeLog b/CAMD/Doc/ChangeLog index 4f64115f74..eadfd8b446 100644 --- a/CAMD/Doc/ChangeLog +++ b/CAMD/Doc/ChangeLog @@ -1,3 +1,7 @@ +Jan 25, 2011: version 2.2.2 + + * minor fix to "make install" + Nov 30, 2009: version 2.2.1 * added "make install" and "make uninstall" diff --git a/CAMD/Include/camd.h b/CAMD/Include/camd.h index 14cb0d3fd9..86a54d1959 100644 --- a/CAMD/Include/camd.h +++ b/CAMD/Include/camd.h @@ -405,11 +405,11 @@ void camd_l_info (double Info [ ]) ; * #endif */ -#define CAMD_DATE "Nov 30, 2009" +#define CAMD_DATE "Jan 25, 2011" #define CAMD_VERSION_CODE(main,sub) ((main) * 1000 + (sub)) #define CAMD_MAIN_VERSION 2 #define CAMD_SUB_VERSION 2 -#define CAMD_SUBSUB_VERSION 1 +#define CAMD_SUBSUB_VERSION 2 #define CAMD_VERSION CAMD_VERSION_CODE(CAMD_MAIN_VERSION,CAMD_SUB_VERSION) #ifdef __cplusplus diff --git a/CAMD/Makefile b/CAMD/Makefile index 58919faddd..de215275c1 100644 --- a/CAMD/Makefile +++ b/CAMD/Makefile @@ -2,7 +2,7 @@ # CAMD Makefile (for GNU Make or original make) #------------------------------------------------------------------------------ -VERSION = 2.2.1 +VERSION = 2.2.2 default: demos @@ -61,7 +61,7 @@ mex: # install CAMD install: $(CP) Lib/libcamd.a $(INSTALL_LIB)/libcamd.$(VERSION).a - ( cd $(INSTALL_LIB) ; ln -s libcamd.$(VERSION).a libcamd.a ) + ( cd $(INSTALL_LIB) ; ln -sf libcamd.$(VERSION).a libcamd.a ) $(CP) Include/camd.h $(INSTALL_INCLUDE) # uninstall CAMD diff --git a/CAMD/README.txt b/CAMD/README.txt index 84702cc25b..1e58667552 100644 --- a/CAMD/README.txt +++ b/CAMD/README.txt @@ -1,4 +1,4 @@ -CAMD Version 2.2, Copyright (c) 2007 by Timothy A. Davis, Yanqing Chen, +CAMD, Copyright (c) 2007-2011 by Timothy A. Davis, Yanqing Chen, Patrick R. Amestoy, and Iain S. Duff. All Rights Reserved. CAMD is available under alternate licences; contact T. Davis for details. diff --git a/CCOLAMD/Demo/ccolamd_example.out b/CCOLAMD/Demo/ccolamd_example.out index 9ff43e9934..dd2dc49556 100644 --- a/CCOLAMD/Demo/ccolamd_example.out +++ b/CCOLAMD/Demo/ccolamd_example.out @@ -15,7 +15,7 @@ Column 3, with 2 entries: row 1 row 3 -ccolamd version 2.7, Nov 30, 2009: OK. +ccolamd version 2.7, Jan 25, 2011: OK. ccolamd: number of dense or empty rows ignored: 0 ccolamd: number of dense or empty columns ignored: 0 ccolamd: number of garbage collections performed: 0 @@ -38,7 +38,7 @@ Column 3, with 1 entries: row 4 Column 4, with 0 entries: -csymamd version 2.7, Nov 30, 2009: OK. +csymamd version 2.7, Jan 25, 2011: OK. csymamd: number of dense or empty rows ignored: 0 csymamd: number of dense or empty columns ignored: 0 csymamd: number of garbage collections performed: 0 diff --git a/CCOLAMD/Demo/ccolamd_l_example.out b/CCOLAMD/Demo/ccolamd_l_example.out index 5adacdd973..fc87f54745 100644 --- a/CCOLAMD/Demo/ccolamd_l_example.out +++ b/CCOLAMD/Demo/ccolamd_l_example.out @@ -15,7 +15,7 @@ Column 3, with 2 entries: row 1 row 3 -ccolamd version 2.7, Nov 30, 2009: OK. +ccolamd version 2.7, Jan 25, 2011: OK. ccolamd: number of dense or empty rows ignored: 0 ccolamd: number of dense or empty columns ignored: 0 ccolamd: number of garbage collections performed: 0 @@ -38,7 +38,7 @@ Column 3, with 1 entries: row 4 Column 4, with 0 entries: -csymamd version 2.7, Nov 30, 2009: OK. +csymamd version 2.7, Jan 25, 2011: OK. csymamd: number of dense or empty rows ignored: 0 csymamd: number of dense or empty columns ignored: 0 csymamd: number of garbage collections performed: 0 diff --git a/CCOLAMD/Doc/ChangeLog b/CCOLAMD/Doc/ChangeLog index fde7f0a0d5..499d2fc696 100644 --- a/CCOLAMD/Doc/ChangeLog +++ b/CCOLAMD/Doc/ChangeLog @@ -1,3 +1,8 @@ +Jan 25, 2011: version 2.7.3 + + * minor fix to "make install" + * fixed stats [CCOLAMD_EMPTY_ROW] output + Nov 30, 2009: version 2.7.2 * added "make install" and "make uninstall" diff --git a/CCOLAMD/Include/ccolamd.h b/CCOLAMD/Include/ccolamd.h index 11a098741d..c253ed522f 100644 --- a/CCOLAMD/Include/ccolamd.h +++ b/CCOLAMD/Include/ccolamd.h @@ -43,11 +43,11 @@ extern "C" { * #endif */ -#define CCOLAMD_DATE "Nov 30, 2009" +#define CCOLAMD_DATE "Jan 25, 2011" #define CCOLAMD_VERSION_CODE(main,sub) ((main) * 1000 + (sub)) #define CCOLAMD_MAIN_VERSION 2 #define CCOLAMD_SUB_VERSION 7 -#define CCOLAMD_SUBSUB_VERSION 2 +#define CCOLAMD_SUBSUB_VERSION 3 #define CCOLAMD_VERSION \ CCOLAMD_VERSION_CODE(CCOLAMD_MAIN_VERSION,CCOLAMD_SUB_VERSION) diff --git a/CCOLAMD/Makefile b/CCOLAMD/Makefile index 8c86b80842..7826950629 100644 --- a/CCOLAMD/Makefile +++ b/CCOLAMD/Makefile @@ -2,7 +2,7 @@ # CCOLAMD Makefile #------------------------------------------------------------------------------ -VERSION = 2.7.2 +VERSION = 2.7.3 default: demos @@ -53,7 +53,7 @@ mex: # install CCOLAMD install: $(CP) Lib/libccolamd.a $(INSTALL_LIB)/libccolamd.$(VERSION).a - ( cd $(INSTALL_LIB) ; ln -s libccolamd.$(VERSION).a libccolamd.a ) + ( cd $(INSTALL_LIB) ; ln -sf libccolamd.$(VERSION).a libccolamd.a ) $(CP) Include/ccolamd.h $(INSTALL_INCLUDE) # uninstall CCOLAMD diff --git a/CCOLAMD/README.txt b/CCOLAMD/README.txt index f919208176..ccc5a19a58 100644 --- a/CCOLAMD/README.txt +++ b/CCOLAMD/README.txt @@ -1,5 +1,5 @@ -CCOLAMD version 2.7: constrained column approximate minimum degree ordering -Copyright (C) 2005-2007, Univ. of Florida. Authors: Timothy A. Davis, +CCOLAMD: constrained column approximate minimum degree ordering +Copyright (C) 2005-2011, Univ. of Florida. Authors: Timothy A. Davis, Sivasankaran Rajamanickam, and Stefan Larimore. Closely based on COLAMD by Davis, Stefan Larimore, in collaboration with Esmond Ng, and John Gilbert. http://www.cise.ufl.edu/research/sparse diff --git a/CCOLAMD/Source/ccolamd.c b/CCOLAMD/Source/ccolamd.c index 924747126a..36ffa1ada8 100644 --- a/CCOLAMD/Source/ccolamd.c +++ b/CCOLAMD/Source/ccolamd.c @@ -1980,7 +1980,7 @@ PUBLIC Int CCOLAMD_2 /* returns TRUE if successful, FALSE otherwise */ /* === Return statistics in stats ======================================= */ stats [CCOLAMD_DENSE_ROW] = ndense_row ; - stats [CCOLAMD_DENSE_COL] = nempty_row ; + stats [CCOLAMD_EMPTY_ROW] = nempty_row ; /* fixed in 2.7.3 */ stats [CCOLAMD_NEWLY_EMPTY_ROW] = nnewlyempty_row ; stats [CCOLAMD_DENSE_COL] = ndense_col ; stats [CCOLAMD_EMPTY_COL] = nempty_col ; diff --git a/CHOLMOD/Core/cholmod_memory.c b/CHOLMOD/Core/cholmod_memory.c index 92f9f8ef97..3c7968bdcf 100644 --- a/CHOLMOD/Core/cholmod_memory.c +++ b/CHOLMOD/Core/cholmod_memory.c @@ -404,10 +404,10 @@ int CHOLMOD(realloc_multiple) int nint, /* number of int/UF_long blocks */ int xtype, /* CHOLMOD_PATTERN, _REAL, _COMPLEX, or _ZOMPLEX */ /* ---- in/out --- */ - void **I, /* int or UF_long block */ - void **J, /* int or UF_long block */ - void **X, /* complex or double block */ - void **Z, /* zomplex case only: double block */ + void **Iblock, /* int or UF_long block */ + void **Jblock, /* int or UF_long block */ + void **Xblock, /* complex or double block */ + void **Zblock, /* zomplex case only: double block */ size_t *nold_p, /* current size of the I,J,X,Z blocks on input, * nnew on output if successful */ /* --------------- */ @@ -440,26 +440,30 @@ int CHOLMOD(realloc_multiple) if (nint > 0) { - *I = CHOLMOD(realloc) (nnew, sizeof (Int), *I, &i, Common) ; + *Iblock = CHOLMOD(realloc) (nnew, sizeof (Int), *Iblock, &i, Common) ; } if (nint > 1) { - *J = CHOLMOD(realloc) (nnew, sizeof (Int), *J, &j, Common) ; + *Jblock = CHOLMOD(realloc) (nnew, sizeof (Int), *Jblock, &j, Common) ; } switch (xtype) { case CHOLMOD_REAL: - *X = CHOLMOD(realloc) (nnew, sizeof (double), *X, &x, Common) ; + *Xblock = CHOLMOD(realloc) (nnew, sizeof (double), *Xblock, &x, + Common) ; break ; case CHOLMOD_COMPLEX: - *X = CHOLMOD(realloc) (nnew, 2*sizeof (double), *X, &x, Common) ; + *Xblock = CHOLMOD(realloc) (nnew, 2*sizeof (double), *Xblock, &x, + Common) ; break ; case CHOLMOD_ZOMPLEX: - *X = CHOLMOD(realloc) (nnew, sizeof (double), *X, &x, Common) ; - *Z = CHOLMOD(realloc) (nnew, sizeof (double), *Z, &z, Common) ; + *Xblock = CHOLMOD(realloc) (nnew, sizeof (double), *Xblock, &x, + Common) ; + *Zblock = CHOLMOD(realloc) (nnew, sizeof (double), *Zblock, &z, + Common) ; break ; } @@ -472,26 +476,30 @@ int CHOLMOD(realloc_multiple) if (nint > 0) { - *I = CHOLMOD(free) (i, sizeof (Int), *I, Common) ; + *Iblock = CHOLMOD(free) (i, sizeof (Int), *Iblock, Common) ; } if (nint > 1) { - *J = CHOLMOD(free) (j, sizeof (Int), *J, Common) ; + *Jblock = CHOLMOD(free) (j, sizeof (Int), *Jblock, Common) ; } switch (xtype) { case CHOLMOD_REAL: - *X = CHOLMOD(free) (x, sizeof (double), *X, Common) ; + *Xblock = CHOLMOD(free) (x, sizeof (double), *Xblock, + Common) ; break ; case CHOLMOD_COMPLEX: - *X = CHOLMOD(free) (x, 2*sizeof (double), *X, Common) ; + *Xblock = CHOLMOD(free) (x, 2*sizeof (double), *Xblock, + Common) ; break ; case CHOLMOD_ZOMPLEX: - *X = CHOLMOD(free) (x, sizeof (double), *X, Common) ; - *Z = CHOLMOD(free) (x, sizeof (double), *Z, Common) ; + *Xblock = CHOLMOD(free) (x, sizeof (double), *Xblock, + Common) ; + *Zblock = CHOLMOD(free) (x, sizeof (double), *Zblock, + Common) ; break ; } @@ -500,30 +508,32 @@ int CHOLMOD(realloc_multiple) { if (nint > 0) { - *I = CHOLMOD(realloc) (nold, sizeof (Int), *I, &i, Common) ; + *Iblock = CHOLMOD(realloc) (nold, sizeof (Int), *Iblock, &i, + Common) ; } if (nint > 1) { - *J = CHOLMOD(realloc) (nold, sizeof (Int), *J, &j, Common) ; + *Jblock = CHOLMOD(realloc) (nold, sizeof (Int), *Jblock, &j, + Common) ; } switch (xtype) { case CHOLMOD_REAL: - *X = CHOLMOD(realloc) (nold, sizeof (double), *X, &x, - Common) ; + *Xblock = CHOLMOD(realloc) (nold, sizeof (double), + *Xblock, &x, Common) ; break ; case CHOLMOD_COMPLEX: - *X = CHOLMOD(realloc) (nold, 2*sizeof (double), *X, &x, - Common) ; + *Xblock = CHOLMOD(realloc) (nold, 2*sizeof (double), + *Xblock, &x, Common) ; break ; case CHOLMOD_ZOMPLEX: - *X = CHOLMOD(realloc) (nold, sizeof (double), *X, &x, - Common) ; - *Z = CHOLMOD(realloc) (nold, sizeof (double), *Z, &z, - Common) ; + *Xblock = CHOLMOD(realloc) (nold, sizeof (double), + *Xblock, &x, Common) ; + *Zblock = CHOLMOD(realloc) (nold, sizeof (double), + *Zblock, &z, Common) ; break ; } @@ -537,8 +547,8 @@ int CHOLMOD(realloc_multiple) /* New space was allocated. Clear the first entry so that valgrind * doesn't complain about its access in change_complexity * (Core/cholmod_complex.c). */ - xx = *X ; - zz = *Z ; + xx = *Xblock ; + zz = *Zblock ; switch (xtype) { case CHOLMOD_REAL: diff --git a/CHOLMOD/Doc/ChangeLog b/CHOLMOD/Doc/ChangeLog index 18fb7dc2c2..732fdc26e3 100644 --- a/CHOLMOD/Doc/ChangeLog +++ b/CHOLMOD/Doc/ChangeLog @@ -1,3 +1,9 @@ +Jan 25, 2011: version 1.7.3 + + * minor fix to "make install" + * minor change to Core/cholmod_memory.c, rename "I" which conflicts with + a predefined token in some compilers + Nov 30, 2009: version 1.7.2 * added "make install" and "make uninstall" diff --git a/CHOLMOD/Doc/UserGuide.pdf b/CHOLMOD/Doc/UserGuide.pdf index 6946056013..2d4b02e40f 100644 Binary files a/CHOLMOD/Doc/UserGuide.pdf and b/CHOLMOD/Doc/UserGuide.pdf differ diff --git a/CHOLMOD/Doc/UserGuide.tex b/CHOLMOD/Doc/UserGuide.tex index 47e605aa49..171508b9d4 100644 --- a/CHOLMOD/Doc/UserGuide.tex +++ b/CHOLMOD/Doc/UserGuide.tex @@ -21,7 +21,8 @@ Univ. of Florida, Gainesville, FL} \title{User Guide for CHOLMOD: a sparse Cholesky factorization and modification package} -\date{Version 1.7.2, Nov 30, 2009} + +\date{VERSION 1.7.3, Jan 25, 2011} \maketitle %------------------------------------------------------------------------------- @@ -47,7 +48,7 @@ \end{abstract} %------------------------------------------------------------------------------- -CHOLMOD Copyright\copyright 2005-2009 by Timothy A. Davis. Portions are also +CHOLMOD Copyright\copyright 2005-2011 by Timothy A. Davis. Portions are also copyrighted by William W. Hager (the {\tt Modify} Module), and the University of Florida (the {\tt Partition} and {\tt Core} Modules). All Rights Reserved. Some of CHOLMOD's Modules are distributed under the GNU diff --git a/CHOLMOD/Include/cholmod_core.h b/CHOLMOD/Include/cholmod_core.h index 1637b8267e..9a32e319a0 100644 --- a/CHOLMOD/Include/cholmod_core.h +++ b/CHOLMOD/Include/cholmod_core.h @@ -244,11 +244,11 @@ * #endif */ -#define CHOLMOD_DATE "Nov 30, 2009" +#define CHOLMOD_DATE "Jan 25, 2011" #define CHOLMOD_VER_CODE(main,sub) ((main) * 1000 + (sub)) #define CHOLMOD_MAIN_VERSION 1 #define CHOLMOD_SUB_VERSION 7 -#define CHOLMOD_SUBSUB_VERSION 2 +#define CHOLMOD_SUBSUB_VERSION 3 #define CHOLMOD_VERSION \ CHOLMOD_VER_CODE(CHOLMOD_MAIN_VERSION,CHOLMOD_SUB_VERSION) @@ -2201,10 +2201,10 @@ int cholmod_realloc_multiple int nint, /* number of int/UF_long blocks */ int xtype, /* CHOLMOD_PATTERN, _REAL, _COMPLEX, or _ZOMPLEX */ /* ---- in/out --- */ - void **I, /* int or UF_long block */ - void **J, /* int or UF_long block */ - void **X, /* complex, double, or float block */ - void **Z, /* zomplex case only: double or float block */ + void **Iblock, /* int or UF_long block */ + void **Jblock, /* int or UF_long block */ + void **Xblock, /* complex, double, or float block */ + void **Zblock, /* zomplex case only: double or float block */ size_t *n, /* current size of the I,J,X,Z blocks on input, * nnew on output if successful */ /* --------------- */ diff --git a/CHOLMOD/Makefile b/CHOLMOD/Makefile index f2a8e78879..7244e1f3f9 100644 --- a/CHOLMOD/Makefile +++ b/CHOLMOD/Makefile @@ -2,7 +2,7 @@ # CHOLMOD Makefile #------------------------------------------------------------------------------- -VERSION = 1.7.2 +VERSION = 1.7.3 # Note: If you do not have METIS, or do not wish to use it in CHOLMOD, you must # compile CHOLMOD with the -DNPARTITION flag. See ../UFconfig/UFconfig.mk. @@ -63,7 +63,7 @@ demos: # install CHOLMOD install: $(CP) Lib/libcholmod.a $(INSTALL_LIB)/libcholmod.$(VERSION).a - ( cd $(INSTALL_LIB) ; ln -s libcholmod.$(VERSION).a libcholmod.a ) + ( cd $(INSTALL_LIB) ; ln -sf libcholmod.$(VERSION).a libcholmod.a ) $(CP) Include/cholmod*.h $(INSTALL_INCLUDE) $(RM) $(INSTALL_INCLUDE)/cholmod_internal.h diff --git a/CHOLMOD/README.txt b/CHOLMOD/README.txt index 84fb2bd3af..861d533434 100644 --- a/CHOLMOD/README.txt +++ b/CHOLMOD/README.txt @@ -1,5 +1,4 @@ -CHOLMOD: a sparse CHOLesky MODification package -Version 1.7.1, March 24, 2009. Copyright (c) 2005-2009. +CHOLMOD: a sparse CHOLesky MODification package, Copyright (c) 2005-2011. ----------------------------------------------- CHOLMOD is a set of routines for factorizing sparse symmetric positive diff --git a/CHOLMOD/Tcov/cm.c b/CHOLMOD/Tcov/cm.c index ce69997041..e8827ce279 100644 --- a/CHOLMOD/Tcov/cm.c +++ b/CHOLMOD/Tcov/cm.c @@ -1438,8 +1438,11 @@ int main (int argc, char **argv) if (T->nrow > 1000000) { - /* do huge-problem tests only */ - huge ( ) ; + /* do huge-problem tests only, but only for 32-bit systems */ + if (sizeof (Int) == sizeof (int)) + { + huge ( ) ; + } CHOLMOD(free_triplet) (&T, cm) ; continue ; } diff --git a/CHOLMOD/Tcov/tmp/.gitkeep b/CHOLMOD/Tcov/tmp/.gitkeep deleted file mode 100644 index e69de29bb2..0000000000 diff --git a/CHOLMOD/Valgrind/tmp/.gitkeep b/CHOLMOD/Valgrind/tmp/.gitkeep deleted file mode 100644 index e69de29bb2..0000000000 diff --git a/COLAMD/Demo/colamd_example.out b/COLAMD/Demo/colamd_example.out index 3e6eb4decf..239996faa2 100644 --- a/COLAMD/Demo/colamd_example.out +++ b/COLAMD/Demo/colamd_example.out @@ -15,7 +15,7 @@ Column 3, with 2 entries: row 1 row 3 -colamd version 2.7, Nov 30, 2009: OK. +colamd version 2.7, Jan 25, 2011: OK. colamd: number of dense or empty rows ignored: 0 colamd: number of dense or empty columns ignored: 0 colamd: number of garbage collections performed: 0 @@ -38,7 +38,7 @@ Column 3, with 1 entries: row 4 Column 4, with 0 entries: -symamd version 2.7, Nov 30, 2009: OK. +symamd version 2.7, Jan 25, 2011: OK. symamd: number of dense or empty rows ignored: 0 symamd: number of dense or empty columns ignored: 0 symamd: number of garbage collections performed: 0 diff --git a/COLAMD/Demo/colamd_l_example.out b/COLAMD/Demo/colamd_l_example.out index 60dfad00da..838b5826e8 100644 --- a/COLAMD/Demo/colamd_l_example.out +++ b/COLAMD/Demo/colamd_l_example.out @@ -15,7 +15,7 @@ Column 3, with 2 entries: row 1 row 3 -colamd version 2.7, Nov 30, 2009: OK. +colamd version 2.7, Jan 25, 2011: OK. colamd: number of dense or empty rows ignored: 0 colamd: number of dense or empty columns ignored: 0 colamd: number of garbage collections performed: 0 @@ -38,7 +38,7 @@ Column 3, with 1 entries: row 4 Column 4, with 0 entries: -symamd version 2.7, Nov 30, 2009: OK. +symamd version 2.7, Jan 25, 2011: OK. symamd: number of dense or empty rows ignored: 0 symamd: number of dense or empty columns ignored: 0 symamd: number of garbage collections performed: 0 diff --git a/COLAMD/Doc/ChangeLog b/COLAMD/Doc/ChangeLog index 9901eff093..03f7f69822 100644 --- a/COLAMD/Doc/ChangeLog +++ b/COLAMD/Doc/ChangeLog @@ -1,3 +1,7 @@ +Jan 25, 2011: version 2.7.3 + + * minor fix to "make install" + Nov 30, 2009: version 2.7.2 * added "make install" and "make uninstall" diff --git a/COLAMD/Include/colamd.h b/COLAMD/Include/colamd.h index b5d8daba6f..47e2582b6c 100644 --- a/COLAMD/Include/colamd.h +++ b/COLAMD/Include/colamd.h @@ -81,11 +81,11 @@ extern "C" { * Versions 2.3 and earlier of COLAMD do not include a #define'd version number. */ -#define COLAMD_DATE "Nov 30, 2009" +#define COLAMD_DATE "Jan 25, 2011" #define COLAMD_VERSION_CODE(main,sub) ((main) * 1000 + (sub)) #define COLAMD_MAIN_VERSION 2 #define COLAMD_SUB_VERSION 7 -#define COLAMD_SUBSUB_VERSION 2 +#define COLAMD_SUBSUB_VERSION 3 #define COLAMD_VERSION \ COLAMD_VERSION_CODE(COLAMD_MAIN_VERSION,COLAMD_SUB_VERSION) diff --git a/COLAMD/Makefile b/COLAMD/Makefile index 69b787b39c..5c6faf2bbd 100644 --- a/COLAMD/Makefile +++ b/COLAMD/Makefile @@ -2,7 +2,7 @@ # COLAMD Makefile #------------------------------------------------------------------------------ -VERSION = 2.7.2 +VERSION = 2.7.3 default: demos @@ -53,7 +53,7 @@ mex: # install COLAMD install: $(CP) Lib/libcolamd.a $(INSTALL_LIB)/libcolamd.$(VERSION).a - ( cd $(INSTALL_LIB) ; ln -s libcolamd.$(VERSION).a libcolamd.a ) + ( cd $(INSTALL_LIB) ; ln -sf libcolamd.$(VERSION).a libcolamd.a ) $(CP) Include/colamd.h $(INSTALL_INCLUDE) # uninstall COLAMD diff --git a/COLAMD/README.txt b/COLAMD/README.txt index 5ed81c71d0..47da68ea08 100644 --- a/COLAMD/README.txt +++ b/COLAMD/README.txt @@ -1,4 +1,4 @@ -The COLAMD ordering method - Version 2.7 +The COLAMD ordering method, Copyright 1998-2011, Timothy A. Davis. ------------------------------------------------------------------------------- The COLAMD column approximate minimum degree ordering algorithm computes @@ -44,8 +44,6 @@ colamd from a C program. Requires UFconfig, in the ../UFconfig directory relative to this directory. - Copyright (c) 1998-2007, Timothy A. Davis, All Rights Reserved. - See http://www.cise.ufl.edu/research/sparse/colamd (the colamd.c file) for the License. diff --git a/CSparse/Demo/cs_demo.out b/CSparse/Demo/cs_demo.out index 6e2a56097a..7a188f7dd9 100644 --- a/CSparse/Demo/cs_demo.out +++ b/CSparse/Demo/cs_demo.out @@ -1,5 +1,7 @@ ( cd ../Lib ; make ) +make[1]: Entering directory `/cise/research/sparse2/SuiteSparse/CSparse/Lib' make[1]: Nothing to be done for `all'. +make[1]: Leaving directory `/cise/research/sparse2/SuiteSparse/CSparse/Lib' cc -O -I../Include -o cs_demo1 cs_demo1.c ../Lib/libcsparse.a -lm cc -O -I../Include -o cs_demo2 cs_demo2.c cs_demo.c ../Lib/libcsparse.a -lm cc -O -I../Include -o cs_demo3 cs_demo3.c cs_demo.c ../Lib/libcsparse.a -lm @@ -110,7 +112,7 @@ tiny entries dropped: 10 blocks: 38 singletons: 37 structural rank: 183 QR natural time: 0.01 resid: 6.84e-28 QR amd(A'*A) time: 0.00 resid: 9.38e-28 -LU natural time: 0.00 resid: 6.20e-28 +LU natural time: 0.01 resid: 6.20e-28 LU amd(A+A') time: 0.00 resid: 1.55e-27 LU amd(S'*S) time: 0.00 resid: 6.98e-28 LU amd(A'*A) time: 0.00 resid: 6.98e-28 @@ -118,8 +120,8 @@ LU amd(A'*A) time: 0.00 resid: 6.98e-28 --- Matrix: 492-by-490, nnz: 49920 (sym: 0: nnz 0), norm: 9.29e-01 blocks: 10 singletons: 8 structural rank: 448 -QR natural time: 0.11 resid: nan -QR amd(A'*A) time: 0.15 resid: nan +QR natural time: 0.13 resid: nan +QR amd(A'*A) time: 0.18 resid: nan ./cs_demo2 < ../Matrix/west0067 --- Matrix: 67-by-67, nnz: 294 (sym: 0: nnz 0), norm: 6.14e+00 @@ -140,11 +142,11 @@ QR amd(A'*A) time: 0.00 resid: 2.25e-16 --- Matrix: 4884-by-4884, nnz: 147631 (sym: -1: nnz 290378), norm: 7.01e+09 blocks: 75 singletons: 74 structural rank: 4884 -QR amd(A'*A) time: 1.35 resid: 1.39e-22 -LU amd(A+A') time: 0.82 resid: 1.10e-22 -LU amd(S'*S) time: 0.85 resid: 1.28e-22 -LU amd(A'*A) time: 0.88 resid: 1.78e-22 -Chol amd(A+A') time: 0.25 resid: 1.19e-22 +QR amd(A'*A) time: 1.80 resid: 1.39e-22 +LU amd(A+A') time: 1.02 resid: 1.10e-22 +LU amd(S'*S) time: 1.00 resid: 1.28e-22 +LU amd(A'*A) time: 1.04 resid: 1.78e-22 +Chol amd(A+A') time: 0.35 resid: 1.19e-22 ./cs_demo3 < ../Matrix/bcsstk01 --- Matrix: 48-by-48, nnz: 224 (sym: -1: nnz 400), norm: 3.57e+09 @@ -155,21 +157,21 @@ numeric chol time 0.00 solve chol time 0.00 original: resid: 2.55e-19 update: time: 0.00 -update: time: 0.00 (incl solve) resid: 3.52e-18 -rechol: time: 0.00 (incl solve) resid: 2.93e-18 +update: time: 0.00 (incl solve) resid: 9.66e-19 +rechol: time: 0.00 (incl solve) resid: 1.55e-18 downdate: time: 0.00 -downdate: time: 0.00 (incl solve) resid: 4.32e-17 +downdate: time: 0.00 (incl solve) resid: 3.74e-17 ./cs_demo3 < ../Matrix/bcsstk16 --- Matrix: 4884-by-4884, nnz: 147631 (sym: -1: nnz 290378), norm: 7.01e+09 chol then update/downdate amd(A+A') symbolic chol time 0.02 -numeric chol time 0.22 +numeric chol time 0.33 solve chol time 0.01 original: resid: 1.19e-22 update: time: 0.00 -update: time: 0.01 (incl solve) resid: 1.71e-23 -rechol: time: 0.22 (incl solve) resid: 1.61e-23 +update: time: 0.01 (incl solve) resid: 1.12e-23 +rechol: time: 0.34 (incl solve) resid: 1.17e-23 downdate: time: 0.00 -downdate: time: 0.01 (incl solve) resid: 1.24e-21 +downdate: time: 0.01 (incl solve) resid: 4.09e-22 diff --git a/CSparse/Doc/ChangeLog b/CSparse/Doc/ChangeLog index 0a7891bf74..29491885a7 100644 --- a/CSparse/Doc/ChangeLog +++ b/CSparse/Doc/ChangeLog @@ -1,6 +1,12 @@ +Jan 25, 2011: version 2.2.5 + + * minor fix to "make install" + * minor change to cs_util.c, typecast return (cs_free (...)) + * minor fixes to UFget: help file, UFsettings.txt + Nov 30, 2009: version 2.2.4 - * added "make install" and "make uninstall" + * added "make install" and "make uninstall" to CXSparse * minor change to cs_make.m Jan 20, 2009, v2.2.3 diff --git a/CSparse/MATLAB/UFget/UFget_defaults.m b/CSparse/MATLAB/UFget/UFget_defaults.m index 00924c1b9a..a907e94bd8 100644 --- a/CSparse/MATLAB/UFget/UFget_defaults.m +++ b/CSparse/MATLAB/UFget/UFget_defaults.m @@ -31,7 +31,7 @@ f = -1 ; try - f = fopen (sprintf ('%sUFsettings.txt', s), 'r') ; + f = fopen (sprintf ('%sUFsettings.txt', this), 'r') ; if (f >= 0) % get the location of the mat directory s = fgetl (f) ; diff --git a/CSparse/MATLAB/UFget/UFgui.jar b/CSparse/MATLAB/UFget/UFgui.jar index 51c14e28c5..756923a64d 100644 Binary files a/CSparse/MATLAB/UFget/UFgui.jar and b/CSparse/MATLAB/UFget/UFgui.jar differ diff --git a/CSparse/MATLAB/UFget/UFgui.java b/CSparse/MATLAB/UFget/UFgui.java index 2f4f635e2b..d4f1136bd8 100644 --- a/CSparse/MATLAB/UFget/UFgui.java +++ b/CSparse/MATLAB/UFget/UFgui.java @@ -645,7 +645,7 @@ public void actionPerformed (ActionEvent e) real_group.add (real_either_Button) ; real_yes_Button.setToolTipText - ("Select 'real' for real matrices only.") ; + ("Select 'real' for real matrices only (includes integer and binary).") ; real_no_Button.setToolTipText ("Select 'complex' for complex matrices only.") ; real_either_Button.setToolTipText @@ -1172,7 +1172,7 @@ else if (k == 0) "# of rows in the matrix", // 7:nrows "# of columns in the matrix", // 8:ncols "# of nonzeros in the matrix", // 9:nnz - "if the matrix is real", // 10:isReal + "if the matrix is real (not complex)", // 10:isReal "if the matrix is binary", // 11:isBinary "if the matrix arises from a 2D/3D discretization", // 12:isND "if the matrix is symmetric positive definite", // 13:posdef diff --git a/CSparse/MATLAB/UFget/UFhelp.html b/CSparse/MATLAB/UFget/UFhelp.html index 01775b2093..935a905acf 100644 --- a/CSparse/MATLAB/UFget/UFhelp.html +++ b/CSparse/MATLAB/UFget/UFhelp.html @@ -21,13 +21,17 @@

1. Overview

UFgui is a Java GUI interface to the University of Florida Sparse Matrix Collection at http://www.cise.ufl.edu/research/sparse/matrices. It provides an easy way to select matrices from the collection based on their matrix -properties. As of September 2009, there were 2255 matrices ranging in size +properties. As of October 2010, there were 2328 matrices ranging in size from 1-by-2 (with a single nonzero entry) to a square matrix with nearly 28 million rows and 760 million entries. The total size of the collection in all -three formats exceeds 40 GB, and is constantly growing in size. +three formats exceeds 47 GB, and is constantly growing in size.

2. Quick Start

+First, download the UFget archive (tar.gz or zip file), and uncompress it. +Open the UFget folder. + +

If your web browswer requires an HTTP proxy, or if you wish to change the download location, first see the Customization section below, to configure UFgui before you run it. @@ -40,16 +44,23 @@

2. Quick Start

java -jar UFgui.jar +If the above command fails, then you need to install Java. +See +http://www.java.com/en/download/manual.jsp for details. + +

You can skip reading this document by simply navigating the GUI itself. Most of the buttons, check boxes, lists, and table columns have a short "tool tip" which is visible if you hover your mouse over the item.

When the UFgui starts, it checks for any missing matrix icons and -downloads a new table if needed. +downloads a new table if needed. This might take a few minutes, so +just sit back and enjoy the slideshow. It will only happen occassionaly.

3. A Sparse Matrix Problem

-The UF Sparse Matrix Collection a simplified name. It is actually a collection +The UF Sparse Matrix Collection is a simplified name. It is actually a +collection of sparse matrix problems, not just sparse matrices. Each problem includes one primary sparse matrix and meta-data about that matrix. Some problems include additional matrices and vectors (sparse or dense) such as @@ -184,6 +195,11 @@

5. Selecting Matrices

the list to add a single item to your highlighted choices. To clear your choices, click the Reset criteria button, described below. +

When you select/deselect matrices, the boxes to the left of each matrix in +the Table of Matrices get checked/unchecked. You still see all the matrices +in the list, because you can then modify your selection by checking/unchecking +matrices one at a time in the Table itself. +

At the bottom of the Selection Criteria panel is a row of buttons: @@ -279,9 +295,13 @@

5. Selecting Matrices

  • real: this box is checked if the matrix is real. It is complex otherwise. + Note that real matrices include any matrix that is not + complex. In particular, integer and binary matrices are + considered real in this search criterion.
  • binary: this box is checked if the matrix is binary. - It is non-binary otherwise (there are no binary complex matrices). + It is non-binary otherwise (there are no binary complex matrices, + so any matrix that is binary is also marked as real).
  • 2D/3D: this box is checked if the matrix comes from a discretization of a 2D or 3D geometry. @@ -449,7 +469,7 @@

    7. Limitations and known issues

    8. Copyright and License

    -Copyright (c) 2009, Timothy A. Davis. All rights reserved. +Copyright (c) 2009-2010, Timothy A. Davis. All rights reserved.

    Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: @@ -479,6 +499,8 @@

    8. Copyright and License

    9. Version and Change-Log