* Bump up repetitions since these tests have turned out to be very useful

  for detecting errors in the polynomial code.

diff --git a/check/check_lsolve.cpp b/check/check_lsolve.cpp
index 51792a3ed0e29d0b52457b5d3e86c2657e18a752..40595d3af004920b14a70c57a6c8839d11ddbffa 100644 (file)
--- a/check/check_lsolve.cpp
+++ b/check/check_lsolve.cpp
@@ -1,7 +1,8 @@
 /** @file check_lsolve.cpp
  *
  *  These test routines do some simple checks on solving linear systems of
- *  symbolic equations. */
+ *  symbolic equations.  They are a well-tried resource for cross-checking
+ *  the underlying symbolic manipulations. */
 
 /*
  *  GiNaC Copyright (C) 1999-2002 Johannes Gutenberg University Mainz, Germany
@@ -96,7 +97,7 @@ static unsigned check_inifcns_lsolve(unsigned n)
 {
        unsigned result = 0;
        
-       for (int repetition=0; repetition<100; ++repetition) {
+       for (int repetition=0; repetition<200; ++repetition) {
                // create two size n vectors of symbols, one for the coefficients
                // a[0],..,a[n], one for indeterminates x[0]..x[n]:
                vector<symbol> a;
@@ -163,23 +164,23 @@ unsigned check_lsolve(void)
        clog << "---------linear solve:" << endl;
        
        // solve some numeric linear systems
-       for (unsigned n=1; n<12; ++n)
+       for (unsigned n=1; n<14; ++n)
                result += check_matrix_solve(n, n, 1, 0);
        cout << '.' << flush;
        // solve some underdetermined numeric systems
-       for (unsigned n=1; n<12; ++n)
+       for (unsigned n=1; n<14; ++n)
                result += check_matrix_solve(n+1, n, 1, 0);
        cout << '.' << flush;
        // solve some overdetermined numeric systems
-       for (unsigned n=1; n<12; ++n)
+       for (unsigned n=1; n<14; ++n)
                result += check_matrix_solve(n, n+1, 1, 0);
        cout << '.' << flush;
        // solve some multiple numeric systems
-       for (unsigned n=1; n<12; ++n)
+       for (unsigned n=1; n<14; ++n)
                result += check_matrix_solve(n, n, n/3+1, 0);
        cout << '.' << flush;
        // solve some symbolic linear systems
-       for (unsigned n=1; n<7; ++n)
+       for (unsigned n=1; n<8; ++n)
                result += check_matrix_solve(n, n, 1, 2);
        cout << '.' << flush;
        

diff --git a/check/check_matrices.cpp b/check/check_matrices.cpp
index 465c244ca1a00f6a0733473d5bd2e872c109e636..d69033586196d6c8eab41dd73b3bc5d93922c6ad 100644 (file)
--- a/check/check_matrices.cpp
+++ b/check/check_matrices.cpp
@@ -1,6 +1,8 @@
 /** @file check_matrices.cpp
  *
- *  Here we test manipulations on GiNaC's symbolic matrices. */
+ *  Here we test manipulations on GiNaC's symbolic matrices.  They are a
+ *  well-tried resource for cross-checking the underlying symbolic
+ *  manipulations. */
 
 /*
  *  GiNaC Copyright (C) 1999-2002 Johannes Gutenberg University Mainz, Germany
@@ -29,7 +31,7 @@ static unsigned integdom_matrix_determinants(void)
        unsigned result = 0;
        symbol a("a");
        
-       for (unsigned size=3; size<20; ++size) {
+       for (unsigned size=3; size<22; ++size) {
                matrix A(size,size);
                // populate one element in each row:
                for (unsigned r=0; r<size-1; ++r)
@@ -56,7 +58,7 @@ static unsigned rational_matrix_determinants(void)
        unsigned result = 0;
        symbol a("a"), b("b"), c("c");
        
-       for (unsigned size=3; size<8; ++size) {
+       for (unsigned size=3; size<9; ++size) {
                matrix A(size,size);
                for (unsigned r=0; r<size-1; ++r) {
                        // populate one or two elements in each row:
@@ -90,7 +92,7 @@ static unsigned funny_matrix_determinants(void)
        unsigned result = 0;
        symbol a("a"), b("b"), c("c");
        
-       for (unsigned size=3; size<7; ++size) {
+       for (unsigned size=3; size<8; ++size) {
                matrix A(size,size);
                for (unsigned co=0; co<size-1; ++co) {
                        // populate one or two elements in each row:
@@ -124,7 +126,7 @@ static unsigned compare_matrix_determinants(void)
        unsigned result = 0;
        symbol a("a");
        
-       for (unsigned size=2; size<7; ++size) {
+       for (unsigned size=2; size<8; ++size) {
                matrix A(size,size);
                for (unsigned co=0; co<size; ++co) {
                        for (unsigned ro=0; ro<size; ++ro) {
@@ -161,7 +163,7 @@ static unsigned symbolic_matrix_inverse(void)
        unsigned result = 0;
        symbol a("a"), b("b"), c("c");
        
-       for (unsigned size=2; size<5; ++size) {
+       for (unsigned size=2; size<6; ++size) {
                matrix A(size,size);
                do {
                        for (unsigned co=0; co<size; ++co) {