Class Examples
java.lang.Object
edu.jas.poly.Examples
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionstatic voidexample0()example0. for PPPJ 2006.static voidexample1()example1. random polynomial with rational coefficients.static voidexample10.static voidexample11. degree matrix;static voidexample12. type games.static voidexample13. poly parser for strange syntax.static voidstatic voidexample2()example2. random polynomial with coefficients of rational polynomials.static voidexample3()example3. random rational algebraic number.static voidexample4()example4. random modular algebraic number.static voidexample5()example5. random solvable polynomial with rational coefficients.static voidexample6()example6.static voidexample7()example7.static voidexample8()example8.static voidexample9()example9.protected static longgetPrime()static voidmain.
-
Constructor Details
-
Examples
public Examples()
-
-
Method Details
-
main
main. -
example0
public static void example0()example0. for PPPJ 2006. -
example1
public static void example1()example1. random polynomial with rational coefficients. Q[x_1,...x_7] -
example2
public static void example2()example2. random polynomial with coefficients of rational polynomials. Q[x_1,...x_7][y_1,...,y_3] -
example3
public static void example3()example3. random rational algebraic number. Q(alpha) -
getPrime
protected static long getPrime() -
example4
public static void example4()example4. random modular algebraic number. Z_p(alpha) -
example5
public static void example5()example5. random solvable polynomial with rational coefficients. Q{x_1,...x_6, {x_2 * x_1 = x_1 x_2 +1, ...} } -
example6
public static void example6()example6. Fateman benchmark: p = (x+y+z)^20; q = p * (p+1) Z[z,y,x] -
example7
public static void example7()example7. Fateman benchmark: p = (x+y+z)^20; q = p * (p+1) Q[z,y,x] -
example8
public static void example8()example8. Chebyshev polynomials T(0) = 1 T(1) = x T(n) = 2x * T(n-1) - T(n-2) -
example9
public static void example9()example9. Legendre polynomials P(0) = 1 P(1) = x P(n) = 1/n [ (2n-1) * x * P(n-1) - (n-1) * P(n-2) ] -
example10
public static void example10()example10. Hermite polynomials H(0) = 1 H(1) = 2 x H(n) = 2 * x * H(n-1) - 2 * (n-1) * H(n-2) -
example11
public static void example11()example11. degree matrix; -
example12
public static void example12()example12. type games. -
example13
public static void example13()example13. poly parser for strange syntax. -
example14
public static void example14()
-