Class FactorAlgebraicPrim<C extends GcdRingElem<C>>

Type Parameters:
C - coefficient type
All Implemented Interfaces:
Factorization<AlgebraicNumber<C>>, Serializable

public class FactorAlgebraicPrim<C extends GcdRingElem<C>> extends FactorAbsolute<AlgebraicNumber<C>>
Algebraic number coefficients factorization algorithms. This class implements factorization methods for polynomials over algebraic numbers over rational numbers or over (prime) modular integers. The algorithm uses zero dimensional ideal prime decomposition.
See Also:
  • Field Details

    • logger

      private static final org.apache.logging.log4j.Logger logger
    • factorCoeff

      public final FactorAbstract<C extends GcdRingElem<C>> factorCoeff
      Factorization engine for base coefficients.
  • Constructor Details

    • FactorAlgebraicPrim

      protected FactorAlgebraicPrim()
      No argument constructor. Note: can't use this constructor.
    • FactorAlgebraicPrim

      public FactorAlgebraicPrim(AlgebraicNumberRing<C> fac)
      Constructor.
      Parameters:
      fac - algebraic number factory.
    • FactorAlgebraicPrim

      public FactorAlgebraicPrim(AlgebraicNumberRing<C> fac, FactorAbstract<C> factorCoeff)
      Constructor.
      Parameters:
      fac - algebraic number factory.
      factorCoeff - factorization engine for polynomials over base coefficients.
  • Method Details