edu.jas.poly
Class Examples
- java.lang.Object
-
- edu.jas.poly.Examples
-
public class Examples extends java.lang.ObjectExamples for polynomials usage.
-
-
Constructor Summary
Constructors Constructor and Description Examples()
-
Method Summary
All Methods Static Methods Concrete Methods Modifier and Type Method and Description static voidexample0()example0.static voidexample1()example1.static voidexample10()example10.static voidexample11()example11.static voidexample12()example12.static voidexample2()example2.static voidexample3()example3.static voidexample4()example4.static voidexample5()example5.static voidexample6()example6.static voidexample7()example7.static voidexample8()example8.static voidexample9()example9.static voidmain(java.lang.String[] args)main.
-
-
-
Method Detail
-
main
public static void main(java.lang.String[] args)
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)
-
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.
-
-
DMelt 3.0 © DataMelt by jWork.ORG