Package edu.jas.ufd
Class FactorModularBerlekamp<MOD extends GcdRingElem<MOD>>
- java.lang.Object
-
- edu.jas.ufd.FactorAbstract<C>
-
- edu.jas.ufd.FactorAbsolute<MOD>
-
- edu.jas.ufd.FactorModularBerlekamp<MOD>
-
- All Implemented Interfaces:
Factorization<MOD>
,java.io.Serializable
public class FactorModularBerlekamp<MOD extends GcdRingElem<MOD>> extends FactorAbsolute<MOD>
Modular coefficients Berlekamp factorization algorithms. This class implements Berlekamp, Cantor and Zassenhaus factorization methods for polynomials over (prime) modular integers.- Author:
- Heinz Kredel
- See Also:
- Serialized Form
-
-
Field Summary
-
Fields inherited from class edu.jas.ufd.FactorAbstract
engine, sengine
-
-
Constructor Summary
Constructors Constructor Description FactorModularBerlekamp(RingFactory<MOD> cfac)
Constructor.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description java.util.List<GenPolynomial<MOD>>
baseFactorsSquarefree(GenPolynomial<MOD> P)
GenPolynomial base factorization of a squarefree polynomial.java.util.List<GenPolynomial<MOD>>
baseFactorsSquarefreeBigPrime(GenPolynomial<MOD> P)
GenPolynomial base factorization of a squarefree polynomial.java.util.List<GenPolynomial<MOD>>
baseFactorsSquarefreeSmallPrime(GenPolynomial<MOD> P)
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, squarefreeFactors, squarefreePart
-
-
-
-
Constructor Detail
-
FactorModularBerlekamp
public FactorModularBerlekamp(RingFactory<MOD> cfac)
Constructor.- Parameters:
cfac
- coefficient ring factory.
-
-
Method Detail
-
baseFactorsSquarefree
public java.util.List<GenPolynomial<MOD>> baseFactorsSquarefree(GenPolynomial<MOD> P)
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
public java.util.List<GenPolynomial<MOD>> baseFactorsSquarefreeSmallPrime(GenPolynomial<MOD> P)
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
public java.util.List<GenPolynomial<MOD>> baseFactorsSquarefreeBigPrime(GenPolynomial<MOD> P)
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.
-
-