1 /** @file time_lw_P.cpp
3 * Test P from the paper "Comparison of Polynomial-Oriented CAS" by Robert H.
4 * Lewis and Michael Wester. */
7 * GiNaC Copyright (C) 1999-2002 Johannes Gutenberg University Mainz, Germany
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation; either version 2 of the License, or
12 * (at your option) any later version.
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
19 * You should have received a copy of the GNU General Public License
20 * along with this program; if not, write to the Free Software
21 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
26 static unsigned test(void)
28 // This is a pattern that comes up in graph theory:
29 const unsigned n = 10;
30 matrix m(n*n+1,n*n+1);
31 for (unsigned i=1; i<=n*n; ++i)
33 for (unsigned i=1; i<=n*n; ++i)
36 for (unsigned i=1; i<=n*n; ++i)
38 m.set(n*n,i-1,n-(i-1)/n);
39 for(unsigned i=1; i<=n; ++i)
40 for (unsigned j=1; j<=n; ++j)
42 for (unsigned k=1; k<n; ++k)
43 m.set((i-1)*n+k-1,(j-1)*n+k,n+1-j);
45 ex det = m.determinant();
47 if (det!=numeric("75810815066186520")) {
48 clog << "det of sparse rank 101 matrix erroneously returned " << det << endl;
54 unsigned time_lw_P(void)
61 cout << "timing Lewis-Wester test P (det of sparse rank 101)" << flush;
62 clog << "-------Lewis-Wester test P (det of sparse rank 101)" << endl;
65 // correct for very small times:
69 } while ((time=rolex.read())<0.1 && !result);
74 clog << "(no output)" << endl;
78 cout << int(1000*(time/count))*0.001 << 's' << endl;