001/* 002 * $Id$ 003 */ 004 005package edu.jas.poly; 006 007 008import java.util.ArrayList; 009import java.util.List; 010 011import edu.jas.arith.BigInteger; 012import edu.jas.arith.BigRational; 013import edu.jas.arith.ModInteger; 014import edu.jas.arith.ModIntegerRing; 015 016 017/** 018 * Examples for polynomials usage. 019 * @author Heinz Kredel 020 */ 021 022public class Examples { 023 024 025 /** 026 * main. 027 */ 028 public static void main(String[] args) { 029 //example0(); 030 /* 031 example1(); 032 example2(); 033 example3(); 034 example4(); 035 example5(); 036 */ 037 //example6(); 038 example7(); 039 example7(); 040 //example8(); 041 //example9(); 042 //example10(); 043 //example11(); 044 //example12(); 045 //example13(); 046 example14(); 047 } 048 049 050 /** 051 * example0. for PPPJ 2006. 052 */ 053 public static void example0() { 054 BigInteger z = new BigInteger(); 055 056 TermOrder to = new TermOrder(); 057 String[] vars = new String[] { "x1", "x2", "x3" }; 058 GenPolynomialRing<BigInteger> ring; 059 ring = new GenPolynomialRing<BigInteger>(z, 3, to, vars); 060 System.out.println("ring = " + ring); 061 062 GenPolynomial<BigInteger> pol; 063 pol = ring.parse("3 x1^2 x3^4 + 7 x2^5 - 61"); 064 System.out.println("pol = " + pol); 065 System.out.println("pol = " + pol.toString(ring.getVars())); 066 067 GenPolynomial<BigInteger> one; 068 one = ring.parse("1"); 069 System.out.println("one = " + one); 070 System.out.println("one = " + one.toString(ring.getVars())); 071 072 GenPolynomial<BigInteger> p; 073 p = pol.subtract(pol); 074 System.out.println("p = " + p); 075 System.out.println("p = " + p.toString(ring.getVars())); 076 077 p = pol.multiply(pol); 078 System.out.println("p = " + p); 079 System.out.println("p = " + p.toString(ring.getVars())); 080 } 081 082 083 /** 084 * example1. random polynomial with rational coefficients. Q[x_1,...x_7] 085 */ 086 public static void example1() { 087 System.out.println("\n\n example 1"); 088 089 BigRational cfac = new BigRational(); 090 System.out.println("cfac = " + cfac); 091 String[] vars = new String[] { "x1", "x2", "x3", "x4", "x5", "x6", "x7" }; 092 GenPolynomialRing<BigRational> fac; 093 fac = new GenPolynomialRing<BigRational>(cfac, 7, vars); 094 //System.out.println("fac = " + fac); 095 System.out.println("fac = " + fac); 096 097 GenPolynomial<BigRational> a = fac.random(10); 098 System.out.println("a = " + a); 099 } 100 101 102 /** 103 * example2. random polynomial with coefficients of rational polynomials. 104 * Q[x_1,...x_7][y_1,...,y_3] 105 */ 106 public static void example2() { 107 System.out.println("\n\n example 2"); 108 109 BigRational cfac = new BigRational(); 110 System.out.println("cfac = " + cfac); 111 String[] cvars = new String[] { "x1", "x2", "x3", "x4", "x5", "x6", "x7" }; 112 GenPolynomialRing<BigRational> fac; 113 fac = new GenPolynomialRing<BigRational>(cfac, 7, cvars); 114 System.out.println("fac = " + fac); 115 116 String[] vars = new String[] { "y1", "y2", "y3" }; 117 GenPolynomialRing<GenPolynomial<BigRational>> gfac; 118 gfac = new GenPolynomialRing<GenPolynomial<BigRational>>(fac, 3, vars); 119 System.out.println("gfac = " + gfac); 120 121 GenPolynomial<GenPolynomial<BigRational>> a = gfac.random(10); 122 System.out.println("a = " + a); 123 } 124 125 126 /** 127 * example3. random rational algebraic number. Q(alpha) 128 */ 129 public static void example3() { 130 System.out.println("\n\n example 3"); 131 132 BigRational cfac = new BigRational(); 133 System.out.println("cfac = " + cfac); 134 135 String[] vars = new String[] { "alpha" }; 136 GenPolynomialRing<BigRational> mfac; 137 mfac = new GenPolynomialRing<BigRational>(cfac, 1, vars); 138 System.out.println("mfac = " + mfac); 139 140 GenPolynomial<BigRational> modul = mfac.random(8).monic(); 141 // assume !mo.isUnit() 142 System.out.println("modul = " + modul); 143 144 AlgebraicNumberRing<BigRational> fac; 145 fac = new AlgebraicNumberRing<BigRational>(modul); 146 System.out.println("fac = " + fac); 147 148 AlgebraicNumber<BigRational> a = fac.random(15); 149 System.out.println("a = " + a); 150 } 151 152 153 protected static long getPrime() { 154 long prime = 2; //2^60-93; // 2^30-35; //19; knuth (2,390) 155 for (int i = 1; i < 60; i++) { 156 prime *= 2; 157 } 158 prime -= 93; 159 //System.out.println("prime = " + prime); 160 return prime; 161 } 162 163 164 /** 165 * example4. random modular algebraic number. Z_p(alpha) 166 */ 167 public static void example4() { 168 System.out.println("\n\n example 4"); 169 170 long prime = getPrime(); 171 ModIntegerRing cfac = new ModIntegerRing(prime); 172 System.out.println("cfac = " + cfac); 173 174 String[] vars = new String[] { "alpha" }; 175 GenPolynomialRing<ModInteger> mfac; 176 mfac = new GenPolynomialRing<ModInteger>(cfac, 1, vars); 177 System.out.println("mfac = " + mfac); 178 179 GenPolynomial<ModInteger> modul = mfac.random(8).monic(); 180 // assume !modul.isUnit() 181 System.out.println("modul = " + modul); 182 183 AlgebraicNumberRing<ModInteger> fac; 184 fac = new AlgebraicNumberRing<ModInteger>(modul); 185 System.out.println("fac = " + fac); 186 187 AlgebraicNumber<ModInteger> a = fac.random(12); 188 System.out.println("a = " + a); 189 } 190 191 192 /** 193 * example5. random solvable polynomial with rational coefficients. 194 * Q{x_1,...x_6, {x_2 * x_1 = x_1 x_2 +1, ...} } 195 */ 196 public static void example5() { 197 System.out.println("\n\n example 5"); 198 199 BigRational cfac = new BigRational(); 200 System.out.println("cfac = " + cfac); 201 GenSolvablePolynomialRing<BigRational> sfac; 202 sfac = new GenSolvablePolynomialRing<BigRational>(cfac, 6); 203 //System.out.println("sfac = " + sfac); 204 205 RelationGenerator<BigRational> wl = new WeylRelations<BigRational>(); 206 //wl.generate(sfac); 207 sfac.addRelations(wl); 208 System.out.println("sfac = " + sfac); 209 210 GenSolvablePolynomial<BigRational> a = sfac.random(5); 211 System.out.println("a = " + a); 212 System.out.println("a = " + a.toString(sfac.vars)); 213 214 GenSolvablePolynomial<BigRational> b = a.multiply(a); 215 System.out.println("b = " + b); 216 System.out.println("b = " + b.toString(sfac.vars)); 217 218 System.out.println("sfac = " + sfac); 219 } 220 221 222 /** 223 * example6. Fateman benchmark: p = (x+y+z)^20; q = p * (p+1) Z[z,y,x] 224 */ 225 public static void example6() { 226 System.out.println("\n\n example 6"); 227 228 BigInteger cfac = new BigInteger(); 229 System.out.println("cfac = " + cfac); 230 231 TermOrder to = new TermOrder(TermOrder.INVLEX); 232 System.out.println("to = " + to); 233 234 GenPolynomialRing<BigInteger> fac; 235 fac = new GenPolynomialRing<BigInteger>(cfac, 3, to); 236 System.out.println("fac = " + fac); 237 fac.setVars(new String[] { "z", "y", "x" }); 238 System.out.println("fac = " + fac); 239 240 GenPolynomial<BigInteger> x = fac.univariate(0); 241 GenPolynomial<BigInteger> y = fac.univariate(1); 242 GenPolynomial<BigInteger> z = fac.univariate(2); 243 244 System.out.println("x = " + x); 245 System.out.println("x = " + x.toString(fac.vars)); 246 System.out.println("y = " + y); 247 System.out.println("y = " + y.toString(fac.vars)); 248 System.out.println("z = " + z); 249 System.out.println("z = " + z.toString(fac.vars)); 250 251 GenPolynomial<BigInteger> p = x.sum(y).sum(z).sum(fac.getONE()); 252 //BigInteger f = cfac.fromInteger(10000000001L); 253 // p = p.multiply( f ); 254 System.out.println("p = " + p); 255 System.out.println("p = " + p.toString(fac.vars)); 256 257 GenPolynomial<BigInteger> q = p; 258 for (int i = 1; i < 20; i++) { 259 q = q.multiply(p); 260 } 261 //System.out.println("q = " + q.toString( fac.vars ) ); 262 System.out.println("q = " + q.length()); 263 264 GenPolynomial<BigInteger> q1 = q.sum(fac.getONE()); 265 266 GenPolynomial<BigInteger> q2; 267 long t = System.currentTimeMillis(); 268 q2 = q.multiply(q1); 269 t = System.currentTimeMillis() - t; 270 271 System.out.println("q2 = " + q2.length()); 272 System.out.println("time = " + t + " ms"); 273 } 274 275 276 /** 277 * example7. Fateman benchmark: p = (x+y+z)^20; q = p * (p+1) Q[z,y,x] 278 */ 279 public static void example7() { 280 System.out.println("\n\n example 7"); 281 282 BigRational cfac = new BigRational(); 283 System.out.println("cfac = " + cfac); 284 285 TermOrder to = new TermOrder(TermOrder.INVLEX); 286 System.out.println("to = " + to); 287 288 GenPolynomialRing<BigRational> fac; 289 fac = new GenPolynomialRing<BigRational>(cfac, 3, to); 290 System.out.println("fac = " + fac); 291 fac.setVars(new String[] { "z", "y", "x" }); 292 System.out.println("fac = " + fac); 293 294 long mi = 1L; 295 //long mi = Integer.MAX_VALUE; 296 GenPolynomial<BigRational> x = fac.univariate(0, mi); 297 GenPolynomial<BigRational> y = fac.univariate(1, mi); 298 GenPolynomial<BigRational> z = fac.univariate(2, mi); 299 300 // System.out.println("x = " + x); 301 System.out.println("x = " + x.toString(fac.vars)); 302 // System.out.println("y = " + y); 303 System.out.println("y = " + y.toString(fac.vars)); 304 // System.out.println("z = " + z); 305 System.out.println("z = " + z.toString(fac.vars)); 306 307 GenPolynomial<BigRational> p = x.sum(y).sum(z).sum(fac.getONE()); 308 //BigRational f = cfac.fromInteger(10000000001L); 309 // f = f.multiply( f ); 310 //p = p.multiply( f ); 311 // System.out.println("p = " + p); 312 System.out.println("p = " + p.toString(fac.vars)); 313 314 int mpow = 20; 315 System.out.println("mpow = " + mpow); 316 GenPolynomial<BigRational> q = p; 317 for (int i = 1; i < mpow; i++) { 318 q = q.multiply(p); 319 } 320 //System.out.println("q = " + q.toString( fac.vars ) ); 321 System.out.println("len(q) = " + q.length()); 322 System.out.println("deg(q) = " + q.degree()); 323 324 GenPolynomial<BigRational> q1 = q.sum(fac.getONE()); 325 326 GenPolynomial<BigRational> q2; 327 long t = System.currentTimeMillis(); 328 q2 = q.multiply(q1); 329 t = System.currentTimeMillis() - t; 330 331 System.out.println("len(q2) = " + q2.length()); 332 System.out.println("deg(q2) = " + q2.degree()); 333 System.out.println("LeadEV(q2) = " + q2.leadingExpVector()); 334 System.out.println("time = " + t + " ms"); 335 } 336 337 338 /** 339 * example8. Chebyshev polynomials 340 * 341 * T(0) = 1 T(1) = x T(n) = 2x * T(n-1) - T(n-2) 342 */ 343 public static void example8() { 344 int m = 10; 345 BigInteger fac = new BigInteger(); 346 String[] var = new String[] { "x" }; 347 348 GenPolynomialRing<BigInteger> ring = new GenPolynomialRing<BigInteger>(fac, 1, var); 349 350 List<GenPolynomial<BigInteger>> T = new ArrayList<GenPolynomial<BigInteger>>(m); 351 352 GenPolynomial<BigInteger> t, one, x, x2, x2b; 353 354 one = ring.getONE(); 355 x = ring.univariate(0); 356 //x2 = ring.parse("2 x"); 357 //x2a = x.multiply( fac.fromInteger(2) ); 358 x2b = x.multiply(new BigInteger(2)); 359 x2 = x2b; 360 361 T.add(one); 362 T.add(x); 363 for (int n = 2; n < m; n++) { 364 t = x2.multiply(T.get(n - 1)).subtract(T.get(n - 2)); 365 T.add(t); 366 } 367 for (int n = 0 /*m-2*/; n < m; n++) { 368 System.out.println("T[" + n + "] = " + T.get(n)); //.toString(var) ); 369 } 370 } 371 372 373 /** 374 * example9. Legendre polynomials 375 * 376 * P(0) = 1 P(1) = x P(n) = 1/n [ (2n-1) * x * P(n-1) - (n-1) * P(n-2) ] 377 */ 378 // P(n+1) = 1/(n+1) [ (2n+1) * x * P(n) - n * P(n-1) ] 379 public static void example9() { 380 int n = 10; 381 382 BigRational fac = new BigRational(); 383 String[] var = new String[] { "x" }; 384 385 GenPolynomialRing<BigRational> ring = new GenPolynomialRing<BigRational>(fac, 1, var); 386 387 List<GenPolynomial<BigRational>> P = new ArrayList<GenPolynomial<BigRational>>(n); 388 389 GenPolynomial<BigRational> t, one, x, xc; 390 BigRational n21, nn; 391 392 one = ring.getONE(); 393 x = ring.univariate(0); 394 395 P.add(one); 396 P.add(x); 397 for (int i = 2; i < n; i++) { 398 n21 = new BigRational(2 * i - 1); 399 xc = x.multiply(n21); 400 t = xc.multiply(P.get(i - 1)); 401 nn = new BigRational(i - 1); 402 xc = P.get(i - 2).multiply(nn); 403 t = t.subtract(xc); 404 nn = new BigRational(1, i); 405 t = t.multiply(nn); 406 P.add(t); 407 } 408 for (int i = 0; i < n; i++) { 409 System.out.println("P[" + i + "] = " + P.get(i).toString(var)); 410 System.out.println(); 411 } 412 } 413 414 415 /** 416 * example10. Hermite polynomials 417 * 418 * H(0) = 1 H(1) = 2 x H(n) = 2 * x * H(n-1) - 2 * (n-1) * H(n-2) 419 */ 420 // H(n+1) = 2 * x * H(n) - 2 * n * H(n-1) 421 public static void example10() { 422 int n = 100; 423 424 BigInteger fac = new BigInteger(); 425 String[] var = new String[] { "x" }; 426 427 GenPolynomialRing<BigInteger> ring = new GenPolynomialRing<BigInteger>(fac, 1, var); 428 429 List<GenPolynomial<BigInteger>> H = new ArrayList<GenPolynomial<BigInteger>>(n); 430 431 GenPolynomial<BigInteger> t, one, x2, xc, x; 432 BigInteger n2, nn; 433 434 one = ring.getONE(); 435 x = ring.univariate(0); 436 n2 = new BigInteger(2); 437 x2 = x.multiply(n2); 438 H.add(one); 439 H.add(x2); 440 for (int i = 2; i < n; i++) { 441 t = x2.multiply(H.get(i - 1)); 442 nn = new BigInteger(2 * (i - 1)); 443 xc = H.get(i - 2).multiply(nn); 444 t = t.subtract(xc); 445 H.add(t); 446 } 447 for (int i = n - 1; i < n; i++) { 448 System.out.println("H[" + i + "] = " + H.get(i).toString(var)); 449 System.out.println(); 450 } 451 } 452 453 454 /** 455 * example11. degree matrix; 456 */ 457 @SuppressWarnings("unchecked") 458 public static void example11() { 459 int n = 50; 460 BigRational fac = new BigRational(); 461 GenPolynomialRing<BigRational> ring = new GenPolynomialRing<BigRational>(fac, n); 462 System.out.println("ring = " + ring + "\n"); 463 464 GenPolynomial<BigRational> p = ring.random(5, 3, 6, 0.5f); 465 System.out.println("p = " + p + "\n"); 466 467 List<GenPolynomial<BigInteger>> dem = TermOrderOptimization.<BigRational> degreeMatrix(p); 468 469 System.out.println("dem = " + dem + "\n"); 470 471 List<GenPolynomial<BigRational>> polys = new ArrayList<GenPolynomial<BigRational>>(); 472 polys.add(p); 473 for (int i = 0; i < 5; i++) { 474 polys.add(ring.random(5, 3, 6, 0.1f)); 475 } 476 System.out.println("polys = " + polys + "\n"); 477 478 dem = TermOrderOptimization.<BigRational> degreeMatrix(polys); 479 System.out.println("dem = " + dem + "\n"); 480 481 List<Integer> perm; 482 perm = TermOrderOptimization.optimalPermutation(dem); 483 System.out.println("perm = " + perm + "\n"); 484 485 List<GenPolynomial<BigInteger>> pdem; 486 pdem = TermOrderOptimization.<GenPolynomial<BigInteger>> listPermutation(perm, dem); 487 System.out.println("pdem = " + pdem + "\n"); 488 489 GenPolynomialRing<BigRational> pring; 490 pring = TermOrderOptimization.<BigRational> permutation(perm, ring); 491 System.out.println("ring = " + ring); 492 System.out.println("pring = " + pring + "\n"); 493 494 List<GenPolynomial<BigRational>> ppolys; 495 ppolys = TermOrderOptimization.<BigRational> permutation(perm, pring, polys); 496 System.out.println("ppolys = " + ppolys + "\n"); 497 498 dem = TermOrderOptimization.<BigRational> degreeMatrix(ppolys); 499 //System.out.println("pdem = " + dem + "\n"); 500 501 perm = TermOrderOptimization.optimalPermutation(dem); 502 //System.out.println("pperm = " + perm + "\n"); 503 int i = 0; 504 for (Integer j : perm) { 505 if (i != (int) j) { 506 System.out.println("error = " + i + " != " + j + "\n"); 507 } 508 i++; 509 } 510 511 OptimizedPolynomialList<BigRational> op; 512 op = TermOrderOptimization.<BigRational> optimizeTermOrder(ring, polys); 513 System.out.println("op:\n" + op); 514 if (!op.equals(new PolynomialList<BigRational>(pring, ppolys))) { 515 System.out.println("error = " + "\n" + op); 516 } 517 } 518 519 520 /** 521 * example12. type games. 522 */ 523 public static void example12() { 524 System.out.println("\n\n example 12"); 525 526 BigRational t1 = new BigRational(); 527 System.out.println("t1 = " + t1); 528 529 BigInteger t2 = new BigInteger(); 530 System.out.println("t2 = " + t2); 531 532 System.out.println("t1.isAssignableFrom(t2) = " + t1.getClass().isAssignableFrom(t2.getClass())); 533 System.out.println("t2.isAssignableFrom(t1) = " + t2.getClass().isAssignableFrom(t1.getClass())); 534 535 String[] vars = new String[] { "x1", "x2", "x3" }; 536 GenPolynomialRing<BigInteger> t3 = new GenPolynomialRing<BigInteger>(t2, 3, vars); 537 System.out.println("t3 = " + t3); 538 539 GenSolvablePolynomialRing<BigInteger> t4 = new GenSolvablePolynomialRing<BigInteger>(t2, vars); 540 System.out.println("t4 = " + t4); 541 542 System.out.println("t3.isAssignableFrom(t4) = " + t3.getClass().isAssignableFrom(t4.getClass())); 543 System.out.println("t4.isAssignableFrom(t3) = " + t4.getClass().isAssignableFrom(t3.getClass())); 544 545 GenPolynomialRing<BigRational> t5 = new GenPolynomialRing<BigRational>(t1, 3, vars); 546 System.out.println("t5 = " + t5); 547 548 System.out.println("t3.isAssignableFrom(t5) = " + t3.getClass().isAssignableFrom(t5.getClass())); 549 System.out.println("t5.isAssignableFrom(t3) = " + t5.getClass().isAssignableFrom(t3.getClass())); 550 } 551 552 553 /** 554 * example13. poly parser for strange syntax. 555 */ 556 public static void example13() { 557 System.out.println("\n\n example 13"); 558 TermOrder to = new TermOrder(TermOrder.INVLEX); 559 BigRational cfraction = new BigRational(1); 560 String[] vars = new String[] { "x" }; 561 562 //Scripting.setPrecision(5); 563 564 GenPolynomialRing<BigRational> pfac = new GenPolynomialRing<BigRational>(cfraction, 1, to, vars); 565 GenPolynomial<BigRational> FF0 = pfac.parse("19(6)/10"); 566 System.out.println("FF0 = " + FF0); 567 FF0 = pfac.parse("19(6)1/10"); 568 System.out.println("FF0 = " + FF0); 569 FF0 = pfac.parse("19 6/10"); 570 System.out.println("FF0 = " + FF0); 571 FF0 = pfac.parse("19*6/10"); 572 System.out.println("FF0 = " + FF0); 573 FF0 = pfac.parse("19+6/10"); 574 System.out.println("FF0 = " + FF0); 575 FF0 = pfac.parse("(x).2"); 576 System.out.println("FF0 = " + FF0); 577 FF0 = pfac.parse("4.0/9.0"); 578 System.out.println("FF0 = " + FF0); 579 FF0 = pfac.parse("4/9.0"); 580 System.out.println("FF0 = " + FF0); 581 FF0 = pfac.parse("4.0/9"); 582 System.out.println("FF0 = " + FF0); 583 FF0 = pfac.parse("-4.0/9"); 584 System.out.println("FF0 = " + FF0); 585 } 586 587 588 /* 589 * Old example after Blonski, 1983. 590 */ 591 public static void example14() { 592 BigInteger rf = new BigInteger(); 593 //System.out.println("rf = " + rf.toScriptFactory()); 594 595 // non-commuting indexes: 1 2 3 4 596 //String ss = "E(1,2,3,4)"; 597 IndexFactory wf = new IndexFactory(4); // (1,4) 598 //System.out.println("wf = " + wf.toScript()); 599 600 // index list polynomials over integers 601 GenExteriorPolynomialRing<BigInteger> pf; 602 pf = new GenExteriorPolynomialRing<BigInteger>(rf, wf); 603 //System.out.println("pf = " + pf.toScript()); 604 System.out.println("not commutative" + pf.isCommutative()); 605 System.out.println("associative" + pf.isAssociative()); 606 System.out.println("not field" + pf.isField()); 607 608 GenExteriorPolynomial<BigInteger> emaxd, p1, p2, q1, q2, s, g1, g2, e1, e2, e1dual, e2dual, q, qs, qt, 609 g1dual, g2dual, s1, s2; 610 // parse points in 4-space as polynomials 611 emaxd = pf.parse("E(1,2,3,4)"); // wf.imax 612 System.out.println("emaxd = " + emaxd + ", imax = " + pf.ixfac.imax); 613 p1 = pf.parse("1 E(1) + 5 E(2) - 2 E(3) + 1 E(4)"); 614 p2 = pf.parse("4 E(1) + 3 E(2) + 6 E(3) + 1 E(4)"); 615 System.out.println("p1 = " + p1); 616 System.out.println("p2 = " + p2); 617 q1 = pf.parse("3 E(1) - 2 E(2) - 1 E(3) + 1 E(4)"); 618 q2 = pf.parse("1 E(2) + 5 E(3) + 1 E(4)"); 619 System.out.println("q1 = " + q1); 620 System.out.println("q2 = " + q2); 621 s = pf.parse("1 E(3) + 1 E(4)"); 622 System.out.println("s = " + s); 623 624 // compute line(gerade) p1..p2 and q1..q2 625 g1 = p1.multiply(p2).abs(); 626 g2 = q1.multiply(q2).abs().divide(new BigInteger(3)); 627 System.out.println("g1 = p1 /\\ p2 = " + g1); 628 System.out.println("g2 = q1 /\\ q2 = " + g2); 629 System.out.println("pp(g2) = " + q1.multiply(q2).coeffPrimitivePart()); 630 System.out.println("g2 == pp(g2): " + g2 + " == " + q1.multiply(q2).coeffPrimitivePart()); 631 632 // compute plane(ebene) g1..s and g2..s 633 e1 = g1.multiply(s).abs().divide(new BigInteger(17)); 634 e2 = g2.multiply(s); 635 System.out.println("e1 = g1 /\\ s = " + e1); 636 System.out.println("e2 = g2 /\\ s = " + e2); 637 System.out.println("e1 == pp(e1): " + e1 + " == " + g1.multiply(s).coeffPrimitivePart()); 638 639 // compute dual planes of e1, e2 as e1..emaxd and e2..emaxd 640 e1dual = e1.interiorRightProduct(emaxd).abs(); 641 e2dual = e2.interiorRightProduct(emaxd).abs(); 642 System.out.println("e1dual = e1 |_ emaxd = " + e1dual); 643 System.out.println("e2dual = e2 |_ emaxd = " + e2dual); 644 645 // compute intersection of plane e1, e2 via dual plane sum 646 q = e1dual.multiply(e2dual).abs().divide(new BigInteger(5)); 647 System.out.println("q = (e1dual /\\ e2dual) = " + q); 648 System.out.println("q == pp(q): " + q + " == " + e1dual.multiply(e2dual).coeffPrimitivePart()); 649 qs = q.interiorRightProduct(emaxd).abs(); 650 System.out.println("qs = (e1dual /\\ e2dual) |_ emaxd = " + qs); 651 qt = e1.interiorLeftProduct(e2dual).abs().divide(new BigInteger(5)); 652 System.out.println("qt = e1 _| e2dual = " + qt); 653 System.out.println("qt == pp(qt): " + qt + " == " + e1.interiorLeftProduct(e2dual).coeffPrimitivePart()); 654 System.out.println("qs == qt: " + qs + " == " + qt); 655 656 // compute dual line(gerade) of g1, g2 657 g1dual = g1.interiorRightProduct(emaxd); 658 g2dual = g2.interiorRightProduct(emaxd).abs(); 659 System.out.println("g1dual = g1 |_ emaxd = " + g1dual); 660 System.out.println("g2dual = g2 |_ emaxd = " + g2dual); 661 662 // compute intersection of g1..e2 and g2..e1 663 s1 = e2.interiorLeftProduct(g1dual).abs().divide(new BigInteger(5)); 664 System.out.println("s1 = e2 _| g1dual = " + s1); 665 s2 = e1.interiorLeftProduct(g2dual).abs().divide(new BigInteger(5)); 666 System.out.println("s2 = e1 _| g2dual = " + s2); 667 668 // check intersection of s..qs, qs..e1 and qs..e2 669 System.out.println(" s /\\ qs = s \\in qs = " + s.multiply(qs)); 670 System.out.println("qs /\\ e1 = qs \\in e1 = " + qs.multiply(e1)); 671 System.out.println("qs /\\ e2 = qs \\in e2 = " + qs.multiply(e2)); 672 System.out.println("qs /\\ s == 0: " + qs.multiply(s).isZERO()); 673 System.out.println("qs /\\ e1 == 0: " + qs.multiply(e1).isZERO()); 674 System.out.println("qs /\\ e2 == 0: " + qs.multiply(e2).isZERO()); 675 } 676 677}