3 * Some test with polynomial GCD calculations. See also the checks for
4 * rational function normalization in normalization.cpp. */
7 * GiNaC Copyright (C) 1999 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
24 #include <ginac/ginac.h>
25 using namespace GiNaC;
27 const int MAX_VARIABLES = 5;
29 static symbol x("x"), z("z");
30 static symbol y[MAX_VARIABLES];
33 static unsigned poly_gcd1(void)
35 for (int v=1; v<=MAX_VARIABLES; v++) {
38 for (int i=0; i<v; i++) {
43 ex f = (e1 + 1) * (e1 + 2);
44 ex g = e2 * (-pow(x, 2) * y[0] * 3 + pow(y[0], 2) - 1);
47 clog << "case 1, gcd(" << f << "," << g << ") = " << r << " (should be 1)" << endl;
54 // Linearly dense quartic inputs with quadratic GCDs
55 static unsigned poly_gcd2(void)
57 for (int v=1; v<=MAX_VARIABLES; v++) {
60 for (int i=0; i<v; i++) {
65 ex d = pow(e1 + 1, 2);
66 ex f = d * pow(e2 - 2, 2);
67 ex g = d * pow(e1 + 2, 2);
72 if ((r - d).expand().compare(exZERO()) != 0) {
73 clog << "case 2, gcd(" << f << "," << g << ") = " << r << " (should be " << d << ")" << endl;
80 // Sparse GCD and inputs where degrees are proportional to the number of variables
81 static unsigned poly_gcd3(void)
83 for (int v=1; v<=MAX_VARIABLES; v++) {
84 ex e1 = pow(x, v + 1);
85 for (int i=0; i<v; i++)
86 e1 += pow(y[i], v + 1);
92 if ((r - d).expand().compare(exZERO()) != 0) {
93 clog << "case 3, gcd(" << f << "," << g << ") = " << r << " (should be " << d << ")" << endl;
100 // Variation of case 3; major performance degradation with PRS
101 static unsigned poly_gcd3p(void)
103 for (int v=1; v<=MAX_VARIABLES; v++) {
104 ex e1 = pow(x, v + 1);
106 for (int i=0; i<v; i++) {
107 e1 += pow(y[i], v + 1);
115 if ((r - d).expand().compare(exZERO()) != 0) {
116 clog << "case 3p, gcd(" << f << "," << g << ") = " << r << " (should be " << d << ")" << endl;
123 // Quadratic non-monic GCD; f and g have other quadratic factors
124 static unsigned poly_gcd4(void)
126 for (int v=1; v<=MAX_VARIABLES; v++) {
127 ex e1 = pow(x, 2) * pow(y[0], 2);
128 ex e2 = pow(x, 2) - pow(y[0], 2);
130 for (int i=1; i<v; i++) {
138 ex g = d * pow(e3 + 2, 2);
140 if ((r - d).expand().compare(exZERO()) != 0) {
141 clog << "case 4, gcd(" << f << "," << g << ") = " << r << " (should be " << d << ")" << endl;
148 // Completely dense non-monic quadratic inputs with dense non-monic linear GCDs
149 static unsigned poly_gcd5(void)
151 for (int v=1; v<=MAX_VARIABLES; v++) {
155 for (int i=0; i<v; i++) {
165 if ((r - d).expand().compare(exZERO()) != 0) {
166 clog << "case 5, gcd(" << f << "," << g << ") = " << r << " (should be " << d << ")" << endl;
173 // Sparse non-monic quadratic inputs with linear GCDs
174 static unsigned poly_gcd5p(void)
176 for (int v=1; v<=MAX_VARIABLES; v++) {
178 for (int i=0; i<v; i++)
185 if ((r - d).expand().compare(exZERO()) != 0) {
186 clog << "case 5p, gcd(" << f << "," << g << ") = " << r << " (should be " << d << ")" << endl;
193 // Trivariate inputs with increasing degrees
194 static unsigned poly_gcd6(void)
198 for (int j=1; j<=MAX_VARIABLES; j++) {
199 ex d = pow(x, j) * y * (z - 1);
200 ex f = d * (pow(x, j) + pow(y, j + 1) * pow(z, j) + 1);
201 ex g = d * (pow(x, j + 1) + pow(y, j) * pow(z, j + 1) - 7);
203 if ((r - d).expand().compare(exZERO()) != 0) {
204 clog << "case 6, gcd(" << f << "," << g << ") = " << r << " (should be " << d << ")" << endl;
211 // Trivariate polynomials whose GCD has common factors with its cofactors
212 static unsigned poly_gcd7(void)
215 ex p = x - y * z + 1;
216 ex q = x - y + z * 3;
218 for (int j=1; j<=3; j++) {
219 for (int k=j+1; k<=4; k++) {
220 ex d = pow(p, j) * pow(q, j);
221 ex f = pow(p, j) * pow(q, k);
222 ex g = pow(p, k) * pow(q, j);
224 if ((r - d).expand().compare(exZERO()) != 0 && (r + d).expand().compare(exZERO()) != 0) {
225 clog << "case 7, gcd(" << f << "," << g << ") = " << r << " (should be " << d << ")" << endl;
233 unsigned poly_gcd(void)
237 cout << "checking polynomial GCD computation..." << flush;
238 clog << "---------polynomial GCD computation:" << endl;
240 result += poly_gcd1();
241 result += poly_gcd2();
242 result += poly_gcd3();
243 // result += poly_gcd3p(); // takes extremely long (PRS "worst" case)
244 result += poly_gcd4();
245 result += poly_gcd5();
246 result += poly_gcd5p();
247 result += poly_gcd6();
248 result += poly_gcd7();
252 clog << "(no output)" << endl;