Examples of cc.redberry.core.transformations.factor.jasfactor.edu.jas.arith.BigInteger

Package cc.redberry.core.transformations.factor.jasfactor.edu.jas.arith

Examples of cc.redberry.core.transformations.factor.jasfactor.edu.jas.arith.BigInteger

cc.redberry.core.transformations.factor.jasfactor.edu.jas.arith.BigInteger
BigInteger class to make java.math.BigInteger available with RingElem respectively the GcdRingElem interface. Objects of this class are immutable. The SAC2 static methods are also provided. @author Heinz Kredel @see java.math.BigInteger

        if (pkfac.nvar == 2 && !HenselUtil.isDiophantLift(Ap, su, Cp)) {
        }
        if (!ckfac.equals(su.get(0).ring)) {
            throw new IllegalArgumentException("qfac != ckfac: " + su.get(0).ring + " != " + ckfac);
        }
        GenPolynomialRing<BigInteger> ifac = new GenPolynomialRing<>(new BigInteger(), pkfac);
        //GenPolynomialRing<BigInteger> cifac = new GenPolynomialRing<BigInteger>(new BigInteger(), ckfac);
        String[] mn = new String[]{pkfac.getVars()[pkfac.nvar - 1]};
        GenPolynomialRing<GenPolynomial<MOD>> qrfac = new GenPolynomialRing<>(ckfac, 1, mn);


        List<GenPolynomial<MOD>> sup = new ArrayList<>(su.size());

View Full Code Here

            xv = xv.subtract(pkfac.fromInteger(v.getSymmetricInteger().getVal()));


            long deg = Cp.degree(pkfac.nvar - 1);


            // convert to integer polynomials
            GenPolynomialRing<BigInteger> ifac = new GenPolynomialRing<>(new BigInteger(), pkfac);
            List<GenPolynomial<BigInteger>> Bi = PolyUtil.integerFromModularCoefficients(ifac, U);
            GenPolynomial<BigInteger> Ci = PolyUtil.integerFromModularCoefficients(ifac, Cp);


            // compute error:
            E = ifac.getONE();

View Full Code Here

        }
        n += (p.bitCount() + 1); // log2(p)
        n /= 2;
        v = new java.math.BigInteger("" + 2);
        v = v.shiftLeft(n);
        BigInteger N = new BigInteger(v);
        return N;
    }

View Full Code Here

class ModSymToInt<C extends RingElem<C> & Modular> implements UnaryFunctor<C, BigInteger> {




    public BigInteger eval(C c) {
        if (c == null) {
            return new BigInteger();
        }
        return c.getSymmetricInteger();
    }

View Full Code Here

    }




    public BigInteger eval(BigRational c) {
        if (c == null) {
            return new BigInteger();
        }
        // p = num*(lcm/denom)
        java.math.BigInteger b = lcm.divide(c.denominator());
        return new BigInteger(c.numerator().multiply(b));
    }

View Full Code Here

    }




    public BigInteger eval(BigRational c) {
        if (c == null) {
            return new BigInteger();
        }
        if (gcd.equals(java.math.BigInteger.ONE)) {
            // p = num*(lcm/denom)
            java.math.BigInteger b = lcm.divide(c.denominator());
            return new BigInteger(c.numerator().multiply(b));
        }
        // p = (num/gcd)*(lcm/denom)
        java.math.BigInteger a = c.numerator().divide(gcd);
        java.math.BigInteger b = lcm.divide(c.denominator());
        return new BigInteger(a.multiply(b));
    }

View Full Code Here

        GenPolynomial<MOD> f = P;
        //GreatestCommonDivisor<MOD> engine = GCDFactory.<MOD> getImplementation(pfac.coFac);
        Power<GenPolynomial<MOD>> pow = new Power<>(pfac);
        GenPolynomial<MOD> g;
        int degi = (int) deg; //f.degree(0);
        BigInteger di = Power.positivePower(new BigInteger(m), deg);
        java.math.BigInteger d = di.getVal(); //.longValue()-1;
        d = d.shiftRight(1); // divide by 2
        do {
            if (p2) {
                h = t;
                for (int i = 1; i < degi; i++) {

View Full Code Here

        List<GenPolynomial<BigInteger>> dem = null;
        if (A == null) {
            return dem;
        }


        BigInteger cfac = new BigInteger();
        GenPolynomialRing<BigInteger> ufac
                = new GenPolynomialRing<>(cfac, 1);


        int nvar = A.numberOfVariables();
        dem = new ArrayList<>(nvar);

View Full Code Here

    static Tensor poly2Tensor(GenPolynomial<BigInteger> poly, Var[] varsArray) {
        if (poly.length() == 0)
            return Complex.ZERO;
        List<Tensor> temp = new ArrayList<>(), sum = new ArrayList<>(poly.length());
        long lExp;
        BigInteger coefficient;
        ExpVector exp;
        for (Monomial<BigInteger> monomial : poly) {
            coefficient = monomial.coefficient();
            exp = monomial.exponent();
            temp.clear();


            temp.add(new Complex(new Rational(coefficient.getVal())));
            for (int i = 0; i < exp.length(); ++i)
                if ((lExp = exp.getVal(i)) != 0)
                    temp.add(Tensors.pow(varsArray[i].simpleTensor, new Complex(lExp)));


            sum.add(Tensors.multiply(temp.toArray(new Tensor[temp.size()])));

View Full Code Here

            // case AlgebraicNumber<ModInteger>: r = c**(p**(d-1)), r**p == c
            long d = aCoFac.totalExtensionDegree();
            if (d <= 1) {
                return r;
            }
            BigInteger p = new BigInteger(aCoFac.characteristic());
            BigInteger q = Power.positivePower(p, d - 1);
            r = Power.positivePower(r, q.getVal());
            return r;
        }
        if (qCoFac != null) {
            throw new UnsupportedOperationException("case QuotientRing not yet implemented");
        }

View Full Code Here

0 1 2 3

TOP

Related Classes of cc.redberry.core.transformations.factor.jasfactor.edu.jas.arith.BigInteger

cc.redberry.core.groups.permutations.PermutationGroup

cc.redberry.core.transformations.factor.JasFactor

cc.redberry.core.transformations.factor.jasfactor.edu.jas.poly.ModSymToInt

cc.redberry.core.transformations.factor.jasfactor.edu.jas.poly.PolyUtil

cc.redberry.core.transformations.factor.jasfactor.edu.jas.poly.RatToInt

cc.redberry.core.transformations.factor.jasfactor.edu.jas.poly.RatToIntFactor

cc.redberry.core.transformations.factor.jasfactor.edu.jas.poly.TermOrderOptimization

cc.redberry.core.transformations.factor.jasfactor.edu.jas.ufd.FactorModular

cc.redberry.core.transformations.factor.jasfactor.edu.jas.ufd.FactorRational

cc.redberry.core.transformations.factor.jasfactor.edu.jas.ufd.HenselMultUtil

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.