* Lewis and Michael Wester. */
/*
- * GiNaC Copyright (C) 1999-2000 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2005 Johannes Gutenberg University Mainz, Germany
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "times.h"
-#include "time_lw_w101n.h"
-static unsigned test(void)
+static unsigned test()
{
- matrix m(101,101);
- for (unsigned r=0; r<101; ++r) {
- for (unsigned c=0; c<10; ++c) {
- m.set(r,
- unsigned(ex_to_numeric(w101_numeric[r][2*c+1]).to_int()-1),
- w101_numeric[r][2*c+2]);
- }
- }
- ex det = m.determinant();
-
- if (det!=numeric("75810815066186520")) {
- clog << "det of sparse rank 101 matrix erroneously returned " << det << endl;
- return 1;
- }
- return 0;
+ // This is a pattern that comes up in graph theory:
+ const unsigned n = 10;
+ matrix m(n*n+1,n*n+1);
+ for (unsigned i=1; i<=n*n; ++i)
+ m.set(i-1,i-1,1);
+ for (unsigned i=1; i<=n*n; ++i)
+ if (!(i%n))
+ m.set(i-1,n*n,1);
+ for (unsigned i=1; i<=n*n; ++i)
+ if (!((i-1)%n))
+ m.set(n*n,i-1,n-(i-1)/n);
+ for(unsigned i=1; i<=n; ++i)
+ for (unsigned j=1; j<=n; ++j)
+ if (i-j)
+ for (unsigned k=1; k<n; ++k)
+ m.set((i-1)*n+k-1,(j-1)*n+k,n+1-j);
+
+ ex det = m.determinant();
+
+ if (det!=numeric("75810815066186520")) {
+ clog << "det of sparse rank 101 matrix erroneously returned " << det << endl;
+ return 1;
+ }
+ return 0;
}
-unsigned time_lw_P(void)
+unsigned time_lw_P()
{
- unsigned result = 0;
- unsigned count = 1;
- timer rolex;
- double time = .0;
-
- cout << "timing Lewis-Wester test P (det of sparse rank 101)" << flush;
- clog << "-------Lewis-Wester test P (det of sparse rank 101)" << endl;
-
- rolex.start();
- // correct for very small times:
- do {
- result = test();
- ++count;
- } while ((time=rolex.read())<0.1 && !result);
- cout << '.' << flush;
-
- if (!result) {
- cout << " passed ";
- clog << "(no output)" << endl;
- } else {
- cout << " failed ";
- }
- cout << int(1000*(time/count))*0.001 << 's' << endl;
-
- return result;
+ unsigned result = 0;
+ unsigned count = 0;
+ timer rolex;
+ double time = .0;
+
+ cout << "timing Lewis-Wester test P (det of sparse rank 101)" << flush;
+ clog << "-------Lewis-Wester test P (det of sparse rank 101):" << endl;
+
+ rolex.start();
+ // correct for very small times:
+ do {
+ result = test();
+ ++count;
+ } while ((time=rolex.read())<0.1 && !result);
+ cout << '.' << flush;
+
+ if (!result) {
+ cout << " passed ";
+ clog << "(no output)" << endl;
+ } else {
+ cout << " failed ";
+ }
+ cout << time/count << 's' << endl;
+
+ return result;
}