Documentation of 'edu.jas.gb.SolvableGroebnerBaseAbstract' Java class
SolvableGroebnerBaseAbstract
edu.jas.gb

Class SolvableGroebnerBaseAbstract<C extends RingElem<C>>

    • Constructor Detail

      • SolvableGroebnerBaseAbstract

        public SolvableGroebnerBaseAbstract()
        Constructor.
      • SolvableGroebnerBaseAbstract

        public SolvableGroebnerBaseAbstract(SolvableReduction<C> sred)
        Constructor.
        Parameters:
        sred - Solvable reduction engine
      • SolvableGroebnerBaseAbstract

        public SolvableGroebnerBaseAbstract(SolvableReduction<C> sred,
                                            PairList<C> pl)
        Constructor.
        Parameters:
        sred - Solvable reduction engine
        pl - pair selection strategy
    • Method Detail

      • isLeftGB

        public boolean isLeftGB(java.util.List<GenSolvablePolynomial<C>> F,
                                boolean b)
        Left Groebner base test.
        Parameters:
        F - solvable polynomial list.
        b - true for simple test, false for GB test.
        Returns:
        true, if F is a Groebner base, else false.
      • isLeftGB

        public boolean isLeftGB(int modv,
                                java.util.List<GenSolvablePolynomial<C>> F)
        Left Groebner base test.
        Specified by:
        isLeftGB in interface SolvableGroebnerBase<C extends RingElem<C>>
        Parameters:
        modv - module variable number.
        F - solvable polynomial list.
        Returns:
        true, if F is a Groebner base, else false.
      • isLeftGB

        public boolean isLeftGB(int modv,
                                java.util.List<GenSolvablePolynomial<C>> F,
                                boolean b)
        Left Groebner base test.
        Parameters:
        modv - module variable number.
        F - solvable polynomial list.
        b - true for simple test, false for GB test.
        Returns:
        true, if F is a Groebner base, else false.
      • isLeftGBsimple

        public boolean isLeftGBsimple(int modv,
                                      java.util.List<GenSolvablePolynomial<C>> F)
        Left Groebner base test.
        Parameters:
        modv - number of module variables.
        F - solvable polynomial list.
        Returns:
        true, if F is a left Groebner base, else false.
      • isLeftGBidem

        public boolean isLeftGBidem(int modv,
                                    java.util.List<GenSolvablePolynomial<C>> F)
        Left Groebner base idempotence test.
        Parameters:
        modv - module variable number.
        F - solvable polynomial list.
        Returns:
        true, if F is equal to GB(F), else false.
      • isTwosidedGB

        public boolean isTwosidedGB(int modv,
                                    java.util.List<GenSolvablePolynomial<C>> Fp)
        Twosided Groebner base test.
        Specified by:
        isTwosidedGB in interface SolvableGroebnerBase<C extends RingElem<C>>
        Parameters:
        modv - number of module variables.
        Fp - solvable polynomial list.
        Returns:
        true, if Fp is a two-sided Groebner base, else false.
      • isTwosidedGBidem

        public boolean isTwosidedGBidem(java.util.List<GenSolvablePolynomial<C>> F)
        Twosided Groebner base idempotence test.
        Parameters:
        F - solvable polynomial list.
        Returns:
        true, if F is equal to GB(F), else false.
      • isTwosidedGBidem

        public boolean isTwosidedGBidem(int modv,
                                        java.util.List<GenSolvablePolynomial<C>> F)
        Twosided Groebner base idempotence test.
        Parameters:
        modv - module variable number.
        F - solvable polynomial list.
        Returns:
        true, if F is equal to GB(F), else false.
      • isRightGB

        public boolean isRightGB(int modv,
                                 java.util.List<GenSolvablePolynomial<C>> F)
        Right Groebner base test.
        Specified by:
        isRightGB in interface SolvableGroebnerBase<C extends RingElem<C>>
        Parameters:
        modv - number of module variables.
        F - solvable polynomial list.
        Returns:
        true, if F is a right Groebner base, else false.
      • isRightGBidem

        public boolean isRightGBidem(java.util.List<GenSolvablePolynomial<C>> F)
        Right Groebner base idempotence test.
        Parameters:
        F - solvable polynomial list.
        Returns:
        true, if F is equal to GB(F), else false.
      • isRightGBidem

        public boolean isRightGBidem(int modv,
                                     java.util.List<GenSolvablePolynomial<C>> F)
        Right Groebner base idempotence test.
        Parameters:
        modv - module variable number.
        F - solvable polynomial list.
        Returns:
        true, if F is equal to GB(F), else false.
      • commonZeroTest

        public int commonZeroTest(java.util.List<GenSolvablePolynomial<C>> A)
        Ideal common zero test.
        Returns:
        -1, 0 or 1 if dimension(this) &eq; -1, 0 or ≥ 1.
      • univariateDegrees

        public java.util.List<java.lang.Long> univariateDegrees(java.util.List<GenSolvablePolynomial<C>> A)
        Univariate head term degrees.
        Parameters:
        A - list of solvable polynomials.
        Returns:
        a list of the degrees of univariate head terms.
      • constructUnivariate

        public GenSolvablePolynomial<C> constructUnivariate(int i,
                                                            java.util.List<GenSolvablePolynomial<C>> G)
        Construct univariate solvable polynomial of minimal degree in variable i of a zero dimensional ideal(G).
        Parameters:
        i - variable index.
        G - list of solvable polynomials, a monic reduced left Gröbner base of a zero dimensional ideal.
        Returns:
        univariate solvable polynomial of minimal degree in variable i in ideal_left(G)
      • constructUnivariate

        public java.util.List<GenSolvablePolynomial<C>> constructUnivariate(java.util.List<GenSolvablePolynomial<C>> G)
        Construct univariate solvable polynomials of minimal degree in all variables in zero dimensional left ideal(G).
        Returns:
        list of univariate polynomial of minimal degree in each variable in ideal_left(G)
      • terminate

        public void terminate()
        Cleanup and terminate ThreadPool.
      • cancel

        public int cancel()
        Cancel ThreadPool.

DMelt 3.0 © DataMelt by jWork.ORG

You see the box below because you did not login.