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-2000 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
25 #include "time_lw_w101n.h"
27 static unsigned test(void)
30 for (unsigned r=0; r<101; ++r) {
31 for (unsigned c=0; c<10; ++c) {
33 unsigned(ex_to_numeric(w101_numeric[r][2*c+1]).to_int()-1),
34 w101_numeric[r][2*c+2]);
37 ex det = m.determinant();
39 if (det!=numeric("75810815066186520")) {
40 clog << "det of sparse rank 101 matrix erroneously returned " << det << endl;
46 unsigned time_lw_P(void)
53 cout << "timing Lewis-Wester test P (det of sparse rank 101)" << flush;
54 clog << "-------Lewis-Wester test P (det of sparse rank 101)" << endl;
57 // correct for very small times:
61 } while ((time=rolex.read())<0.1 && !result);
66 clog << "(no output)" << endl;
70 cout << int(1000*(time/count))*0.001 << 's' << endl;