Package edu.jas.ufd
Class FactorModularBerlekamp<MOD extends GcdRingElem<MOD>>
java.lang.Object
edu.jas.ufd.FactorAbstract<MOD>
edu.jas.ufd.FactorAbsolute<MOD>
edu.jas.ufd.FactorModularBerlekamp<MOD>
- All Implemented Interfaces:
Factorization<MOD>
,Serializable
Modular coefficients Berlekamp factorization algorithms. This class
implements Berlekamp, Cantor and Zassenhaus factorization methods for
polynomials over (prime) modular integers.
- See Also:
-
Field Summary
FieldsFields inherited from class edu.jas.ufd.FactorAbstract
engine, sengine
-
Constructor Summary
ConstructorsModifierConstructorDescriptionprivate
No argument constructor, do not use.FactorModularBerlekamp
(RingFactory<MOD> cfac) Constructor. -
Method Summary
Modifier and TypeMethodDescriptionGenPolynomial base factorization of a squarefree polynomial.GenPolynomial base factorization of a squarefree polynomial.GenPolynomial base factorization of a squarefree polynomial.Methods inherited from class edu.jas.ufd.FactorAbsolute
baseAlgebraicPartialFraction, baseAlgebraicPartialFractionIrreducibleAbsolute, baseFactorsAbsolute, baseFactorsAbsoluteIrreducible, baseFactorsAbsoluteSquarefree, factorsAbsolute, factorsAbsoluteIrreducible, factorsAbsoluteSquarefree, isAbsoluteFactorization, isAbsoluteFactorization, isAbsoluteFactorization, isAbsoluteIrreducible, toString
Methods inherited from class edu.jas.ufd.FactorAbstract
baseFactors, baseFactorsRadical, basePrimitivePart, factors, factorsDegree, factorsRadical, factorsRadical, factorsSquarefree, factorsSquarefreeKronecker, factorsSquarefreeOptimize, isFactorization, isFactorization, isIrreducible, isRecursiveFactorization, isReducible, isSquarefree, normalizeFactorization, primitivePart, recursiveFactors, recursiveFactorsSquarefree, removeOnce, squarefreeFactors, squarefreePart
-
Field Details
-
logger
private static final org.apache.logging.log4j.Logger logger
-
-
Constructor Details
-
FactorModularBerlekamp
private FactorModularBerlekamp()No argument constructor, do not use. -
FactorModularBerlekamp
Constructor.- Parameters:
cfac
- coefficient ring factory.
-
-
Method Details
-
baseFactorsSquarefree
GenPolynomial base factorization of a squarefree polynomial.- Specified by:
baseFactorsSquarefree
in classFactorAbstract<MOD extends GcdRingElem<MOD>>
- Parameters:
P
- squarefree and monic! GenPolynomial.- Returns:
- [p_1,...,p_k] with P = prod_{i=1,...,r} p_i.
-
baseFactorsSquarefreeSmallPrime
GenPolynomial base factorization of a squarefree polynomial. Small prime version of Berlekamps algorithm.- Parameters:
P
- squarefree and monic! GenPolynomial.- Returns:
- [p_1,...,p_k] with P = prod_{i=1,...,r} p_i.
-
baseFactorsSquarefreeBigPrime
GenPolynomial base factorization of a squarefree polynomial. Big prime version of Berlekamps algorithm.- Parameters:
P
- squarefree and monic! GenPolynomial.- Returns:
- [p_1,...,p_k] with P = prod_{i=1,...,r} p_i.
-