File: time_lw_M1.cpp

package info (click to toggle)
ginac 1.0.8-1
  • links: PTS
  • area: main
  • in suites: woody
  • size: 3,544 kB
  • ctags: 3,232
  • sloc: cpp: 27,732; sh: 7,126; perl: 1,819; yacc: 763; lex: 345; makefile: 221; sed: 32
file content (103 lines) | stat: -rw-r--r-- 4,797 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
/** @file time_lw_M1.cpp
 *
 *  Test M1 from the paper "Comparison of Polynomial-Oriented CAS" by Robert H.
 *  Lewis and Michael Wester. */

/*
 *  GiNaC Copyright (C) 1999-2002 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
 *  the Free Software Foundation; either version 2 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  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
 */

#include "times.h"

static unsigned test(void)
{
	// Determinant of a sparse matrix that comes up in graph theory:
	symbol x1("x1"), x2("x2"), x3("x3"), x4("x4"), x5("x5");
	static ex w[26][11] = {
		{ 1,  1,  1,  7, x4, 12, x3, 17, x2, 22, x1},
		{ 2,  2,  1,  8, x4, 13, x3, 18, x2, 23, x1},
		{ 3,  3,  1,  9, x4, 14, x3, 19, x2, 24, x1},
		{ 4,  4,  1, 10, x4, 15, x3, 20, x2, 25, x1},
		{ 5,  5,  1, 26,  1,  1,  0,  1,  0,  1, 0 },
		{ 6,  2, x5,  6,  1, 12, x3, 17, x2, 22, x1},
		{ 7,  3, x5,  7,  1, 13, x3, 18, x2, 23, x1},
		{ 8,  4, x5,  8,  1, 14, x3, 19, x2, 24, x1},
		{ 9,  5, x5,  9,  1, 15, x3, 20, x2, 25, x1},
		{10, 10,  1, 26,  1,  1,  0,  1,  0,  1, 0 },
		{11,  2, x5,  7, x4, 11,  1, 17, x2, 22, x1},
		{12,  3, x5,  8, x4, 12,  1, 18, x2, 23, x1},
		{13,  4, x5,  9, x4, 13,  1, 19, x2, 24, x1},
		{14,  5, x5, 10, x4, 14,  1, 20, x2, 25, x1},
		{15, 15,  1, 26,  1,  1,  0,  1,  0,  1, 0 },
		{16,  2, x5,  7, x4, 12, x3, 16,  1, 22, x1},
		{17,  3, x5,  8, x4, 13, x3, 17,  1, 23, x1},
		{18,  4, x5,  9, x4, 14, x3, 18,  1, 24, x1},
		{19,  5, x5, 10, x4, 15, x3, 19,  1, 25, x1},
		{20, 20,  1, 26,  1,  1,  0,  1,  0,  1, 0 },
		{21,  2, x5,  7, x4, 12, x3, 17, x2, 21, 1 },
		{22,  3, x5,  8, x4, 13, x3, 18, x2, 22, 1 },
		{23,  4, x5,  9, x4, 14, x3, 19, x2, 23, 1 },
		{24,  5, x5, 10, x4, 15, x3, 20, x2, 24, 1 },
		{25, 25,  1, 26,  1,  1,  0,  1,  0,  1, 0 },
		{26,  1, x5,  6, x4, 11, x3, 16, x2, 21, x1}
	};
	matrix m(26,26);
	for (unsigned r=0; r<26; ++r) {
		for (unsigned c=0; c<5; ++c) {
			m.set(r,
			      unsigned(ex_to<numeric>(w[r][2*c+1]).to_int()-1),
			      w[r][2*c+2]);
		}
	}
	ex det = m.determinant();
	// The result should have been:
	ex cmp("-12*x2^2*x5^2*x4-12*x1*x5^2*x3^2-x5^3*x4^2-12*x1*x5^2*x4^2-12*x2*x5^2*x4^2-12*x3*x5^2*x4^2-x4^3*x5^2-36*x3*x1*x5^2*x4-36*x3*x1*x4^2*x5-36*x3*x2*x5^2*x4-36*x3*x2*x4^2*x5-2*x5^3*x4*x2-12*x3^2*x5^2*x4-12*x3^2*x4^2*x5-2*x5^3*x4*x3-2*x4^3*x5*x3-12*x1*x5^2*x2^2-36*x1*x5*x3^2*x4-36*x2*x5*x3^2*x4-x3^3*x5^2-x3^3*x4^2-2*x3^3*x5*x4-12*x2^2*x4^2*x5-12*x2*x5^2*x3^2-12*x2*x4^2*x3^2-12*x1*x4^2*x3^2-x3^2*x5^3-x3^2*x4^3-2*x4^3*x5*x2-2*x3*x5^3*x2-2*x3*x4^3*x2-2*x3^3*x5*x2-2*x3^3*x4*x2-2*x2^3*x5*x4-2*x2^3*x5*x3-2*x2^3*x4*x3-36*x2^2*x5*x4*x3-36*x2*x1*x5^2*x4-36*x2*x1*x4^2*x5-120*x2*x1*x5*x4*x3-36*x2*x1*x5^2*x3-36*x2*x1*x4^2*x3-36*x2*x1*x3^2*x5-36*x2*x1*x3^2*x4-12*x2^2*x5^2*x3-12*x2^2*x4^2*x3-12*x2^2*x3^2*x5-12*x2^2*x3^2*x4-2*x1^3*x4*x3-2*x1^3*x4*x2-2*x1^3*x3*x2-2*x1^3*x5*x2-36*x1^2*x5*x4*x3-36*x2*x1^2*x5*x4-36*x2*x3*x1^2*x5-36*x2*x3*x1^2*x4-x1^3*x5^2-x1^3*x4^2-x1^3*x3^2-x1^3*x2^2-x2^2*x5^3-x2^2*x4^3-x2^2*x3^3-12*x1*x4^2*x2^2-12*x1*x3^2*x2^2-12*x1^2*x5^2*x4-12*x1^2*x4^2*x5-12*x1^2*x5^2*x3-12*x1^2*x4^2*x3-12*x1^2*x3^2*x5-12*x1^2*x3^2*x4-12*x1^2*x5^2*x2-12*x1^2*x4^2*x2-12*x1^2*x3^2*x2-12*x1^2*x2^2*x5-12*x1^2*x2^2*x4-12*x1^2*x2^2*x3-2*x5^3*x4*x1-2*x4^3*x5*x1-2*x3*x5^3*x1-2*x3*x4^3*x1-2*x3^3*x5*x1-2*x3^3*x4*x1-2*x2*x5^3*x1-2*x2*x4^3*x1-2*x2*x3^3*x1-2*x2^3*x5*x1-2*x2^3*x4*x1-2*x2^3*x3*x1-2*x1^3*x5*x4-2*x1^3*x5*x3-36*x1*x5*x2^2*x4-36*x1*x5*x2^2*x3-36*x1*x4*x2^2*x3-x1^2*x5^3-x1^2*x4^3-x1^2*x3^3-x2^3*x5^2-x2^3*x4^2-x2^3*x3^2-x1^2*x2^3",lst(x1,x2,x3,x4,x5));
	if (det!=cmp) {
		clog << "The determinant was miscalculated" << endl;
		return 1;
	}
	return 0;
}

unsigned time_lw_M1(void)
{
	unsigned result = 0;
	unsigned count = 0;
	timer rolex;
	double time = .0;
	
	cout << "timing Lewis-Wester test M1 (26x26 sparse, det)" << flush;
	clog << "-------Lewis-Wester test M1 (26x26 sparse, det):" << 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;
}