001/*
002 * $Id: FactorGenericTest.java 5863 2018-07-20 11:13:34Z kredel $
003 */
004
005package edu.jas.ufd;
006
007
008import java.util.SortedMap;
009
010import junit.framework.Test;
011import junit.framework.TestCase;
012import junit.framework.TestSuite;
013
014import edu.jas.arith.BigRational;
015import edu.jas.kern.ComputerThreads;
016import edu.jas.poly.AlgebraicNumber;
017import edu.jas.poly.AlgebraicNumberRing;
018import edu.jas.poly.GenPolynomial;
019import edu.jas.poly.GenPolynomialRing;
020import edu.jas.poly.TermOrder;
021
022
023/**
024 * Factor rational tests with JUnit.
025 * @author Heinz Kredel
026 */
027
028public class FactorGenericTest extends TestCase {
029
030
031    /**
032     * main.
033     */
034    public static void main(String[] args) {
035        junit.textui.TestRunner.run(suite());
036    }
037
038
039    /**
040     * Constructs a <CODE>FactorGenericTest</CODE> object.
041     * @param name String.
042     */
043    public FactorGenericTest(String name) {
044        super(name);
045    }
046
047
048    /**
049     */
050    public static Test suite() {
051        TestSuite suite = new TestSuite(FactorGenericTest.class);
052        return suite;
053    }
054
055
056    int rl = 3;
057
058
059    int kl = 5;
060
061
062    int ll = 5;
063
064
065    int el = 3;
066
067
068    float q = 0.3f;
069
070
071    @Override
072    protected void setUp() {
073    }
074
075
076    @Override
077    protected void tearDown() {
078        ComputerThreads.terminate();
079    }
080
081
082    /**
083     * Test dummy for Junit.
084     * 
085     */
086    public void xtestDummy() {
087    }
088
089
090    /**
091     * Test generic factorization.
092     * 
093     */
094    public void testGenericFactorization() {
095
096        TermOrder to = new TermOrder(TermOrder.INVLEX);
097        BigRational cfac = new BigRational(1);
098
099        String[] var_w2 = new String[] { "w2" };
100        GenPolynomialRing<BigRational> pfac = new GenPolynomialRing<BigRational>(cfac, 1, to, var_w2);
101        //System.out.println("pfac   = " + pfac.toScript());
102
103        GenPolynomial<BigRational> w2 = pfac.parse(" w2^2 - 2 ");
104        //System.out.println("w2     = " + w2);
105
106        AlgebraicNumberRing<BigRational> a2fac = new AlgebraicNumberRing<BigRational>(w2, true);
107        //System.out.println("a2fac  = " + a2fac.toScript());
108
109        String[] var_x = new String[] { "x" };
110        GenPolynomialRing<AlgebraicNumber<BigRational>> apfac = new GenPolynomialRing<AlgebraicNumber<BigRational>>(
111                a2fac, 1, to, var_x);
112        //System.out.println("apfac  = " + apfac.toScript());
113
114        QuotientRing<AlgebraicNumber<BigRational>> qfac = new QuotientRing<AlgebraicNumber<BigRational>>(
115                apfac);
116        //System.out.println("qfac   = " + qfac.toScript());
117
118        String[] var_wx = new String[] { "wx" };
119        GenPolynomialRing<Quotient<AlgebraicNumber<BigRational>>> pqfac = new GenPolynomialRing<Quotient<AlgebraicNumber<BigRational>>>(
120                qfac, 1, to, var_wx);
121        //System.out.println("pqfac  = " + pqfac.toScript());
122
123        GenPolynomial<Quotient<AlgebraicNumber<BigRational>>> wx = pqfac.parse(" wx^2 - { x } ");
124        //System.out.println("wx     = " + wx);
125
126        AlgebraicNumberRing<Quotient<AlgebraicNumber<BigRational>>> axfac = new AlgebraicNumberRing<Quotient<AlgebraicNumber<BigRational>>>(
127                wx, true);
128        //System.out.println("axfac  = " + axfac.toScript());
129
130        String[] var_y = new String[] { "y" };
131        GenPolynomialRing<AlgebraicNumber<Quotient<AlgebraicNumber<BigRational>>>> apqfac = new GenPolynomialRing<AlgebraicNumber<Quotient<AlgebraicNumber<BigRational>>>>(
132                axfac, 1, to, var_y);
133        //System.out.println("apqfac = " + apqfac.toScript());
134
135        //  ( y^2 - x ) * ( y^2 - 2 ), need {} for recursive coefficients
136        GenPolynomial<AlgebraicNumber<Quotient<AlgebraicNumber<BigRational>>>> f;
137        f = apqfac.parse(" ( y^2 - { { x } } ) * ( y^2 - 2 )^2 ");
138        //System.out.println("f      = " + f);
139
140        FactorAbstract<AlgebraicNumber<Quotient<AlgebraicNumber<BigRational>>>> engine = FactorFactory
141                .getImplementation(axfac);
142        //System.out.println("engine = " + engine);
143
144        SortedMap<GenPolynomial<AlgebraicNumber<Quotient<AlgebraicNumber<BigRational>>>>, Long> F = engine
145                .factors(f);
146        //System.out.println("factors(f) = " + F);
147
148        assertTrue("#facs >= 4", F.size() >= 4);
149
150        boolean t = engine.isFactorization(f, F);
151        //System.out.println("t        = " + t);
152        assertTrue("prod(factor(a)) = a", t);
153    }
154
155}