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-2009 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
26 using namespace GiNaC;
32 static unsigned test()
34 // This is a pattern that comes up in graph theory:
35 const unsigned n = 10;
36 matrix m(n*n+1,n*n+1);
37 for (unsigned i=1; i<=n*n; ++i)
39 for (unsigned i=1; i<=n*n; ++i)
42 for (unsigned i=1; i<=n*n; ++i)
44 m.set(n*n,i-1,n-(i-1)/n);
45 for(unsigned i=1; i<=n; ++i)
46 for (unsigned j=1; j<=n; ++j)
48 for (unsigned k=1; k<n; ++k)
49 m.set((i-1)*n+k-1,(j-1)*n+k,n+1-j);
51 ex det = m.determinant();
53 if (det!=numeric("75810815066186520")) {
54 clog << "det of sparse rank 101 matrix erroneously returned " << det << endl;
67 cout << "timing Lewis-Wester test P (det of sparse rank 101)" << flush;
70 // correct for very small times:
74 } while ((time=rolex.read())<0.1 && !result);
75 cout << time/count << 's' << endl;
80 extern void randomify_symbol_serials();
82 int main(int argc, char** argv)
84 randomify_symbol_serials();
85 cout << setprecision(2) << showpoint;