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
|
/** @file time_fateman_expand.cpp
*
* Time for polynomial expansion of (x+y+z+1)^20 * ((x+y+z+1)^20+1).
* This test was suggested by Richard J. Fateman as a benchmark for programs
* to multiply sparse polynomials fast.
*/
/*
* 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)
{
unsigned result = 0;
const symbol x("x"), y("y"), z("z");
const ex p = pow(x+y+z+1, 20);
const ex hugesum = expand(p * (p+1));
if (hugesum.nops()!=12341) {
clog << "(x+y+z+1)^20 * ((x+y+z+1)^20+1) was miscomputed!" << endl;
++result;
}
return result;
}
unsigned time_fateman_expand(void)
{
unsigned result = 0;
unsigned count = 0;
timer concord;
double time = .0;
cout << "timing Fateman's polynomial expand benchmark" << flush;
clog << "-------Fateman's polynomial expand benchmark:" << endl;
concord.start();
// correct for very small times:
do {
result = test();
++count;
} while ((time=concord.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;
}
|
