Package | Description |
---|---|
cc.redberry.rings | |
cc.redberry.rings.poly | |
cc.redberry.rings.poly.multivar | |
cc.redberry.rings.poly.univar |
Modifier and Type | Method and Description |
---|---|
static <E> MultivariateRing<MultivariatePolynomial<E>> |
Rings.MultivariateRing(int nVariables,
Ring<E> coefficientRing,
Comparator<DegreeVector> monomialOrder)
Ring of multivariate polynomials with specified number of variables over specified coefficient ring
|
static MultivariateRing<MultivariatePolynomialZp64> |
Rings.MultivariateRingZp64(int nVariables,
IntegersZp64 modulus,
Comparator<DegreeVector> monomialOrder)
Ring of multivariate polynomials over Zp integers (Zp[x1, x2, ...])
|
static MultivariateRing<MultivariatePolynomialZp64> |
Rings.MultivariateRingZp64(int nVariables,
long modulus,
Comparator<DegreeVector> monomialOrder)
Ring of multivariate polynomials over Zp integers (Zp[x1, x2, ...])
|
Modifier and Type | Method and Description |
---|---|
Comparator<DegreeVector> |
MultivariateRing.ordering() |
Modifier and Type | Method and Description |
---|---|
Poly |
MultivariateRing.create(DegreeVector term)
Creates multivariate polynomial over the same ring as this with the single monomial
|
Modifier and Type | Class and Description |
---|---|
class |
AMonomial<Term extends AMonomial<Term>>
Abstract monomial (degree vector + coefficient).
|
class |
Monomial<E>
Monomial with coefficient from generic ring
|
class |
MonomialZp64
Monomial with coefficient from Zp with p < 2^64
|
Modifier and Type | Field and Description |
---|---|
static Comparator<DegreeVector> |
MonomialOrder.ALEX
Antilexicographic monomial order.
|
static Comparator<DegreeVector> |
MonomialOrder.DEFAULT
Default monomial order (GREVLEX)
|
static Comparator<DegreeVector> |
MonomialOrder.GREVLEX
Graded reverse lexicographic monomial order
|
static Comparator<DegreeVector> |
MonomialOrder.GRLEX
Graded lexicographic monomial order.
|
static Comparator<DegreeVector> |
MonomialOrder.LEX
Lexicographic monomial order.
|
Comparator<DegreeVector> |
Ideal.ordering
monomial order used for standard basis
|
Comparator<DegreeVector> |
AMultivariatePolynomial.ordering
The ordering
|
Modifier and Type | Method and Description |
---|---|
DegreeVector |
DegreeVector.dv() |
DegreeVector |
AMonomial.dv()
Drop the coefficient
|
DegreeVector |
DegreeVector.dvDivideExact(DegreeVector divider)
Gives quotient
this / oth or throws ArithmeticException if exact division is not possible (e.g. |
DegreeVector |
DegreeVector.dvDivideExact(int[] divider)
Gives quotient
this / oth or throws ArithmeticException if exact division is not possible (e.g. |
DegreeVector |
DegreeVector.dvDivideOrNull(DegreeVector divider)
Gives quotient
this / oth or null if exact division is not possible (e.g. |
DegreeVector |
DegreeVector.dvDivideOrNull(int[] divider)
Gives quotient
this / oth or null if exact division is not possible (e.g. |
DegreeVector |
DegreeVector.dvDivideOrNull(int variable,
int exponent)
Divides this by variable^exponent
|
DegreeVector |
DegreeVector.dvDropSelect(int[] variables)
Picks only specified exponents
|
DegreeVector |
DegreeVector.dvInsert(int variable)
Inserts new variable
|
DegreeVector |
DegreeVector.dvInsert(int variable,
int count)
Inserts new variables
|
DegreeVector |
DegreeVector.dvJoinNewVariable()
Joins new variable (with zero exponent) to degree vector
|
DegreeVector |
DegreeVector.dvJoinNewVariables(int n)
Joins new variables (with zero exponents) to degree vector
|
DegreeVector |
DegreeVector.dvJoinNewVariables(int newNVariables,
int[] mapping)
internal API
|
DegreeVector |
DegreeVector.dvMap(int nVariables,
int[] mapping)
Creates degree vector with old variables renamed to specified mapping variables
|
DegreeVector |
DegreeVector.dvMultiply(DegreeVector oth)
Multiplies this by oth
|
DegreeVector |
DegreeVector.dvMultiply(int[] oth)
Multiplies this by oth
|
DegreeVector |
DegreeVector.dvMultiply(int variable,
int exponent)
Multiplies this by variable^exponent
|
DegreeVector |
DegreeVector.dvRange(int from,
int to)
Selects range from this
|
DegreeVector |
DegreeVector.dvSelect(int var)
Sets exponents of all variables except the specified variable to zero
|
DegreeVector |
DegreeVector.dvSelect(int[] variables)
Set's exponents of all variables except specified variables to zero
|
DegreeVector |
DegreeVector.dvSet(int variable,
int exponent)
Set's exponent of specified variable to specified value
|
DegreeVector |
DegreeVector.dvSetNVariables(int n)
Sets the number of variables
|
DegreeVector |
DegreeVector.dvSetZero(int var)
Set exponent of specified
var to zero |
DegreeVector |
DegreeVector.dvSetZero(int[] variables)
Set exponents of specified variables to zero
|
DegreeVector |
DegreeVector.dvWithout(int variable)
Drops specified variable (number of variables will be reduced)
|
DegreeVector |
DegreeVector.dvWithout(int[] variables)
Drops specified variables (number of variables will be reduced)
|
Modifier and Type | Method and Description |
---|---|
Comparator<DegreeVector> |
Ideal.getMonomialOrder()
The monomial order used for Groebner basis
|
Set<DegreeVector> |
AMultivariatePolynomial.getSkeleton()
Returns skeleton of this poly
|
Set<DegreeVector> |
AMultivariatePolynomial.getSkeleton(int... variables)
Returns skeleton of this poly with respect to specified
variables |
Set<DegreeVector> |
AMultivariatePolynomial.getSkeletonDrop(int... variables)
Returns skeleton of this poly with respect to specified
variables |
Set<DegreeVector> |
AMultivariatePolynomial.getSkeletonExcept(int... variables)
Returns skeleton of this poly with respect to all except specified
variables |
static List<DegreeVector> |
GroebnerBases.leadTermsSet(List<? extends AMultivariatePolynomial> ideal)
List of lead terms of generators
|
static <Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
GroebnerBases.optimalOrder(List<Poly> ideal)
Deduce the optimal order for GB algorithms
|
static Comparator<DegreeVector> |
MonomialOrder.product(Comparator<DegreeVector>[] orderings,
int[] nVariables)
Block product of orderings
|
static Comparator<DegreeVector> |
MonomialOrder.product(Comparator<DegreeVector> a,
int anVariables,
Comparator<DegreeVector> b,
int bnVariable)
Block product of orderings
|
Modifier and Type | Method and Description |
---|---|
int |
MonomialOrder.GrevLexWithPermutation.compare(DegreeVector a,
DegreeVector b) |
int |
MonomialOrder.EliminationOrder.compare(DegreeVector o1,
DegreeVector o2) |
Term |
IMonomialAlgebra.create(DegreeVector degreeVector)
creates term with specified exponents and unit coefficient
|
MonomialZp64 |
IMonomialAlgebra.MonomialAlgebraZp64.create(DegreeVector degreeVector) |
Monomial<E> |
IMonomialAlgebra.MonomialAlgebra.create(DegreeVector degreeVector) |
Poly |
AMultivariatePolynomial.create(DegreeVector term)
Creates multivariate polynomial over the same ring as this with the single monomial
|
Poly |
AMultivariatePolynomial.divideDegreeVectorOrNull(DegreeVector monomial)
Divides this polynomial by a
monomial or returns null (causing loss of internal data) if some of
the elements can't be exactly divided by the monomial . |
default Term |
IMonomialAlgebra.divideExact(DegreeVector dividend,
Term divider)
Gives quotient
dividend / divider or throws ArithmeticException if exact division is not
possible |
Term |
AMonomial.divideOrNull(DegreeVector divider)
Gives quotient
this / oth or null if exact division is not possible (e.g. |
DegreeVector |
DegreeVector.dvDivideExact(DegreeVector divider)
Gives quotient
this / oth or throws ArithmeticException if exact division is not possible (e.g. |
DegreeVector |
DegreeVector.dvDivideOrNull(DegreeVector divider)
Gives quotient
this / oth or null if exact division is not possible (e.g. |
boolean |
DegreeVector.dvDivisibleBy(DegreeVector oth)
Tests whether this can be divided by
oth degree vector |
boolean |
DegreeVector.dvEquals(DegreeVector dVector) |
DegreeVector |
DegreeVector.dvMultiply(DegreeVector oth)
Multiplies this by oth
|
Term |
AMonomial.multiply(DegreeVector oth)
Multiplies this by oth
|
Poly |
AMultivariatePolynomial.multiplyByDegreeVector(DegreeVector dv)
Multiplies
this by the degree vector |
abstract Term |
AMonomial.setDegreeVector(DegreeVector oth)
Sets the degree vector
|
MonomialZp64 |
MonomialZp64.setDegreeVector(DegreeVector oth) |
Monomial<E> |
Monomial.setDegreeVector(DegreeVector oth) |
Modifier and Type | Method and Description |
---|---|
static <Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
AMultivariatePolynomial.asMultivariate(IUnivariatePolynomial poly,
int nVariables,
int variable,
Comparator<DegreeVector> ordering)
Converts univariate polynomial to multivariate.
|
static <E> MultivariatePolynomial<E> |
MultivariatePolynomial.asMultivariate(UnivariatePolynomial<E> poly,
int nVariables,
int variable,
Comparator<DegreeVector> ordering)
Converts univariate polynomial to multivariate.
|
static MultivariatePolynomialZp64 |
MultivariatePolynomialZp64.asMultivariate(UnivariatePolynomialZp64 poly,
int nVariables,
int variable,
Comparator<DegreeVector> ordering)
Converts univariate polynomial to multivariate.
|
MultivariatePolynomial<MultivariatePolynomial<E>> |
MultivariatePolynomial.asOverMultivariateEliminate(int[] variables,
Comparator<DegreeVector> ordering) |
MultivariatePolynomial<MultivariatePolynomialZp64> |
MultivariatePolynomialZp64.asOverMultivariateEliminate(int[] variables,
Comparator<DegreeVector> ordering) |
abstract MultivariatePolynomial<Poly> |
AMultivariatePolynomial.asOverMultivariateEliminate(int[] variables,
Comparator<DegreeVector> prdering)
Converts this to a multivariate polynomial with coefficients being multivariate polynomials polynomials over
variables that is polynomial in R[variables][other_variables] |
static <Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
GroebnerBases.BuchbergerGB(List<Poly> generators,
Comparator<DegreeVector> monomialOrder)
Computes minimized and reduced Groebner basis of a given ideal via Buchberger algorithm.
|
static <Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
GroebnerBases.BuchbergerGB(List<Poly> generators,
Comparator<DegreeVector> monomialOrder,
Comparator<GroebnerBases.SyzygyPair> strategy)
Computes minimized and reduced Groebner basis of a given ideal via Buchberger algorithm.
|
Ideal<Term,Poly> |
Ideal.changeOrder(Comparator<DegreeVector> newMonomialOrder)
Set the monomial order used for Groebner basis of this ideal
|
static <Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
GroebnerBases.ConvertBasis(List<Poly> generators,
Comparator<DegreeVector> desiredOrder)
Converts basis into a basis for desired monomial order
|
static MultivariatePolynomialZp64 |
MultivariatePolynomialZp64.create(int nVariables,
IntegersZp64 ring,
Comparator<DegreeVector> ordering,
Iterable<MonomialZp64> terms)
Creates multivariate polynomial from a list of monomial terms
|
static MultivariatePolynomialZp64 |
MultivariatePolynomialZp64.create(int nVariables,
IntegersZp64 ring,
Comparator<DegreeVector> ordering,
MonomialSet<MonomialZp64> terms)
Creates multivariate polynomial from a set of monomials
|
static MultivariatePolynomialZp64 |
MultivariatePolynomialZp64.create(int nVariables,
IntegersZp64 ring,
Comparator<DegreeVector> ordering,
MonomialZp64... terms)
Creates multivariate polynomial from a list of monomial terms
|
static <E> MultivariatePolynomial<E> |
MultivariatePolynomial.create(int nVariables,
Ring<E> ring,
Comparator<DegreeVector> ordering,
Iterable<Monomial<E>> terms)
Creates multivariate polynomial from a list of monomial terms
|
static <E> MultivariatePolynomial<E> |
MultivariatePolynomial.create(int nVariables,
Ring<E> ring,
Comparator<DegreeVector> ordering,
Monomial<E>... terms)
Creates multivariate polynomial from a list of monomial terms
|
static <Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
Ideal.create(List<Poly> generators,
Comparator<DegreeVector> monomialOrder)
Creates ideal given by a list of generators.
|
static Comparator<GroebnerBases.SyzygyPair> |
GroebnerBases.defaultSelectionStrategy(Comparator<DegreeVector> monomialOrder)
Default selection strategy (with or without sugar)
|
static <Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
Ideal.empty(Poly factory,
Comparator<DegreeVector> monomialOrder)
Creates empty ideal
|
static <Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
GroebnerBases.F4GB(List<Poly> generators,
Comparator<DegreeVector> monomialOrder)
Computes minimized and reduced Groebner basis of a given ideal via Faugère's F4 F4 algorithm.
|
static MultivariatePolynomialZp64 |
MultivariatePolynomialZp64.fromDenseRecursiveForm(IUnivariatePolynomial recForm,
Comparator<DegreeVector> ordering)
Converts poly from a recursive univariate representation.
|
static MultivariatePolynomialZp64 |
MultivariatePolynomialZp64.fromDenseRecursiveForm(IUnivariatePolynomial recForm,
int nVariables,
Comparator<DegreeVector> ordering)
Converts poly from a recursive univariate representation.
|
static <E> MultivariatePolynomial<E> |
MultivariatePolynomial.fromDenseRecursiveForm(UnivariatePolynomial recForm,
int nVariables,
Comparator<DegreeVector> ordering)
Converts poly from a recursive univariate representation.
|
static MultivariatePolynomialZp64 |
MultivariatePolynomialZp64.fromSparseRecursiveForm(AMultivariatePolynomial recForm,
Comparator<DegreeVector> ordering)
Converts poly from a sparse recursive univariate representation.
|
static MultivariatePolynomialZp64 |
MultivariatePolynomialZp64.fromSparseRecursiveForm(AMultivariatePolynomial recForm,
int nVariables,
Comparator<DegreeVector> ordering)
Converts poly from a recursive univariate representation.
|
static <E> MultivariatePolynomial<E> |
MultivariatePolynomial.fromSparseRecursiveForm(AMultivariatePolynomial recForm,
int nVariables,
Comparator<DegreeVector> ordering)
Converts poly from a recursive univariate representation.
|
static <Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
GroebnerBases.GroebnerBasis(List<Poly> generators,
Comparator<DegreeVector> monomialOrder)
Computes Groebner basis (minimized and reduced) of a given ideal represented by a list of generators.
|
static <Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
GroebnerBases.GroebnerBasisInGF(List<Poly> generators,
Comparator<DegreeVector> monomialOrder,
GroebnerBases.HilbertSeries hilbertSeries)
Computes Groebner basis (minimized and reduced) of a given ideal over finite filed represented by a list of
generators.
|
static List<MultivariatePolynomial<Rational<BigInteger>>> |
GroebnerBases.GroebnerBasisInQ(List<MultivariatePolynomial<Rational<BigInteger>>> generators,
Comparator<DegreeVector> monomialOrder,
GroebnerBases.HilbertSeries hilbertSeries,
boolean tryModular)
Computes Groebner basis (minimized and reduced) of a given ideal over Q represented by a list of generators.
|
static cc.redberry.rings.poly.multivar.GroebnerBases.GBResult<Monomial<BigInteger>,MultivariatePolynomial<BigInteger>> |
GroebnerBases.GroebnerBasisInZ(List<MultivariatePolynomial<BigInteger>> generators,
Comparator<DegreeVector> monomialOrder,
GroebnerBases.HilbertSeries hilbertSeries,
boolean tryModular)
Computes Groebner basis (minimized and reduced) of a given ideal over Z represented by a list of generators.
|
static <Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
GroebnerBases.HilbertConvertBasis(List<Poly> groebnerBasis,
Comparator<DegreeVector> desiredOrdering)
Converts Groebner basis to a given monomial order using Hilbert-driven algorithm
|
static <Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
GroebnerBases.HilbertGB(List<Poly> generators,
Comparator<DegreeVector> monomialOrder)
Hilbert-driven algorithm for Groebner basis computation
|
static <Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
GroebnerBases.HilbertGB(List<Poly> generators,
Comparator<DegreeVector> monomialOrder,
cc.redberry.rings.poly.multivar.GroebnerBases.GroebnerAlgorithm<Term,Poly> baseAlgorithm)
Hilbert-driven algorithm for Groebner basis computation.
|
static <Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
GroebnerBases.HilbertGB(List<Poly> generators,
Comparator<DegreeVector> monomialOrder,
GroebnerBases.HilbertSeries hilbertSeries)
Hilbert-driven algorithm for Groebner basis computation
|
static GroebnerBases.HilbertSeries |
GroebnerBases.HilbertSeries(List<DegreeVector> ideal)
Computes Hilbert-Poincare series of monomial ideal
|
static boolean |
MonomialOrder.isGradedOrder(Comparator<DegreeVector> monomialOrder)
whether monomial order is graded
|
static <Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
GroebnerBases.isGroebnerBasis(List<Poly> ideal,
List<Poly> generators,
Comparator<DegreeVector> monomialOrder)
Check whether specified generators form Groebner basis of given ideal
|
E |
MultivariatePolynomial.lc(Comparator<DegreeVector> ordering)
Returns the leading coefficient of this polynomial with respect to specified ordering
|
long |
MultivariatePolynomialZp64.lc(Comparator<DegreeVector> ordering)
Returns the leading coefficient of this polynomial with respect to specified ordering
|
MultivariatePolynomial<E> |
MultivariatePolynomial.lcAsPoly(Comparator<DegreeVector> ordering) |
MultivariatePolynomialZp64 |
MultivariatePolynomialZp64.lcAsPoly(Comparator<DegreeVector> ordering) |
abstract Poly |
AMultivariatePolynomial.lcAsPoly(Comparator<DegreeVector> ordering)
Returns the leading coefficient with respect to specified ordering as a constant poly
|
Term |
AMultivariatePolynomial.lt(Comparator<DegreeVector> ordering)
Returns the leading term in this polynomial according to specified ordering
|
static cc.redberry.rings.poly.multivar.GroebnerBases.GBResult<Monomial<BigInteger>,MultivariatePolynomial<BigInteger>> |
GroebnerBases.ModularGB(List<MultivariatePolynomial<BigInteger>> ideal,
Comparator<DegreeVector> monomialOrder)
Modular Groebner basis algorithm.
|
static cc.redberry.rings.poly.multivar.GroebnerBases.GBResult<Monomial<BigInteger>,MultivariatePolynomial<BigInteger>> |
GroebnerBases.ModularGB(List<MultivariatePolynomial<BigInteger>> ideal,
Comparator<DegreeVector> monomialOrder,
cc.redberry.rings.poly.multivar.GroebnerBases.GroebnerAlgorithm modularAlgorithm,
cc.redberry.rings.poly.multivar.GroebnerBases.GroebnerAlgorithm defaultAlgorithm,
BigInteger firstPrime,
GroebnerBases.HilbertSeries hilbertSeries,
boolean trySparse)
Modular Groebner basis algorithm.
|
static cc.redberry.rings.poly.multivar.GroebnerBases.GBResult<Monomial<BigInteger>,MultivariatePolynomial<BigInteger>> |
GroebnerBases.ModularGB(List<MultivariatePolynomial<BigInteger>> ideal,
Comparator<DegreeVector> monomialOrder,
GroebnerBases.HilbertSeries hilbertSeries)
Modular Groebner basis algorithm.
|
static cc.redberry.rings.poly.multivar.GroebnerBases.GBResult<Monomial<BigInteger>,MultivariatePolynomial<BigInteger>> |
GroebnerBases.ModularGB(List<MultivariatePolynomial<BigInteger>> ideal,
Comparator<DegreeVector> monomialOrder,
GroebnerBases.HilbertSeries hilbertSeries,
boolean trySparse)
Modular Groebner basis algorithm.
|
MultivariatePolynomial<E> |
MultivariatePolynomial.monic(Comparator<DegreeVector> ordering) |
MultivariatePolynomialZp64 |
MultivariatePolynomialZp64.monic(Comparator<DegreeVector> ordering) |
abstract Poly |
AMultivariatePolynomial.monic(Comparator<DegreeVector> ordering)
Make this poly monic considering leading term with respect to given ordering
|
MultivariatePolynomial<E> |
MultivariatePolynomial.monic(Comparator<DegreeVector> ordering,
E factor)
Sets
this to its monic part (with respect to given ordering) multiplied by the given factor; |
MultivariatePolynomialZp64 |
MultivariatePolynomialZp64.monic(Comparator<DegreeVector> ordering,
long factor)
Sets
this to its monic part (with respect to given ordering) multiplied by the given factor; |
MultivariatePolynomial<E> |
MultivariatePolynomial.monicWithLC(Comparator<DegreeVector> ordering,
MultivariatePolynomial<E> other) |
MultivariatePolynomialZp64 |
MultivariatePolynomialZp64.monicWithLC(Comparator<DegreeVector> ordering,
MultivariatePolynomialZp64 other) |
abstract Poly |
AMultivariatePolynomial.monicWithLC(Comparator<DegreeVector> ordering,
Poly oth)
Sets
this to its monic part multiplied by the leading coefficient of other with respect to given
ordering |
static Comparator<GroebnerBases.SyzygyPair> |
GroebnerBases.normalSelectionStrategy(Comparator<DegreeVector> monomialOrder)
Normal selection strategy: chose syzygy with the less lcm(fi.lt(), fj.lt()) with respect to monomialOrder
|
static MultivariatePolynomialZp64 |
MultivariatePolynomialZp64.one(int nVariables,
IntegersZp64 ring,
Comparator<DegreeVector> ordering)
Creates unit polynomial.
|
static <E> MultivariatePolynomial<E> |
MultivariatePolynomial.one(int nVariables,
Ring<E> ring,
Comparator<DegreeVector> ordering)
Creates unit polynomial.
|
static <E> Ideal<Monomial<E>,MultivariatePolynomial<E>> |
Ideal.parse(String[] generators,
Ring<E> field,
Comparator<DegreeVector> monomialOrder,
String[] variables)
Shortcut for parse
|
static MultivariatePolynomial<BigInteger> |
MultivariatePolynomial.parse(String string,
Comparator<DegreeVector> ordering)
Deprecated.
use #parse(string, ring, ordering, variables)
|
static MultivariatePolynomial<BigInteger> |
MultivariatePolynomial.parse(String string,
Comparator<DegreeVector> ordering,
String... variables)
Parse multivariate Z[X] polynomial from string.
|
static MultivariatePolynomialZp64 |
MultivariatePolynomialZp64.parse(String string,
IntegersZp64 ring,
Comparator<DegreeVector> ordering)
Deprecated.
use #parse(string, ring, ordering, variables)
|
static MultivariatePolynomialZp64 |
MultivariatePolynomialZp64.parse(String string,
IntegersZp64 ring,
Comparator<DegreeVector> ordering,
String... variables)
Parse multivariate polynomial from string.
|
static <E> MultivariatePolynomial<E> |
MultivariatePolynomial.parse(String string,
Ring<E> ring,
Comparator<DegreeVector> ordering)
Deprecated.
use #parse(string, ring, ordering, variables)
|
static <E> MultivariatePolynomial<E> |
MultivariatePolynomial.parse(String string,
Ring<E> ring,
Comparator<DegreeVector> ordering,
String... variables)
Parse multivariate polynomial from string.
|
static Comparator<DegreeVector> |
MonomialOrder.product(Comparator<DegreeVector> a,
int anVariables,
Comparator<DegreeVector> b,
int bnVariable)
Block product of orderings
|
static Comparator<DegreeVector> |
MonomialOrder.product(Comparator<DegreeVector> a,
int anVariables,
Comparator<DegreeVector> b,
int bnVariable)
Block product of orderings
|
static MultivariatePolynomial<BigInteger> |
RandomMultivariatePolynomials.randomPolynomial(int nVars,
int degree,
int size,
BigInteger bound,
Comparator<DegreeVector> ordering,
org.apache.commons.math3.random.RandomGenerator rnd)
Generates random Z[X] polynomial with coefficients bounded by
bound |
static MultivariatePolynomialZp64 |
RandomMultivariatePolynomials.randomPolynomial(int nVars,
int degree,
int size,
IntegersZp64 ring,
Comparator<DegreeVector> ordering,
org.apache.commons.math3.random.RandomGenerator rnd)
Generates random Zp[X] polynomial over machine integers
|
static <E> MultivariatePolynomial<E> |
RandomMultivariatePolynomials.randomPolynomial(int nVars,
int minDegree,
int maxDegree,
int size,
Ring<E> ring,
Comparator<DegreeVector> ordering,
Function<org.apache.commons.math3.random.RandomGenerator,E> method,
org.apache.commons.math3.random.RandomGenerator rnd)
Generates random polynomial
|
static <E> MultivariatePolynomial<E> |
RandomMultivariatePolynomials.randomPolynomial(int nVars,
int degree,
int size,
Ring<E> ring,
Comparator<DegreeVector> ordering,
Function<org.apache.commons.math3.random.RandomGenerator,E> method,
org.apache.commons.math3.random.RandomGenerator rnd)
Generates random polynomial
|
static <E> MultivariatePolynomial<E> |
RandomMultivariatePolynomials.randomPolynomial(int nVars,
int degree,
int size,
Ring<E> ring,
Comparator<DegreeVector> ordering,
org.apache.commons.math3.random.RandomGenerator rnd)
Generates random polynomial
|
static MultivariatePolynomialZp64 |
RandomMultivariatePolynomials.randomSharpPolynomial(int nVars,
int degree,
int size,
IntegersZp64 ring,
Comparator<DegreeVector> ordering,
org.apache.commons.math3.random.RandomGenerator rnd)
Generates random Zp[X] polynomial over machine integers
|
static <E> MultivariatePolynomial<E> |
RandomMultivariatePolynomials.randomSharpPolynomial(int nVars,
int degree,
int size,
Ring<E> ring,
Comparator<DegreeVector> ordering,
Function<org.apache.commons.math3.random.RandomGenerator,E> rndCoefficients,
org.apache.commons.math3.random.RandomGenerator rnd)
Generates random Zp[X] polynomial over machine integers
|
static <T extends AMonomial<T>,P extends AMultivariatePolynomial<T,P>> |
AMultivariatePolynomial.renameVariables(P poly,
int[] newVariables,
Comparator<DegreeVector> newOrdering)
Rename variables from [0,1,...N] to [newVariables[0], newVariables[1], ..., newVariables[N]] (new instance
created)
|
Poly |
AMultivariatePolynomial.setOrdering(Comparator<DegreeVector> newOrdering)
Makes a copy of this with the new ordering
newOrdering |
static <Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
GroebnerBases.solveGB(List<Poly> generators,
List<Collection<DegreeVector>> gbSkeleton,
Comparator<DegreeVector> monomialOrder)
Sparse Groebner basis via "linear lifting".
|
static <Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
GroebnerBases.solveGB(List<Poly> generators,
List<Collection<DegreeVector>> gbSkeleton,
Comparator<DegreeVector> monomialOrder)
Sparse Groebner basis via "linear lifting".
|
static <Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
Ideal.trivial(Poly factory,
Comparator<DegreeVector> monomialOrder)
Creates trivial ideal (ideal = ring)
|
static MultivariatePolynomialZp64 |
MultivariatePolynomialZp64.zero(int nVariables,
IntegersZp64 ring,
Comparator<DegreeVector> ordering)
Creates zero polynomial.
|
static <E> MultivariatePolynomial<E> |
MultivariatePolynomial.zero(int nVariables,
Ring<E> ring,
Comparator<DegreeVector> ordering)
Creates zero polynomial.
|
Constructor and Description |
---|
AMonomial(DegreeVector degreeVector) |
Monomial(DegreeVector degreeVector,
E coefficient) |
MonomialZp64(DegreeVector degreeVector,
long coefficient) |
Constructor and Description |
---|
EliminationOrder(Comparator<DegreeVector> baseOrder,
int variable) |
MonomialSet(Comparator<? super DegreeVector> comparator) |
MonomialSet(SortedMap<DegreeVector,? extends Term> m)
Constructs a new monomial set containing the same mappings and using the same ordering as the specified sorted
map.
|
Modifier and Type | Method and Description |
---|---|
MultivariatePolynomialZp64 |
UnivariatePolynomialZp64.asMultivariate(Comparator<DegreeVector> ordering) |
AMultivariatePolynomial |
IUnivariatePolynomial.asMultivariate(Comparator<DegreeVector> ordering)
Convert to multivariate polynomial
|
MultivariatePolynomial<E> |
UnivariatePolynomial.asMultivariate(Comparator<DegreeVector> ordering) |
AMultivariatePolynomial |
UnivariatePolynomialZ64.asMultivariate(Comparator<DegreeVector> ordering) |
Copyright © 2018. All rights reserved.