| Package | Description |
|---|---|
| cc.redberry.rings.poly | |
| cc.redberry.rings.poly.multivar | |
| cc.redberry.rings.poly.univar |
| Modifier and Type | Method and Description |
|---|---|
PolynomialFactorDecomposition<Poly> |
PolynomialFactorDecomposition.addAll(FactorDecomposition<Poly> other) |
PolynomialFactorDecomposition<Poly> |
PolynomialFactorDecomposition.addFactor(Poly factor,
int exponent) |
PolynomialFactorDecomposition<Poly> |
PolynomialFactorDecomposition.addUnit(Poly unit) |
PolynomialFactorDecomposition<Poly> |
PolynomialFactorDecomposition.canonical() |
PolynomialFactorDecomposition<Poly> |
PolynomialFactorDecomposition.clone() |
static <Poly extends IPolynomial<Poly>> |
PolynomialFactorDecomposition.empty(Poly factory)
Empty factorization
|
PolynomialFactorDecomposition<Poly> |
UnivariateRing.factor(Poly element) |
PolynomialFactorDecomposition<Poly> |
MultivariateRing.factor(Poly element) |
static <Poly extends IPolynomial<Poly>> |
PolynomialMethods.Factor(Poly poly)
Factor polynomial.
|
PolynomialFactorDecomposition<Poly> |
UnivariateRing.factorSquareFree(Poly element) |
PolynomialFactorDecomposition<Poly> |
MultivariateRing.factorSquareFree(Poly element) |
static <Poly extends IPolynomial<Poly>> |
PolynomialMethods.FactorSquareFree(Poly poly)
Square-free factorization of polynomial.
|
<OthPoly extends IPolynomial<OthPoly>> |
PolynomialFactorDecomposition.mapTo(Function<Poly,OthPoly> mapper) |
PolynomialFactorDecomposition<Poly> |
PolynomialFactorDecomposition.monic()
Makes each factor monic (moving leading coefficients to the
unit(Poly)) |
static <Poly extends IPolynomial<Poly>> |
PolynomialFactorDecomposition.of(Collection<Poly> factors)
Factor decomposition with specified factors and exponents
|
static <Poly extends IPolynomial<Poly>> |
PolynomialFactorDecomposition.of(Poly... factors)
Factor decomposition with specified factors and exponents
|
static <Poly extends IPolynomial<Poly>> |
PolynomialFactorDecomposition.of(Poly a) |
static <Poly extends IPolynomial<Poly>> |
PolynomialFactorDecomposition.of(Poly unit,
List<Poly> factors,
gnu.trove.list.array.TIntArrayList exponents)
Factor decomposition with specified factors and exponents
|
static <Poly extends IPolynomial<Poly>> |
PolynomialFactorDecomposition.of(Poly a,
Poly b) |
static <Poly extends IPolynomial<Poly>> |
PolynomialFactorDecomposition.of(Poly a,
Poly b,
Poly c) |
PolynomialFactorDecomposition<Poly> |
PolynomialFactorDecomposition.primitive()
Makes each factor primitive (moving contents to the
unit(Poly)) |
PolynomialFactorDecomposition<Poly> |
PolynomialFactorDecomposition.reduceUnitContent()
Calls
monic() if the coefficient ring is field and primitive() otherwise |
PolynomialFactorDecomposition<Poly> |
PolynomialFactorDecomposition.setLcFrom(Poly poly)
Makes the lead coefficient of this factorization equal to the l.c.
|
PolynomialFactorDecomposition<Poly> |
PolynomialFactorDecomposition.setUnit(Poly unit) |
static <Poly extends IPolynomial<Poly>> |
PolynomialFactorDecomposition.unit(Poly unit)
Unit factorization
|
| Modifier and Type | Method and Description |
|---|---|
static <Poly extends AMultivariatePolynomial<?,Poly>> |
MultivariateFactorization.Factor(Poly poly)
Factors multivariate polynomial
|
static <Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
MultivariateFactorization.FactorInGF(Poly polynomial)
Factors multivariate polynomial over finite field
|
static PolynomialFactorDecomposition<MultivariatePolynomial<UnivariatePolynomial<Rational<BigInteger>>>> |
MultivariateFactorization.FactorInNumberField(MultivariatePolynomial<UnivariatePolynomial<Rational<BigInteger>>> polynomial)
Factors multivariate polynomial over simple number field via Trager's algorithm
|
static <E> PolynomialFactorDecomposition<MultivariatePolynomial<Rational<E>>> |
MultivariateFactorization.FactorInQ(MultivariatePolynomial<Rational<E>> polynomial)
Factors multivariate polynomial over Q
|
static PolynomialFactorDecomposition<MultivariatePolynomial<BigInteger>> |
MultivariateFactorization.FactorInZ(MultivariatePolynomial<BigInteger> polynomial)
Factors multivariate polynomial over Z
|
static <Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
MultivariateSquareFreeFactorization.SquareFreeFactorization(Poly poly)
Performs square-free factorization of a {@code poly.
|
static <Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
MultivariateSquareFreeFactorization.SquareFreeFactorizationMusser(Poly poly)
Performs square-free factorization of a
poly which coefficient ring has any characteristic using Musser's
algorithm. |
static <Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
MultivariateSquareFreeFactorization.SquareFreeFactorizationMusserZeroCharacteristics(Poly poly)
Performs square-free factorization of a
poly which coefficient ring has zero characteristic using
Musser's algorithm. |
static <Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
MultivariateSquareFreeFactorization.SquareFreeFactorizationYunZeroCharacteristics(Poly poly)
Performs square-free factorization of a
poly which coefficient ring has zero characteristic using Yun's
algorithm. |
| Modifier and Type | Method and Description |
|---|---|
static <Poly extends IUnivariatePolynomial<Poly>> |
EqualDegreeFactorization.CantorZassenhaus(Poly input,
int d)
Plain Cantor-Zassenhaus algorithm implementation
|
static <Poly extends IUnivariatePolynomial<Poly>> |
DistinctDegreeFactorization.DistinctDegreeFactorization(Poly poly)
Performs distinct-degree factorization for square-free polynomial
poly. |
static PolynomialFactorDecomposition<UnivariatePolynomialZp64> |
DistinctDegreeFactorization.DistinctDegreeFactorization(UnivariatePolynomialZp64 poly)
Performs distinct-degree factorization for square-free polynomial
poly. |
static PolynomialFactorDecomposition<UnivariatePolynomialZp64> |
DistinctDegreeFactorization.DistinctDegreeFactorizationPlain(UnivariatePolynomialZp64 poly)
Performs distinct-degree factorization for square-free polynomial
poly using plain incremental exponents
algorithm. |
static PolynomialFactorDecomposition<UnivariatePolynomialZp64> |
DistinctDegreeFactorization.DistinctDegreeFactorizationPrecomputedExponents(UnivariatePolynomialZp64 poly)
Performs distinct-degree factorization for square-free polynomial
poly using plain incremental exponents
algorithm with precomputed exponents. |
static <Poly extends IUnivariatePolynomial<Poly>> |
DistinctDegreeFactorization.DistinctDegreeFactorizationShoup(Poly poly)
Performs distinct-degree factorization for square-free polynomial
poly using Victor Shoup's baby step /
giant step algorithm. |
static <Poly extends IUnivariatePolynomial<Poly>> |
UnivariateFactorization.Factor(Poly poly)
Factors univariate
poly. |
static <Poly extends IUnivariatePolynomial<Poly>> |
UnivariateFactorization.FactorInGF(Poly poly)
Factors polynomial over finite field
|
static PolynomialFactorDecomposition<UnivariatePolynomial<UnivariatePolynomial<Rational<BigInteger>>>> |
UnivariateFactorization.FactorInNumberField(UnivariatePolynomial<UnivariatePolynomial<Rational<BigInteger>>> poly)
Factors polynomial in Q(alpha)[x] via Trager's algorithm
|
static <E> PolynomialFactorDecomposition<UnivariatePolynomial<Rational<E>>> |
UnivariateFactorization.FactorInQ(UnivariatePolynomial<Rational<E>> poly)
Factors polynomial over Q
|
static <Poly extends IUnivariatePolynomial<Poly>> |
UnivariateFactorization.FactorInZ(Poly poly)
Factors polynomial in Z[x].
|
static <T extends IUnivariatePolynomial<T>> |
UnivariateFactorization.FactorSquareFreeInGF(T poly)
Factors square-free polynomial over finite field
|
static PolynomialFactorDecomposition<UnivariatePolynomial<UnivariatePolynomial<Rational<BigInteger>>>> |
UnivariateFactorization.FactorSquareFreeInNumberField(UnivariatePolynomial<UnivariatePolynomial<Rational<BigInteger>>> poly)
Factors polynomial in Q(alpha)[x] via Trager's algorithm
|
static <PolyZ extends IUnivariatePolynomial<PolyZ>> |
UnivariateFactorization.FactorSquareFreeInZ(PolyZ poly) |
static <T extends IUnivariatePolynomial<T>> |
UnivariateSquareFreeFactorization.SquareFreeFactorization(T poly)
Performs square-free factorization of a
poly. |
static <Poly extends IUnivariatePolynomial<Poly>> |
UnivariateSquareFreeFactorization.SquareFreeFactorizationMusser(Poly poly)
Performs square-free factorization of a
poly using Musser's algorithm (both zero and non-zero
characteristic of coefficient ring allowed). |
static <Poly extends IUnivariatePolynomial<Poly>> |
UnivariateSquareFreeFactorization.SquareFreeFactorizationMusserZeroCharacteristics(Poly poly)
Performs square-free factorization of a poly which coefficient ring has zero characteristic using Musser's
algorithm.
|
static <Poly extends IUnivariatePolynomial<Poly>> |
UnivariateSquareFreeFactorization.SquareFreeFactorizationYunZeroCharacteristics(Poly poly)
Performs square-free factorization of a
poly which coefficient ring has zero characteristic using Yun's
algorithm. |
Copyright © 2022. All rights reserved.