Uses of Class
edu.jas.poly.GenPolynomial

Packages that use GenPolynomial

Package	Description
edu.jas.application	Groebner base application package.
edu.jas.fd	Factorization domain package for solvable polynomial rings.
edu.jas.gb	Groebner bases package.
edu.jas.gbmod	Module Groebner base package.
edu.jas.gbufd	Groebner bases using unique factorization package.
edu.jas.integrate	Elementary Integration package.
edu.jas.poly	Generic coefficients polynomial package.
edu.jas.ps	Generic coefficients power series package.
edu.jas.root	Real and Complex Root Computation package.
edu.jas.ufd	Unique factorization domain package.
edu.jas.ufdroot	Unique Factorization Domain and Roots package.

Uses of GenPolynomial in edu.jas.application

Subclasses of GenPolynomial in edu.jas.application

Modifier and Type	Class	Description
class	LocalSolvablePolynomial<C extends GcdRingElem<C>>	LocalSolvablePolynomial generic recursive solvable polynomials implementing RingElem.
class	ResidueSolvablePolynomial<C extends GcdRingElem<C>>	ResidueSolvablePolynomial generic solvable polynomials with solvable residue coefficients implementing RingElem.
class	ResidueSolvableWordPolynomial<C extends GcdRingElem<C>>	ResidueSolvableWordPolynomial solvable polynomials with WordResidue coefficients implementing RingElem.

Classes in edu.jas.application that implement interfaces with type arguments of type GenPolynomial

Modifier and Type	Class	Description
(package private) class	EvaluateToComplexReal<C extends GcdRingElem<C> & Rational>	Polynomial coefficient to complex real algebriac evaluation functor.
class	Local<C extends GcdRingElem<C>>	Local ring element based on GenPolynomial with RingElem interface.
class	LocalRing<C extends GcdRingElem<C>>	Local ring class based on GenPolynomial with RingElem interface.
class	SolvableLocal<C extends GcdRingElem<C>>	SolvableLocal ring element based on pairs of GenSolvablePolynomial with GcdRingElem interface.
class	SolvableLocalResidue<C extends GcdRingElem<C>>	SolvableLocalResidue, that is a (left) rational function, based on pairs of GenSolvablePolynomial with GcdRingElem interface.
class	SolvableLocalResidueRing<C extends GcdRingElem<C>>	SolvableLocalResidue ring factory for SolvableLocalResidue based on GenSolvablePolynomial with GcdRingElem interface.
class	SolvableLocalRing<C extends GcdRingElem<C>>	SolvableLocal ring factory for SolvableLocal with GcdRingElem interface.
class	SolvableResidue<C extends GcdRingElem<C>>	SolvableResidue ring element based on GenSolvablePolynomial with GcdRingElem interface.
class	SolvableResidue<C extends GcdRingElem<C>>	SolvableResidue ring element based on GenSolvablePolynomial with GcdRingElem interface.
class	SolvableResidueRing<C extends GcdRingElem<C>>	SolvableResidue ring factory based on GenSolvablePolynomialRing with GcdRingFactory interface.
class	SolvableResidueRing<C extends GcdRingElem<C>>	SolvableResidue ring factory based on GenSolvablePolynomialRing with GcdRingFactory interface.

Fields in edu.jas.application declared as GenPolynomial

Modifier and Type	Field	Description
protected final GenPolynomial<C>	Local.den	Denominator part of the element data structure.
final GenPolynomial<GenPolynomial<C>>	ColorPolynomial.green	The part with green (= zero) terms and coefficients.
protected final GenPolynomial<C>	Local.num	Numerator part of the element data structure.
final GenPolynomial<GenPolynomial<C>>	ColorPolynomial.red	The part with red (= non zero) terms and coefficients.
(package private) GenPolynomial<BigInteger>	IntegerProgram.S
final GenPolynomial<C>	Residue.val	Value part of the element data structure.
final GenPolynomial<GenPolynomial<C>>	ColorPolynomial.white	The part with white (= unknown color) terms and coefficients.

Fields in edu.jas.application with type parameters of type GenPolynomial

Modifier and Type	Field	Description
protected PolynomialList<GenPolynomial<C>>	GroebnerSystem.cgb	Comprehensive Groebner base for this Groebner system.
final GenPolynomial<GenPolynomial<C>>	ColorPolynomial.green	The part with green (= zero) terms and coefficients.
final List<GenPolynomial<C>>	IdealWithUniv.others	A list of other useful polynomials.
final GenPolynomial<GenPolynomial<C>>	ColorPolynomial.red	The part with red (= non zero) terms and coefficients.
protected final GenPolynomialRing<GenPolynomial<C>>	OrderedCPairlist.ring
final List<GenPolynomial<C>>	IdealWithUniv.upolys	The list of univariate polynomials.
final GenPolynomial<GenPolynomial<C>>	ColorPolynomial.white	The part with white (= unknown color) terms and coefficients.

Methods in edu.jas.application that return GenPolynomial

Modifier and Type	Method	Description
GenPolynomial<C>	Ideal.constructUnivariate(int i)	Construct univariate polynomial of minimal degree in variable i in zero dimensional ideal(G).
(package private) static <C extends RingElem<C>> GenPolynomial<C>	PolyUtilApp.convert(GenPolynomialRing<C> fac, GenPolynomial<C> p)
(package private) static <C extends RingElem<C>> GenPolynomial<Complex<C>>	PolyUtilApp.convertComplex(GenPolynomialRing<Complex<C>> fac, GenPolynomial<C> p)
(package private) static <C extends RingElem<C>> GenPolynomial<Complex<C>>	PolyUtilApp.convertComplexComplex(GenPolynomialRing<Complex<C>> fac, GenPolynomial<Complex<C>> p)
static <C extends GcdRingElem<C> & Rational> GenPolynomial<Complex<RealAlgebraicNumber<C>>>	PolyUtilApp.convertToComplexRealCoefficients(GenPolynomialRing<Complex<RealAlgebraicNumber<C>>> pfac, GenPolynomial<Complex<C>> A)	Convert to Complex<RealAlgebraicNumber> coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<AlgebraicNumber<C>>	PolyUtilApp.convertToPrimitiveElem(AlgebraicNumberRing<C> cfac, AlgebraicNumber<C> A, AlgebraicNumber<C> B, GenPolynomial<AlgebraicNumber<AlgebraicNumber<C>>> a)	Convert to primitive element ring.
static <C extends GcdRingElem<C>> GenPolynomial<AlgebraicNumber<C>>	PolyUtilApp.convertToPrimitiveElem(AlgebraicNumberRing<C> cfac, AlgebraicNumber<C> A, GenPolynomial<AlgebraicNumber<C>> a)	Convert coefficients to primitive element ring.
GenPolynomial<C>	Local.denominator()	Denominator.
static <C extends GcdRingElem<C> & Rational> GenPolynomial<Complex<RealAlgebraicNumber<C>>>	PolyUtilApp.evaluateToComplexRealCoefficients(GenPolynomialRing<Complex<RealAlgebraicNumber<C>>> pfac, GenPolynomial<GenPolynomial<Complex<C>>> A, Complex<RealAlgebraicNumber<C>> r)	Evaluate to Complex<RealAlgebraicNumber> coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtilApp.fromProduct(GenPolynomialRing<GenPolynomial<C>> pfac, GenPolynomial<Product<Residue<C>>> P, int i)	From product representation.
GenPolynomial<GenPolynomial<C>>	ColorPolynomial.getEssentialPolynomial()	Get essential polynomial.
GenPolynomial<GenPolynomial<C>>	ColorPolynomial.getPolynomial()	Get full polynomial.
GenPolynomial<C>	Ideal.inverse(GenPolynomial<C> h)	Inverse for element modulo this ideal.
GenPolynomial<C>	Ideal.normalform(GenPolynomial<C> h)	Normalform for element.
GenPolynomial<C>	Local.numerator()	Numerator.
static <C extends GcdRingElem<C> & Rational> GenPolynomial<RealAlgebraicNumber<C>>	PolyUtilApp.realAlgFromRealCoefficients(GenPolynomialRing<RealAlgebraicNumber<C>> afac, GenPolynomial<RealAlgebraicNumber<C>> A)	Convert to RealAlgebraicNumber coefficients.
static <C extends GcdRingElem<C> & Rational> GenPolynomial<RealAlgebraicNumber<C>>	PolyUtilApp.realFromRealAlgCoefficients(GenPolynomialRing<RealAlgebraicNumber<C>> rfac, GenPolynomial<RealAlgebraicNumber<C>> A)	Convert to RealAlgebraicNumber coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<Product<Residue<C>>>	PolyUtilApp.toProductRes(GenPolynomialRing<Product<Residue<C>>> pfac, GenPolynomial<GenPolynomial<C>> A)	Product representation.
static <C extends GcdRingElem<C>> GenPolynomial<Residue<C>>	PolyUtilApp.toResidue(GenPolynomialRing<Residue<C>> pfac, GenPolynomial<GenPolynomial<C>> A)	Residue coefficient representation.

Methods in edu.jas.application that return types with arguments of type GenPolynomial

Modifier and Type	Method	Description
List<GenPolynomial<AlgebraicNumber<C>>>	FactorAlgebraicPrim.baseFactorsSquarefree(GenPolynomial<AlgebraicNumber<C>> P)	GenPolynomial base factorization of a squarefree polynomial.
List<GenPolynomial<RealAlgebraicNumber<C>>>	FactorRealReal.baseFactorsSquarefree(GenPolynomial<RealAlgebraicNumber<C>> P)	GenPolynomial base factorization of a squarefree polynomial.
List<GenPolynomial<C>>	Ideal.constructUnivariate()	Construct univariate polynomials of minimal degree in all variables in zero dimensional ideal(G).
static <C extends GcdRingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtilApp.fromProduct(GenPolynomialRing<GenPolynomial<C>> pfac, GenPolynomial<Product<Residue<C>>> P, int i)	From product representation.
static <C extends GcdRingElem<C>> List<GenPolynomial<GenPolynomial<C>>>	PolyUtilApp.fromProduct(GenPolynomialRing<GenPolynomial<C>> pfac, List<GenPolynomial<Product<Residue<C>>>> L, int i)	From product representation.
static <C extends GcdRingElem<C>> List<GenPolynomial<GenPolynomial<C>>>	PolyUtilApp.fromProduct(GenPolynomialRing<GenPolynomial<C>> pfac, List<GenPolynomial<Product<Residue<C>>>> L, int i)	From product representation.
List<GenPolynomial<GenPolynomial<C>>>	ComprehensiveGroebnerBaseSeq.GB(List<GenPolynomial<GenPolynomial<C>>> F)	Comprehensive Groebner base via Groebner system.
List<GenPolynomial<GenPolynomial<C>>>	ComprehensiveGroebnerBaseSeq.GB(List<GenPolynomial<GenPolynomial<C>>> F)	Comprehensive Groebner base via Groebner system.
List<GenPolynomial<GenPolynomial<C>>>	GroebnerSystem.getCGB()	Get comprehensive Groebner base.
List<GenPolynomial<GenPolynomial<C>>>	GroebnerSystem.getCGB()	Get comprehensive Groebner base.
List<GenPolynomial<C>>	ColoredSystem.getConditionNonZero()	Get non zero condition.
List<GenPolynomial<C>>	ColoredSystem.getConditionZero()	Get zero condition.
GenPolynomial<GenPolynomial<C>>	ColorPolynomial.getEssentialPolynomial()	Get essential polynomial.
List<GenPolynomial<GenPolynomial<C>>>	ColoredSystem.getEssentialPolynomialList()	Get list of essential polynomials.
List<GenPolynomial<GenPolynomial<C>>>	ColoredSystem.getEssentialPolynomialList()	Get list of essential polynomials.
static List<GenPolynomial<BigRational>>	ExamplesGeoTheorems.getExample()	get Pappus Example.
List<GenPolynomial<C>>	ColoredSystem.getGreenCoefficients()	Get list of green coefficients of polynomials.
List<GenPolynomial<C>>	ColorPolynomial.getGreenCoefficients()	Get zero condition on coefficients.
List<GenPolynomial<C>>	Ideal.getList()	Get the List of GenPolynomials.
GenPolynomial<GenPolynomial<C>>	ColorPolynomial.getPolynomial()	Get full polynomial.
List<GenPolynomial<GenPolynomial<C>>>	ColoredSystem.getPolynomialList()	Get list of full polynomials.
List<GenPolynomial<GenPolynomial<C>>>	ColoredSystem.getPolynomialList()	Get list of full polynomials.
List<GenPolynomial<C>>	ColoredSystem.getRedCoefficients()	Get list of red coefficients of polynomials.
List<GenPolynomial<C>>	ColorPolynomial.getRedCoefficients()	Get non zero condition on coefficients.
Map.Entry<ExpVector, GenPolynomial<C>>	ColorPolynomial.leadingMonomial()	Get leading monomial.
List<GenPolynomial<C>>	Ideal.normalform(List<GenPolynomial<C>> L)	Normalform for list of elements.
static <C extends GcdRingElem<C>> Map<Ideal<C>, PolynomialList<GenPolynomial<C>>>	PolyUtilApp.productSlice(PolynomialList<Product<Residue<C>>> L)	Product slice.
static <C extends GcdRingElem<C>> PolynomialList<GenPolynomial<C>>	PolyUtilApp.productSlice(PolynomialList<Product<Residue<C>>> L, int i)	Product slice at i.
static <C extends GcdRingElem<C>> List<GenPolynomial<Product<Residue<C>>>>	PolyUtilApp.toProductRes(GenPolynomialRing<Product<Residue<C>>> pfac, List<GenPolynomial<GenPolynomial<C>>> L)	Product representation.
static <C extends GcdRingElem<C>> List<GenPolynomial<Product<Residue<C>>>>	PolyUtilApp.toProductRes(List<ColoredSystem<C>> CS)	Product residue representation.
static <C extends GcdRingElem<C>> List<GenPolynomial<Residue<C>>>	PolyUtilApp.toResidue(GenPolynomialRing<Residue<C>> pfac, List<GenPolynomial<GenPolynomial<C>>> L)	Residue coefficient representation.

Methods in edu.jas.application with parameters of type GenPolynomial

Modifier and Type	Method	Description
Ideal<C>	Ideal.annihilator(GenPolynomial<C> h)	Annihilator for element modulo this ideal.
List<GenPolynomial<AlgebraicNumber<C>>>	FactorAlgebraicPrim.baseFactorsSquarefree(GenPolynomial<AlgebraicNumber<C>> P)	GenPolynomial base factorization of a squarefree polynomial.
List<GenPolynomial<RealAlgebraicNumber<C>>>	FactorRealReal.baseFactorsSquarefree(GenPolynomial<RealAlgebraicNumber<C>> P)	GenPolynomial base factorization of a squarefree polynomial.
List<Condition<C>>	CReductionSeq.caseDistinction(Condition<C> cond, GenPolynomial<GenPolynomial<C>> A)	Case distinction conditions of parametric polynomial list.
List<Condition<C>>	CReductionSeq.caseDistinction(List<Condition<C>> cd, GenPolynomial<GenPolynomial<C>> A)	Case distinction conditions of parametric polynomial list.
Condition.Color	Condition.color(GenPolynomial<C> c)	Determine color of polynomial.
static <C extends GcdRingElem<C> & Rational> List<Complex<RealAlgebraicNumber<C>>>	RootFactoryApp.complexAlgebraicNumbersComplex(GenPolynomial<Complex<C>> f)	Complex algebraic number roots.
static <C extends GcdRingElem<C> & Rational> List<Complex<RealAlgebraicNumber<C>>>	RootFactoryApp.complexAlgebraicNumbersSquarefree(GenPolynomial<Complex<C>> f)	Complex algebraic number roots.
boolean	Ideal.contains(GenPolynomial<C> b)	Ideal containment.
(package private) static <C extends RingElem<C>> GenPolynomial<C>	PolyUtilApp.convert(GenPolynomialRing<C> fac, GenPolynomial<C> p)
(package private) static <C extends RingElem<C>> GenPolynomial<Complex<C>>	PolyUtilApp.convertComplex(GenPolynomialRing<Complex<C>> fac, GenPolynomial<C> p)
(package private) static <C extends RingElem<C>> GenPolynomial<Complex<C>>	PolyUtilApp.convertComplexComplex(GenPolynomialRing<Complex<C>> fac, GenPolynomial<Complex<C>> p)
static <C extends GcdRingElem<C> & Rational> GenPolynomial<Complex<RealAlgebraicNumber<C>>>	PolyUtilApp.convertToComplexRealCoefficients(GenPolynomialRing<Complex<RealAlgebraicNumber<C>>> pfac, GenPolynomial<Complex<C>> A)	Convert to Complex<RealAlgebraicNumber> coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<AlgebraicNumber<C>>	PolyUtilApp.convertToPrimitiveElem(AlgebraicNumberRing<C> cfac, AlgebraicNumber<C> A, AlgebraicNumber<C> B, GenPolynomial<AlgebraicNumber<AlgebraicNumber<C>>> a)	Convert to primitive element ring.
static <C extends GcdRingElem<C>> GenPolynomial<AlgebraicNumber<C>>	PolyUtilApp.convertToPrimitiveElem(AlgebraicNumberRing<C> cfac, AlgebraicNumber<C> A, GenPolynomial<AlgebraicNumber<C>> a)	Convert coefficients to primitive element ring.
Local<C>	LocalRing.create(GenPolynomial<C> n)	Create from numerator.
Local<C>	LocalRing.create(GenPolynomial<C> n, GenPolynomial<C> d)	Create from numerator, denominator pair.
SolvableLocalResidue<C>	SolvableLocalResidueRing.create(GenPolynomial<C> n)	Create from numerator.
SolvableLocalResidue<C>	SolvableLocalResidueRing.create(GenPolynomial<C> n, GenPolynomial<C> d)	Create from numerator, denominator pair.
SolvableLocal<C>	SolvableLocalRing.create(GenPolynomial<C> n)	Create from numerator.
SolvableLocal<C>	SolvableLocalRing.create(GenPolynomial<C> n, GenPolynomial<C> d)	Create from numerator, denominator pair.
SolvableResidue<C>	SolvableResidueRing.create(GenPolynomial<C> n)	Create from numerator.
SolvableResidue<C>	SolvableResidueRing.create(GenPolynomial<C> n, GenPolynomial<C> d)	Create from numerator, denominator pair.
ColorPolynomial<C>	Condition.determine(GenPolynomial<GenPolynomial<C>> A)	Determine polynomial.
ColorPolynomial<C>	ColorPolynomial.divide(GenPolynomial<C> s)	ColorPolynomial division by coefficient.
Complex<RealAlgebraicNumber<C>>	EvaluateToComplexReal.eval(GenPolynomial<Complex<C>> c)
static <C extends GcdRingElem<C> & Rational> GenPolynomial<Complex<RealAlgebraicNumber<C>>>	PolyUtilApp.evaluateToComplexRealCoefficients(GenPolynomialRing<Complex<RealAlgebraicNumber<C>>> pfac, GenPolynomial<GenPolynomial<Complex<C>>> A, Complex<RealAlgebraicNumber<C>> r)	Evaluate to Complex<RealAlgebraicNumber> coefficients.
Condition<C>	Condition.extendNonZero(GenPolynomial<C> nz)	Extend condition with non-zero polynomial.
Condition<C>	Condition.extendZero(GenPolynomial<C> z)	Extend condition with zero polynomial.
static <C extends GcdRingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtilApp.fromProduct(GenPolynomialRing<GenPolynomial<C>> pfac, GenPolynomial<Product<Residue<C>>> P, int i)	From product representation.
Ideal<C>	Ideal.infiniteQuotient(GenPolynomial<C> h)	Infinite quotient.
int	Ideal.infiniteQuotientExponent(GenPolynomial<C> h, Ideal<C> Q)	Infinite quotient exponent.
Ideal<C>	Ideal.infiniteQuotientOld(GenPolynomial<C> h)	Infinite quotient.
Ideal<C>	Ideal.infiniteQuotientRab(GenPolynomial<C> h)	Infinite quotient.
GenPolynomial<C>	Ideal.inverse(GenPolynomial<C> h)	Inverse for element modulo this ideal.
boolean	Ideal.isAnnihilator(GenPolynomial<C> h, Ideal<C> A)	Test for annihilator of element modulo this ideal.
boolean	Ideal.isRadicalMember(GenPolynomial<C> h)	Radical membership test.
static <C extends GcdRingElem<C> & Rational> boolean	RootFactoryApp.isRoot(GenPolynomial<Complex<C>> f, Complex<RealAlgebraicNumber<C>> r)	Is complex algebraic number a root of a polynomial.
static <C extends GcdRingElem<C> & Rational> boolean	RootFactoryApp.isRoot(GenPolynomial<Complex<C>> f, List<Complex<RealAlgebraicNumber<C>>> R)	Is complex algebraic number a root of a polynomial.
static <C extends GcdRingElem<C> & Rational> boolean	RootFactoryApp.isRootRealCoeff(GenPolynomial<C> f, Complex<RealAlgebraicNumber<C>> r)	Is complex algebraic number a root of a polynomial.
boolean	Ideal.isUnit(GenPolynomial<C> h)	Test if element is a unit modulo this ideal.
ColorPolynomial<C>	ColorPolynomial.multiply(GenPolynomial<C> s)	ColorPolynomial multiplication by coefficient.
ColorPolynomial<C>	ColorPolynomial.multiply(GenPolynomial<C> s, ExpVector e)	ColorPolynomial multiplication by monomial.
Local<C>	Local.multiply(GenPolynomial<C> b)	Local multiplication by GenPolynomial.
GenPolynomial<C>	Ideal.normalform(GenPolynomial<C> h)	Normalform for element.
Ideal<C>	Ideal.product(GenPolynomial<C> b)	Product.
Ideal<C>	Ideal.quotient(GenPolynomial<C> h)	Quotient.
static <C extends GcdRingElem<C> & Rational> GenPolynomial<RealAlgebraicNumber<C>>	PolyUtilApp.realAlgFromRealCoefficients(GenPolynomialRing<RealAlgebraicNumber<C>> afac, GenPolynomial<RealAlgebraicNumber<C>> A)	Convert to RealAlgebraicNumber coefficients.
static <C extends GcdRingElem<C> & Rational> GenPolynomial<RealAlgebraicNumber<C>>	PolyUtilApp.realFromRealAlgCoefficients(GenPolynomialRing<RealAlgebraicNumber<C>> rfac, GenPolynomial<RealAlgebraicNumber<C>> A)	Convert to RealAlgebraicNumber coefficients.
static <C extends GcdRingElem<C> & Rational> AlgebraicRootsPrimElem<C>	RootFactoryApp.rootReduce(GenPolynomial<C> a, GenPolynomial<C> b)	Root reduce of real and complex algebraic numbers.
ColorPolynomial<C>	ColorPolynomial.subtract(GenPolynomial<C> s, ExpVector e)	ColorPolynomial subtract.
ColorPolynomial<C>	ColorPolynomial.sum(GenPolynomial<C> s, ExpVector e)	ColorPolynomial summation.
Ideal<C>	Ideal.sum(GenPolynomial<C> b)	Summation.
RecSolvablePolynomial<C>	LocalSolvablePolynomialRing.toPolyCoefficients(GenPolynomial<SolvableLocal<C>> A)	Integral function from rational polynomial coefficients.
RecSolvablePolynomial<C>	ResidueSolvablePolynomialRing.toPolyCoefficients(GenPolynomial<SolvableResidue<C>> A)	Integral function from solvable residue coefficients.
RecSolvableWordPolynomial<C>	ResidueSolvableWordPolynomialRing.toPolyCoefficients(GenPolynomial<WordResidue<C>> A)	Integral word function from word residue coefficients.
static <C extends GcdRingElem<C>> Product<Residue<C>>	PolyUtilApp.toProductRes(ProductRing<Residue<C>> pfac, GenPolynomial<C> c)	Product representation.
static <C extends GcdRingElem<C>> GenPolynomial<Product<Residue<C>>>	PolyUtilApp.toProductRes(GenPolynomialRing<Product<Residue<C>>> pfac, GenPolynomial<GenPolynomial<C>> A)	Product representation.
static <C extends GcdRingElem<C>> GenPolynomial<Residue<C>>	PolyUtilApp.toResidue(GenPolynomialRing<Residue<C>> pfac, GenPolynomial<GenPolynomial<C>> A)	Residue coefficient representation.

Method parameters in edu.jas.application with type arguments of type GenPolynomial

Modifier and Type	Method	Description
List<Condition<C>>	CReductionSeq.caseDistinction(Condition<C> cond, GenPolynomial<GenPolynomial<C>> A)	Case distinction conditions of parametric polynomial list.
List<Condition<C>>	CReductionSeq.caseDistinction(List<Condition<C>> cd, GenPolynomial<GenPolynomial<C>> A)	Case distinction conditions of parametric polynomial list.
List<Condition<C>>	CReductionSeq.caseDistinction(List<GenPolynomial<GenPolynomial<C>>> L)	Case distinction conditions of parametric polynomial list.
List<Condition<C>>	CReductionSeq.caseDistinction(List<GenPolynomial<GenPolynomial<C>>> L)	Case distinction conditions of parametric polynomial list.
static <D extends GcdRingElem<D> & Rational> List<List<Complex<BigDecimal>>>	PolyUtilApp.complexRoots(Ideal<D> I, List<GenPolynomial<D>> univs, BigRational eps)	Construct superset of complex roots for zero dimensional ideal(G).
boolean	Ideal.contains(List<GenPolynomial<C>> B)	Ideal containment.
protected boolean	Ideal.containsHT(Set<Integer> H, List<GenPolynomial<C>> G)	Ideal head term containment test.
ColorPolynomial<C>	Condition.determine(GenPolynomial<GenPolynomial<C>> A)	Determine polynomial.
List<ColorPolynomial<C>>	Condition.determine(List<GenPolynomial<GenPolynomial<C>>> L)	Determine list of polynomials.
List<ColorPolynomial<C>>	Condition.determine(List<GenPolynomial<GenPolynomial<C>>> L)	Determine list of polynomials.
List<ColoredSystem<C>>	CReductionSeq.determine(List<GenPolynomial<GenPolynomial<C>>> H)	Determine polynomial list.
List<ColoredSystem<C>>	CReductionSeq.determine(List<GenPolynomial<GenPolynomial<C>>> H)	Determine polynomial list.
static <C extends GcdRingElem<C> & Rational> GenPolynomial<Complex<RealAlgebraicNumber<C>>>	PolyUtilApp.evaluateToComplexRealCoefficients(GenPolynomialRing<Complex<RealAlgebraicNumber<C>>> pfac, GenPolynomial<GenPolynomial<Complex<C>>> A, Complex<RealAlgebraicNumber<C>> r)	Evaluate to Complex<RealAlgebraicNumber> coefficients.
LocalSolvablePolynomial<C>	LocalSolvablePolynomialRing.fromPolyCoefficients(GenSolvablePolynomial<GenPolynomial<C>> A)	Rational function from integral polynomial coefficients.
ResidueSolvablePolynomial<C>	ResidueSolvablePolynomialRing.fromPolyCoefficients(GenSolvablePolynomial<GenPolynomial<C>> A)	Solvable residue coefficients from integral polynomial coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtilApp.fromProduct(GenPolynomialRing<GenPolynomial<C>> pfac, GenPolynomial<Product<Residue<C>>> P, int i)	From product representation.
static <C extends GcdRingElem<C>> List<GenPolynomial<GenPolynomial<C>>>	PolyUtilApp.fromProduct(GenPolynomialRing<GenPolynomial<C>> pfac, List<GenPolynomial<Product<Residue<C>>>> L, int i)	From product representation.
static <C extends GcdRingElem<C>> List<GenPolynomial<GenPolynomial<C>>>	PolyUtilApp.fromProduct(GenPolynomialRing<GenPolynomial<C>> pfac, List<GenPolynomial<Product<Residue<C>>>> L, int i)	From product representation.
List<GenPolynomial<GenPolynomial<C>>>	ComprehensiveGroebnerBaseSeq.GB(List<GenPolynomial<GenPolynomial<C>>> F)	Comprehensive Groebner base via Groebner system.
List<GenPolynomial<GenPolynomial<C>>>	ComprehensiveGroebnerBaseSeq.GB(List<GenPolynomial<GenPolynomial<C>>> F)	Comprehensive Groebner base via Groebner system.
GroebnerSystem<C>	ComprehensiveGroebnerBaseSeq.GBsys(List<GenPolynomial<GenPolynomial<C>>> F)	Comprehensive Groebner base system using pairlist class.
GroebnerSystem<C>	ComprehensiveGroebnerBaseSeq.GBsys(List<GenPolynomial<GenPolynomial<C>>> F)	Comprehensive Groebner base system using pairlist class.
static boolean	PolyUtilApp.isComplexRoots(List<GenPolynomial<Complex<BigDecimal>>> L, List<List<Complex<BigDecimal>>> roots, BigDecimal eps)	Test for complex roots of zero dimensional ideal(L).
boolean	ComprehensiveGroebnerBaseSeq.isGB(int modv, List<GenPolynomial<GenPolynomial<C>>> F)	Comprehensive-Groebner base test.
boolean	ComprehensiveGroebnerBaseSeq.isGB(int modv, List<GenPolynomial<GenPolynomial<C>>> F)	Comprehensive-Groebner base test.
boolean	ComprehensiveGroebnerBaseSeq.isGB(List<GenPolynomial<GenPolynomial<C>>> F)	Comprehensive-Groebner base test.
boolean	ComprehensiveGroebnerBaseSeq.isGB(List<GenPolynomial<GenPolynomial<C>>> F)	Comprehensive-Groebner base test.
boolean	ComprehensiveGroebnerBaseSeq.isGBcol(int modv, List<GenPolynomial<GenPolynomial<C>>> F)	Comprehensive-Groebner base test using colored systems.
boolean	ComprehensiveGroebnerBaseSeq.isGBcol(int modv, List<GenPolynomial<GenPolynomial<C>>> F)	Comprehensive-Groebner base test using colored systems.
boolean	ComprehensiveGroebnerBaseSeq.isGBcol(List<GenPolynomial<GenPolynomial<C>>> F)	Comprehensive-Groebner base test using colored systems.
boolean	ComprehensiveGroebnerBaseSeq.isGBcol(List<GenPolynomial<GenPolynomial<C>>> F)	Comprehensive-Groebner base test using colored systems.
boolean	ComprehensiveGroebnerBaseSeq.isGBsubst(int modv, List<GenPolynomial<GenPolynomial<C>>> F)	Comprehensive-Groebner base test using substitution.
boolean	ComprehensiveGroebnerBaseSeq.isGBsubst(int modv, List<GenPolynomial<GenPolynomial<C>>> F)	Comprehensive-Groebner base test using substitution.
boolean	ComprehensiveGroebnerBaseSeq.isGBsubst(List<GenPolynomial<GenPolynomial<C>>> F)	Comprehensive-Groebner base test using substitution.
boolean	ComprehensiveGroebnerBaseSeq.isGBsubst(List<GenPolynomial<GenPolynomial<C>>> F)	Comprehensive-Groebner base test using substitution.
static boolean	PolyUtilApp.isRealRoots(List<GenPolynomial<BigDecimal>> L, List<List<BigDecimal>> roots, BigDecimal eps)	Test for real roots of zero dimensional ideal(L).
List<GenPolynomial<C>>	Ideal.normalform(List<GenPolynomial<C>> L)	Normalform for list of elements.
IdealWithUniv<C>	Ideal.normalPositionFor(int i, int j, List<GenPolynomial<C>> og)	Compute normal position for variables i and j.
(package private) IdealWithUniv<C>	Ideal.normalPositionForChar0(int i, int j, List<GenPolynomial<C>> og)	Compute normal position for variables i and j, characteristic zero.
(package private) IdealWithUniv<C>	Ideal.normalPositionForCharP(int i, int j, List<GenPolynomial<C>> og)	Compute normal position for variables i and j, positive characteristic.
static <C extends GcdRingElem<C>> String	PolyUtilApp.productSliceToString(Map<Ideal<C>, PolynomialList<GenPolynomial<C>>> L)	Product slice to String.
static <D extends GcdRingElem<D> & Rational> List<List<BigDecimal>>	PolyUtilApp.realRoots(Ideal<D> I, List<GenPolynomial<D>> univs, BigRational eps)	Construct superset of real roots for zero dimensional ideal(G).
Ideal<C>	Ideal.sum(List<GenPolynomial<C>> L)	Summation.
static <C extends GcdRingElem<C>> GenPolynomial<Product<Residue<C>>>	PolyUtilApp.toProductRes(GenPolynomialRing<Product<Residue<C>>> pfac, GenPolynomial<GenPolynomial<C>> A)	Product representation.
static <C extends GcdRingElem<C>> List<GenPolynomial<Product<Residue<C>>>>	PolyUtilApp.toProductRes(GenPolynomialRing<Product<Residue<C>>> pfac, List<GenPolynomial<GenPolynomial<C>>> L)	Product representation.
static <C extends GcdRingElem<C>> List<GenPolynomial<Product<Residue<C>>>>	PolyUtilApp.toProductRes(GenPolynomialRing<Product<Residue<C>>> pfac, List<GenPolynomial<GenPolynomial<C>>> L)	Product representation.
static <C extends GcdRingElem<C>> GenPolynomial<Residue<C>>	PolyUtilApp.toResidue(GenPolynomialRing<Residue<C>> pfac, GenPolynomial<GenPolynomial<C>> A)	Residue coefficient representation.
static <C extends GcdRingElem<C>> List<GenPolynomial<Residue<C>>>	PolyUtilApp.toResidue(GenPolynomialRing<Residue<C>> pfac, List<GenPolynomial<GenPolynomial<C>>> L)	Residue coefficient representation.
static <C extends GcdRingElem<C>> List<GenPolynomial<Residue<C>>>	PolyUtilApp.toResidue(GenPolynomialRing<Residue<C>> pfac, List<GenPolynomial<GenPolynomial<C>>> L)	Residue coefficient representation.
List<IdealWithUniv<C>>	Ideal.zeroDimDecompositionExtension(List<GenPolynomial<C>> upol, List<GenPolynomial<C>> og)	Zero dimensional ideal irreducible decomposition extension.

Constructors in edu.jas.application with parameters of type GenPolynomial

Modifier	Constructor	Description
	AlgebraicRootsPrimElem(GenPolynomial<C> p, GenPolynomial<Complex<C>> cp, List<RealAlgebraicNumber<C>> r, List<ComplexAlgebraicNumber<C>> c, PrimitiveElement<C> pe, List<AlgebraicNumber<C>> ru)	Constructor.
	ColorPolynomial(GenPolynomial<GenPolynomial<C>> g, GenPolynomial<GenPolynomial<C>> r, GenPolynomial<GenPolynomial<C>> w)	The constructor creates a colored polynomial from the colored parts.
	Local(LocalRing<C> r, GenPolynomial<C> n)	The constructor creates a Local object from a ring factory and a numerator polynomial.
	Local(LocalRing<C> r, GenPolynomial<C> n, GenPolynomial<C> d)	The constructor creates a Local object from a ring factory and a numerator and denominator polynomial.
protected	Local(LocalRing<C> r, GenPolynomial<C> n, GenPolynomial<C> d, boolean isred)	The constructor creates a Local object from a ring factory and a numerator and denominator polynomial.
	RealAlgebraicNumber(RealAlgebraicRing<C> r, GenPolynomial<C> a)	The constructor creates a RealAlgebraicNumber object from a GenPolynomial value.
	Residue(ResidueRing<C> r, GenPolynomial<C> a)	The constructor creates a Residue object from a ring factory and a polynomial.
	Residue(ResidueRing<C> r, GenPolynomial<C> a, int u)	The constructor creates a Residue object from a ring factory, a polynomial and an indicator if a is a unit.

Constructor parameters in edu.jas.application with type arguments of type GenPolynomial

Modifier	Constructor	Description
	ColorPolynomial(GenPolynomial<GenPolynomial<C>> g, GenPolynomial<GenPolynomial<C>> r, GenPolynomial<GenPolynomial<C>> w)	The constructor creates a colored polynomial from the colored parts.
	Ideal(GenPolynomialRing<C> ring, List<GenPolynomial<C>> F)	Constructor.
	Ideal(GenPolynomialRing<C> ring, List<GenPolynomial<C>> F, boolean gb)	Constructor.
	Ideal(GenPolynomialRing<C> ring, List<GenPolynomial<C>> F, boolean gb, boolean topt)	Constructor.
	IdealWithComplexAlgebraicRoots(Ideal<D> id, List<GenPolynomial<D>> up, List<List<Complex<RealAlgebraicNumber<D>>>> cr)	Constructor.
	IdealWithComplexRoots(Ideal<C> id, List<GenPolynomial<C>> up, List<List<Complex<BigDecimal>>> cr)	Constructor.
	IdealWithRealAlgebraicRoots(Ideal<D> id, List<GenPolynomial<D>> up, List<List<RealAlgebraicNumber<D>>> rr)	Constructor.
	IdealWithRealRoots(Ideal<C> id, List<GenPolynomial<C>> up, List<List<BigDecimal>> rr)	Constructor.
protected	IdealWithUniv(Ideal<C> id, List<GenPolynomial<C>> up)	Constructor.
protected	IdealWithUniv(Ideal<C> id, List<GenPolynomial<C>> up, List<GenPolynomial<C>> og)	Constructor.
	OrderedCPairlist(int m, GenPolynomialRing<GenPolynomial<C>> r)	Constructor for OrderedPairlist.
private	OrderedCPairlist(int m, GenPolynomialRing<GenPolynomial<C>> r, List<ColorPolynomial<C>> P, SortedMap<ExpVector, LinkedList<CPair<C>>> pl, List<BitSet> red, CReductionSeq<C> cred, int pc, int rc)	Internal constructor for OrderedPairlist.
	OrderedCPairlist(GenPolynomialRing<GenPolynomial<C>> r)	Constructor for OrderedPairlist.

Uses of GenPolynomial in edu.jas.fd

Subclasses of GenPolynomial in edu.jas.fd

Modifier and Type	Class	Description
class	QuotSolvablePolynomial<C extends GcdRingElem<C>>	QuotSolvablePolynomial generic recursive solvable polynomials implementing RingElem.

Classes in edu.jas.fd that implement interfaces with type arguments of type GenPolynomial

Modifier and Type	Class	Description
class	SolvableQuotient<C extends GcdRingElem<C>>	SolvableQuotient, that is a (left) rational function, based on GenSolvablePolynomial with RingElem interface.
class	SolvableQuotientRing<C extends GcdRingElem<C>>	SolvableQuotient ring factory based on GenPolynomial with RingElem interface.

Methods in edu.jas.fd that return types with arguments of type GenPolynomial

Modifier and Type	Method	Description
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.baseRecursivePrimitivePart(GenSolvablePolynomial<GenPolynomial<C>> P)	GenSolvablePolynomial base recursive primitive part.
(package private) static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	FDUtil.experimentalRecursiveLeftDivide(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<C> s)
static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	FDUtil.integralFromQuotientCoefficients(GenSolvablePolynomialRing<GenPolynomial<C>> fac, GenSolvablePolynomial<SolvableQuotient<C>> A)	Integral solvable polynomial from solvable rational function coefficients.
static <C extends GcdRingElem<C>> List<GenSolvablePolynomial<GenPolynomial<C>>>	FDUtil.integralFromQuotientCoefficients(GenSolvablePolynomialRing<GenPolynomial<C>> fac, Collection<GenSolvablePolynomial<SolvableQuotient<C>>> L)	Integral solvable polynomial from solvable rational function coefficients.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.leftRecursiveGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	GenSolvablePolynomial left recursive greatest common divisor.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.leftRecursivePrimitivePart(GenSolvablePolynomial<GenPolynomial<C>> P)	GenSolvablePolynomial left recursive primitive part.
abstract GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.leftRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	Univariate GenSolvablePolynomial recursive greatest common divisor.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorFake.leftRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	Univariate GenSolvablePolynomial left recursive greatest common divisor.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorPrimitive.leftRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	Univariate GenSolvablePolynomial left recursive greatest common divisor.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorSimple.leftRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	Univariate GenSolvablePolynomial left recursive greatest common divisor.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorSyzygy.leftRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	Univariate GenSolvablePolynomial left recursive greatest common divisor.
GenSolvablePolynomial<GenPolynomial<C>>	SGCDParallelProxy.leftRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	left univariate GenSolvablePolynomial recursive greatest common divisor.
static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	FDUtil.recursiveDivide(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<C> s)	GenSolvablePolynomial left recursive quotient for recursive polynomials and exact division by coefficient ring element.
static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	FDUtil.recursiveDivideRightEval(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<C> s)	GenSolvablePolynomial recursive quotient for recursive polynomials and exact division by coefficient ring element.
static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	FDUtil.recursiveLeftDivide(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<C> s)	GenSolvablePolynomial recursive quotient for recursive polynomials and partial left exact division by coefficient ring element.
static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	FDUtil.recursivePseudoQuotient(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	GenSolvablePolynomial recursive pseudo quotient for recursive polynomials.
static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>[]	FDUtil.recursivePseudoQuotientRemainder(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	GenSolvablePolynomial recursive pseudo quotient and remainder for recursive polynomials.
static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	FDUtil.recursiveRightDivide(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<C> s)	GenSolvablePolynomial recursive quotient for recursive polynomials and partial right exact division by coefficient ring element.
static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	FDUtil.recursiveRightPseudoQuotient(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	GenSolvablePolynomial recursive right pseudo quotient for recursive polynomials.
static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>[]	FDUtil.recursiveRightPseudoQuotientRemainder(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	GenSolvablePolynomial right sparse pseudo quotient and remainder for recursive solvable polynomials.
static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	FDUtil.recursiveRightSparsePseudoRemainder(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	GenSolvablePolynomial right sparse pseudo remainder for recursive solvable polynomials.
static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	FDUtil.recursiveSparsePseudoRemainder(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	GenSolvablePolynomial sparse pseudo remainder for recursive solvable polynomials.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.rightRecursiveGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	GenSolvablePolynomial right recursive greatest common divisor.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.rightRecursivePrimitivePart(GenSolvablePolynomial<GenPolynomial<C>> P)	GenSolvablePolynomial right recursive primitive part.
abstract GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.rightRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	Univariate GenSolvablePolynomial right recursive greatest common divisor.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorFake.rightRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	Univariate GenSolvablePolynomial right recursive greatest common divisor.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorPrimitive.rightRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	Univariate GenSolvablePolynomial right recursive greatest common divisor.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorSimple.rightRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	Univariate GenSolvablePolynomial right recursive greatest common divisor.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorSyzygy.rightRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	Univariate GenSolvablePolynomial right recursive greatest common divisor.
GenSolvablePolynomial<GenPolynomial<C>>	SGCDParallelProxy.rightRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	right univariate GenSolvablePolynomial recursive greatest common divisor.

Methods in edu.jas.fd with parameters of type GenPolynomial

Modifier and Type	Method	Description
SolvableQuotient<C>	SolvableQuotientRing.create(GenPolynomial<C> n)	Create from numerator.
SolvableQuotient<C>	SolvableQuotientRing.create(GenPolynomial<C> n, GenPolynomial<C> d)	Create from numerator, denominator pair.
static <C extends GcdRingElem<C>> boolean	FDUtil.isLeftBasePseudoQuotientRemainder(GenPolynomial<C> P, GenPolynomial<C> S, GenPolynomial<C> q, GenPolynomial<C> r)	Is GenSolvablePolynomial left base pseudo quotient and remainder.
static <C extends GcdRingElem<C>> boolean	FDUtil.isRightBasePseudoQuotientRemainder(GenPolynomial<C> P, GenPolynomial<C> S, GenPolynomial<C> q, GenPolynomial<C> r)	Is GenSolvablePolynomial right base pseudo quotient and remainder.
RecSolvablePolynomial<C>	QuotSolvablePolynomialRing.toPolyCoefficients(GenPolynomial<SolvableQuotient<C>> A)	Integral function from rational polynomial coefficients.

Method parameters in edu.jas.fd with type arguments of type GenPolynomial

Modifier and Type	Method	Description
C	GreatestCommonDivisorAbstract.baseRecursiveContent(GenSolvablePolynomial<GenPolynomial<C>> P)	GenSolvablePolynomial base recursive content.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.baseRecursivePrimitivePart(GenSolvablePolynomial<GenPolynomial<C>> P)	GenSolvablePolynomial base recursive primitive part.
(package private) static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	FDUtil.experimentalRecursiveLeftDivide(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<C> s)
QuotSolvablePolynomial<C>	QuotSolvablePolynomialRing.fromPolyCoefficients(GenSolvablePolynomial<GenPolynomial<C>> A)	Rational function from integral polynomial coefficients.
static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	FDUtil.integralFromQuotientCoefficients(GenSolvablePolynomialRing<GenPolynomial<C>> fac, GenSolvablePolynomial<SolvableQuotient<C>> A)	Integral solvable polynomial from solvable rational function coefficients.
static <C extends GcdRingElem<C>> List<GenSolvablePolynomial<GenPolynomial<C>>>	FDUtil.integralFromQuotientCoefficients(GenSolvablePolynomialRing<GenPolynomial<C>> fac, Collection<GenSolvablePolynomial<SolvableQuotient<C>>> L)	Integral solvable polynomial from solvable rational function coefficients.
static <C extends GcdRingElem<C>> boolean	FDUtil.isRecursivePseudoQuotientRemainder(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S, GenSolvablePolynomial<GenPolynomial<C>> q, GenSolvablePolynomial<GenPolynomial<C>> r)	Is recursive GenSolvablePolynomial pseudo quotient and remainder.
static <C extends GcdRingElem<C>> boolean	FDUtil.isRecursiveRightPseudoQuotientRemainder(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S, GenSolvablePolynomial<GenPolynomial<C>> q, GenSolvablePolynomial<GenPolynomial<C>> r)	Is recursive GenSolvablePolynomial right pseudo quotient and remainder.
GenSolvablePolynomial<C>	GreatestCommonDivisorAbstract.leftRecursiveContent(GenSolvablePolynomial<GenPolynomial<C>> P)	GenSolvablePolynomial left recursive content.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.leftRecursiveGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	GenSolvablePolynomial left recursive greatest common divisor.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.leftRecursivePrimitivePart(GenSolvablePolynomial<GenPolynomial<C>> P)	GenSolvablePolynomial left recursive primitive part.
abstract GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.leftRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	Univariate GenSolvablePolynomial recursive greatest common divisor.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorFake.leftRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	Univariate GenSolvablePolynomial left recursive greatest common divisor.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorPrimitive.leftRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	Univariate GenSolvablePolynomial left recursive greatest common divisor.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorSimple.leftRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	Univariate GenSolvablePolynomial left recursive greatest common divisor.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorSyzygy.leftRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	Univariate GenSolvablePolynomial left recursive greatest common divisor.
GenSolvablePolynomial<GenPolynomial<C>>	SGCDParallelProxy.leftRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	left univariate GenSolvablePolynomial recursive greatest common divisor.
static <C extends GcdRingElem<C>> GenSolvablePolynomial<SolvableQuotient<C>>	FDUtil.quotientFromIntegralCoefficients(GenSolvablePolynomialRing<SolvableQuotient<C>> fac, GenSolvablePolynomial<GenPolynomial<C>> A)	Solvable rational function from integral solvable polynomial coefficients.
static <C extends GcdRingElem<C>> List<GenSolvablePolynomial<SolvableQuotient<C>>>	FDUtil.quotientFromIntegralCoefficients(GenSolvablePolynomialRing<SolvableQuotient<C>> fac, Collection<GenSolvablePolynomial<GenPolynomial<C>>> L)	Solvable rational function from integral solvable polynomial coefficients.
GenSolvablePolynomial<C>	GreatestCommonDivisorAbstract.recursiveContent(GenSolvablePolynomial<GenPolynomial<C>> P)	GenSolvablePolynomial commuting recursive content.
static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	FDUtil.recursiveDivide(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<C> s)	GenSolvablePolynomial left recursive quotient for recursive polynomials and exact division by coefficient ring element.
static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	FDUtil.recursiveDivideRightEval(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<C> s)	GenSolvablePolynomial recursive quotient for recursive polynomials and exact division by coefficient ring element.
static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	FDUtil.recursiveLeftDivide(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<C> s)	GenSolvablePolynomial recursive quotient for recursive polynomials and partial left exact division by coefficient ring element.
static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	FDUtil.recursivePseudoQuotient(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	GenSolvablePolynomial recursive pseudo quotient for recursive polynomials.
static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>[]	FDUtil.recursivePseudoQuotientRemainder(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	GenSolvablePolynomial recursive pseudo quotient and remainder for recursive polynomials.
static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	FDUtil.recursiveRightDivide(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<C> s)	GenSolvablePolynomial recursive quotient for recursive polynomials and partial right exact division by coefficient ring element.
static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	FDUtil.recursiveRightPseudoQuotient(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	GenSolvablePolynomial recursive right pseudo quotient for recursive polynomials.
static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>[]	FDUtil.recursiveRightPseudoQuotientRemainder(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	GenSolvablePolynomial right sparse pseudo quotient and remainder for recursive solvable polynomials.
static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	FDUtil.recursiveRightSparsePseudoRemainder(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	GenSolvablePolynomial right sparse pseudo remainder for recursive solvable polynomials.
static <C extends GcdRingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	FDUtil.recursiveSparsePseudoRemainder(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	GenSolvablePolynomial sparse pseudo remainder for recursive solvable polynomials.
GenSolvablePolynomial<C>	GreatestCommonDivisorAbstract.rightRecursiveContent(GenSolvablePolynomial<GenPolynomial<C>> P)	GenSolvablePolynomial right recursive content.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.rightRecursiveGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	GenSolvablePolynomial right recursive greatest common divisor.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.rightRecursivePrimitivePart(GenSolvablePolynomial<GenPolynomial<C>> P)	GenSolvablePolynomial right recursive primitive part.
abstract GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.rightRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	Univariate GenSolvablePolynomial right recursive greatest common divisor.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorFake.rightRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	Univariate GenSolvablePolynomial right recursive greatest common divisor.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorPrimitive.rightRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	Univariate GenSolvablePolynomial right recursive greatest common divisor.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorSimple.rightRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	Univariate GenSolvablePolynomial right recursive greatest common divisor.
GenSolvablePolynomial<GenPolynomial<C>>	GreatestCommonDivisorSyzygy.rightRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	Univariate GenSolvablePolynomial right recursive greatest common divisor.
GenSolvablePolynomial<GenPolynomial<C>>	SGCDParallelProxy.rightRecursiveUnivariateGcd(GenSolvablePolynomial<GenPolynomial<C>> P, GenSolvablePolynomial<GenPolynomial<C>> S)	right univariate GenSolvablePolynomial recursive greatest common divisor.

Uses of GenPolynomial in edu.jas.gb

Fields in edu.jas.gb declared as GenPolynomial

Modifier and Type	Field	Description
private GenPolynomial<C>	MiReducer.H
private GenPolynomial<C>	MiReducerClient.H
private GenPolynomial<C>	MiReducerClientEC.H
private GenPolynomial<C>	MiReducerClientSeqPair.H
private GenPolynomial<C>	MiReducerIter.H
private GenPolynomial<C>	MiReducerSeqPair.H
private GenPolynomial<C>	MiReducerServer.H
private GenPolynomial<C>	MiReducerServerEC.H
private GenPolynomial<C>	MiReducerServerSeqPair.H
final GenPolynomial<C>	AbstractPair.pi
final GenPolynomial<C>	AbstractPair.pj
final GenPolynomial<C>	GBSPTransportMessPoly.pol	The polynomial for transport.
final GenPolynomial<C>	GBTransportMessPoly.pol	The polynomial to transport.
final GenPolynomial<C>	SigPoly.poly
protected GenPolynomial<C>	CriticalPair.reductum
final GenPolynomial<C>	SigPair.sigma
final GenPolynomial<C>	SigPoly.sigma

Fields in edu.jas.gb with type parameters of type GenPolynomial

Modifier and Type	Field	Description
final BasicLinAlg<GenPolynomial<C>>	GroebnerBaseAbstract.blas	linear algebra engine.
protected final BasicLinAlg<GenPolynomial<C>>	SolvableGroebnerBaseAbstract.blas	Linear algebra engine.
final List<GenPolynomial<C>>	ExtendedGB.F
final List<List<GenPolynomial<C>>>	ExtendedGB.F2G
final List<GenPolynomial<C>>	ExtendedGB.G
private final List<GenPolynomial<C>>	MiReducer.G
private final List<GenPolynomial<C>>	MiReducerClient.G
private final List<GenPolynomial<C>>	MiReducerClientEC.G
private final List<GenPolynomial<C>>	MiReducerClientSeqPair.G
private final List<GenPolynomial<C>>	MiReducerIter.G
private final List<GenPolynomial<C>>	MiReducerSeqPair.G
private final List<GenPolynomial<C>>	MiReducerServer.G
private final List<GenPolynomial<C>>	MiReducerServerEC.G
private final List<GenPolynomial<C>>	MiReducerServerSeqPair.G
private final List<GenPolynomial<C>>	Reducer.G
private final List<GenPolynomial<C>>	ReducerIter.G
private final List<GenPolynomial<C>>	ReducerSeqPair.G
final List<List<GenPolynomial<C>>>	ExtendedGB.G2F
protected final List<GenPolynomial<C>>	OrderedPairlist.P
private final DistHashTable<Integer, GenPolynomial<C>>	HybridReducerClientEC.theList
private final DistHashTable<Integer, GenPolynomial<C>>	HybridReducerReceiverEC.theList
private final DistHashTable<Integer, GenPolynomial<C>>	HybridReducerServerEC.theList
private final DistHashTable<Integer, GenPolynomial<C>>	ReducerClientEC.theList
private final DistHashTable<Integer, GenPolynomial<C>>	ReducerClientSeqPair.theList
private final DistHashTable<Integer, GenPolynomial<C>>	ReducerServerEC.theList
private final DistHashTable<Integer, GenPolynomial<C>>	ReducerServerSeqPair.theList

Methods in edu.jas.gb that return GenPolynomial

Modifier and Type	Method	Description
GenPolynomial<C>	GroebnerBaseAbstract.constructUnivariate(int i, List<GenPolynomial<C>> G)	Construct univariate polynomial of minimal degree in variable i of a zero dimensional ideal(G).
(package private) GenPolynomial<BigInteger>	Cyclic.cyclicPoly(GenPolynomialRing<BigInteger> ring, int n, int i)
GenPolynomial<C>	MiReducer.getNF()	getNF.
GenPolynomial<C>	MiReducerClient.getNF()	getNF.
GenPolynomial<C>	MiReducerClientEC.getNF()	getNF.
GenPolynomial<C>	MiReducerClientSeqPair.getNF()	getNF.
GenPolynomial<C>	MiReducerIter.getNF()	getNF.
GenPolynomial<C>	MiReducerSeqPair.getNF()	getNF.
GenPolynomial<C>	MiReducerServer.getNF()	getNF.
GenPolynomial<C>	MiReducerServerEC.getNF()	getNF.
GenPolynomial<C>	MiReducerServerSeqPair.getNF()	getNF.
(package private) GenPolynomial<C>	SigPoly.getPoly()	getter for polynomial
GenPolynomial<C>	CriticalPair.getReductum()	Get reduced polynomial.
(package private) GenPolynomial<C>	SigPair.getSigma()	getter for sigma
(package private) GenPolynomial<C>	SigPoly.getSigma()	getter for sigma
GenPolynomial<C>	DReduction.GPolynomial(GenPolynomial<C> Ap, GenPolynomial<C> Bp)	G-Polynomial.
GenPolynomial<C>	DReduction.GPolynomial(List<GenPolynomial<C>> S, int i, GenPolynomial<C> Ap, int j, GenPolynomial<C> Bp)	G-Polynomial with recording.
GenPolynomial<C>	DReductionSeq.GPolynomial(GenPolynomial<C> Ap, GenPolynomial<C> Bp)	G-Polynomial.
GenPolynomial<C>	DReductionSeq.GPolynomial(List<GenPolynomial<C>> row, int i, GenPolynomial<C> Ap, int j, GenPolynomial<C> Bp)	G-Polynomial with recording.
GenPolynomial<C>	DGroebnerBaseSeq.inverse(GenPolynomial<C> h, List<GenPolynomial<C>> F)	Inverse for element modulo ideal.
GenPolynomial<C>	DReductionSeq.normalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform using d-reduction.
GenPolynomial<C>	DReductionSeq.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
GenPolynomial<C>	EReductionSeq.normalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform using e-reduction.
GenPolynomial<C>	EReductionSeq.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
GenPolynomial<C>	Reduction.normalform(List<GenPolynomial<C>> P, GenPolynomial<C> A)	Normalform.
GenPolynomial<C>	Reduction.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
GenPolynomial<C>	ReductionPar.normalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform.
GenPolynomial<C>	ReductionPar.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
GenPolynomial<C>	ReductionPar.normalform(Map<Integer, GenPolynomial<C>> mp, GenPolynomial<C> Ap)	Normalform.
GenPolynomial<C>	ReductionSeq.normalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform.
GenPolynomial<C>	ReductionSeq.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
GenPolynomial<C>	ReductionAbstract.normalformMarked(List<Monomial<C>> Mp, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with respect to marked head terms.
GenPolynomial<C>	ReductionSeq.normalformMarked(List<Monomial<C>> Mp, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with respect to marked head terms.
GenPolynomial<C>	DReductionSeq.SPolynomial(GenPolynomial<C> Ap, GenPolynomial<C> Bp)	S-Polynomial.
GenPolynomial<C>	DReductionSeq.SPolynomial(List<GenPolynomial<C>> row, int i, GenPolynomial<C> Ap, int j, GenPolynomial<C> Bp)	S-Polynomial with recording.
(package private) GenPolynomial<C>	GroebnerBaseArriSigSeqIter.SPolynomial(SigPair<C> P)	S-Polynomial.
(package private) GenPolynomial<C>	GroebnerBaseGGVSigSeqIter.SPolynomial(SigPoly<C> A, SigPoly<C> B)	S-Polynomial.
(package private) GenPolynomial<C>	GroebnerBaseSigSeqIter.SPolynomial(SigPair<C> P)	S-Polynomial.
(package private) GenPolynomial<C>	GroebnerBaseSigSeqIter.SPolynomial(SigPoly<C> A, SigPoly<C> B)	S-Polynomial.
GenPolynomial<C>	Reduction.SPolynomial(GenPolynomial<C> Ap, GenPolynomial<C> Bp)	S-Polynomial.
GenPolynomial<C>	Reduction.SPolynomial(List<GenPolynomial<C>> S, int i, GenPolynomial<C> Ap, int j, GenPolynomial<C> Bp)	S-Polynomial with recording.
GenPolynomial<C>	ReductionAbstract.SPolynomial(GenPolynomial<C> A, GenPolynomial<C> B)	S-Polynomial.
GenPolynomial<C>	ReductionAbstract.SPolynomial(List<GenPolynomial<C>> S, int i, GenPolynomial<C> A, int j, GenPolynomial<C> B)	S-Polynomial with recording.
GenPolynomial<C>	SigReduction.SPolynomial(SigPoly<C> Ap, SigPoly<C> Bp)	S-Polynomial.
GenPolynomial<C>	SigReductionSeq.SPolynomial(SigPoly<C> A, SigPoly<C> B)	S-Polynomial.
(package private) GenPolynomial<C>[]	GroebnerBaseSigSeqIter.SPolynomialFactors(SigPoly<C> A, SigPoly<C> B)	S-Polynomial polynomial factors.
GenPolynomial<C>[]	SigReductionSeq.SPolynomialFactors(SigPoly<C> A, SigPoly<C> B)	S-Polynomial polynomial factors.
GenPolynomial<C>	SigReductionSeq.SPolynomialHalf(SigPoly<C> A, SigPoly<C> B)	S-Polynomial half.

Methods in edu.jas.gb that return types with arguments of type GenPolynomial

Modifier and Type	Method	Description
List<GenPolynomial<BigInteger>>	Cyclic.cyclicPolys()	Compute list of polynomials.
(package private) List<GenPolynomial<BigInteger>>	Cyclic.cyclicPolys(GenPolynomialRing<BigInteger> ring)	Compute list of polynomials.
List<GenPolynomial<C>>	GBDistSP.execute(List<GenPolynomial<C>> F)	Deprecated. Execute a distributed GB example.
List<GenPolynomial<C>>	DGroebnerBaseSeq.GB(int modv, List<GenPolynomial<C>> F)	D-Groebner base using pairlist class.
List<GenPolynomial<C>>	GBOptimized.GB(int modv, List<GenPolynomial<C>> F)	Groebner base.
List<GenPolynomial<C>>	GBProxy.GB(int modv, List<GenPolynomial<C>> F)	Groebner base.
List<GenPolynomial<C>>	GroebnerBase.GB(int modv, List<GenPolynomial<C>> F)	Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBase.GB(List<GenPolynomial<C>> F)	Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBaseAbstract.GB(List<GenPolynomial<C>> F)	Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBaseDistributedEC.GB(int modv, List<GenPolynomial<C>> F)	Distributed Groebner base.
List<GenPolynomial<C>>	GroebnerBaseDistributedHybridEC.GB(int modv, List<GenPolynomial<C>> F)	Distributed Groebner base.
List<GenPolynomial<C>>	GroebnerBaseParallel.GB(int modv, List<GenPolynomial<C>> F)	Parallel Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBaseParIter.GB(int modv, List<GenPolynomial<C>> F)	Parallel iterative Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBaseParIter.GB(int modv, List<GenPolynomial<C>> G, GenPolynomial<C> f)	Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBaseSeq.GB(int modv, List<GenPolynomial<C>> F)	Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBaseSeqIter.GB(int modv, List<GenPolynomial<C>> F)	Groebner base using pairlist class, iterative algorithm.
List<GenPolynomial<C>>	GroebnerBaseSeqIter.GB(int modv, List<GenPolynomial<C>> G, GenPolynomial<C> f)	Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBaseSeqPairDistributed.GB(int modv, List<GenPolynomial<C>> F)	Deprecated. Distributed Groebner base.
List<GenPolynomial<C>>	GroebnerBaseSeqPairParallel.GB(int modv, List<GenPolynomial<C>> F)	Parallel Groebner base using sequential pair order class.
List<GenPolynomial<C>>	GroebnerBaseSeqPairSeq.GB(int modv, List<GenPolynomial<C>> F)	Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBaseSigSeqIter.GB(int modv, List<GenPolynomial<C>> F)	Groebner base signature iterative algorithm.
List<GenPolynomial<C>>	GroebnerBaseSigSeqIter.GB(int modv, List<GenPolynomial<C>> G, GenPolynomial<C> f)	Groebner base iterated.
(package private) List<GenPolynomial<C>>	GroebnerBaseDistributedEC.GBMaster(int modv, List<GenPolynomial<C>> F)	Distributed Groebner base.
(package private) List<GenPolynomial<C>>	GroebnerBaseDistributedHybridEC.GBMaster(int modv, List<GenPolynomial<C>> F)	Distributed hybrid Groebner base.
List<GenPolynomial<C>>	OrderedPairlist.getList()	Get the list of polynomials.
List<GenPolynomial<C>>	PairList.getList()	Get the list of polynomials.
List<GenPolynomial<C>>	DReductionSeq.irreducibleSet(List<GenPolynomial<C>> Pp)	Irreducible set.
List<GenPolynomial<C>>	EReductionSeq.irreducibleSet(List<GenPolynomial<C>> Pp)	Irreducible set.
List<GenPolynomial<C>>	Reduction.irreducibleSet(List<GenPolynomial<C>> Pp)	Irreducible set.
List<GenPolynomial<C>>	ReductionAbstract.irreducibleSet(List<GenPolynomial<C>> Pp)	Irreducible set.
List<GenPolynomial<C>>	GroebnerBase.minimalGB(List<GenPolynomial<C>> Gp)	Minimal ordered groebner basis.
List<GenPolynomial<C>>	GroebnerBaseAbstract.minimalGB(List<GenPolynomial<C>> Gp)	Minimal ordered Groebner basis.
List<GenPolynomial<C>>	GroebnerBaseDistributedEC.minimalGB(List<GenPolynomial<C>> Fp)	Minimal ordered groebner basis.
List<GenPolynomial<C>>	GroebnerBaseDistributedHybridEC.minimalGB(List<GenPolynomial<C>> Fp)	Minimal ordered groebner basis.
List<GenPolynomial<C>>	GroebnerBaseParallel.minimalGB(List<GenPolynomial<C>> Fp)	Minimal ordered groebner basis, parallel.
List<GenPolynomial<C>>	GroebnerBaseParIter.minimalGB(List<GenPolynomial<C>> Fp)	Minimal ordered groebner basis, parallel.
List<GenPolynomial<C>>	GroebnerBaseSeqPairDistributed.minimalGB(List<GenPolynomial<C>> Fp)	Deprecated. Minimal ordered groebner basis.
List<GenPolynomial<C>>	GroebnerBaseSeqPairParallel.minimalGB(List<GenPolynomial<C>> Fp)	Minimal ordered groebner basis, parallel.
List<GenPolynomial<C>>	Reduction.normalform(List<GenPolynomial<C>> Pp, List<GenPolynomial<C>> Ap)	Normalform Set.
List<GenPolynomial<C>>	ReductionAbstract.normalform(List<GenPolynomial<C>> Pp, List<GenPolynomial<C>> Ap)	Normalform Set.
List<List<GenPolynomial<C>>>	GroebnerBaseAbstract.normalizeMatrix(int flen, List<List<GenPolynomial<C>>> M)	Normalize M.
List<GenPolynomial<C>>	GroebnerBaseAbstract.normalizeZerosOnes(List<GenPolynomial<C>> A)	Normalize polynomial list.
List<GenPolynomial<C>>	SigReductionSeq.polys(List<SigPoly<C>> F)	Select polynomials.
List<GenPolynomial<C>>	SigReductionSeq.sigmas(List<SigPair<C>> F)	Select signatures.

Methods in edu.jas.gb with parameters of type GenPolynomial

Modifier and Type	Method	Description
boolean	DReductionSeq.criterion4(GenPolynomial<C> A, GenPolynomial<C> B)	GB criterium 4.
boolean	DReductionSeq.criterion4(GenPolynomial<C> A, GenPolynomial<C> B, ExpVector e)	GB criterium 4.
boolean	Reduction.criterion4(GenPolynomial<C> A, GenPolynomial<C> B)	GB criterium 4.
boolean	Reduction.criterion4(GenPolynomial<C> A, GenPolynomial<C> B, ExpVector e)	GB criterium 4.
boolean	ReductionAbstract.criterion4(GenPolynomial<C> A, GenPolynomial<C> B)	GB criterium 4.
boolean	ReductionAbstract.criterion4(GenPolynomial<C> A, GenPolynomial<C> B, ExpVector e)	GB criterium 4.
List<GenPolynomial<C>>	GroebnerBaseParIter.GB(int modv, List<GenPolynomial<C>> G, GenPolynomial<C> f)	Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBaseSeqIter.GB(int modv, List<GenPolynomial<C>> G, GenPolynomial<C> f)	Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBaseSigSeqIter.GB(int modv, List<GenPolynomial<C>> G, GenPolynomial<C> f)	Groebner base iterated.
GenPolynomial<C>	DReduction.GPolynomial(GenPolynomial<C> Ap, GenPolynomial<C> Bp)	G-Polynomial.
GenPolynomial<C>	DReduction.GPolynomial(List<GenPolynomial<C>> S, int i, GenPolynomial<C> Ap, int j, GenPolynomial<C> Bp)	G-Polynomial with recording.
GenPolynomial<C>	DReductionSeq.GPolynomial(GenPolynomial<C> Ap, GenPolynomial<C> Bp)	G-Polynomial.
GenPolynomial<C>	DReductionSeq.GPolynomial(List<GenPolynomial<C>> row, int i, GenPolynomial<C> Ap, int j, GenPolynomial<C> Bp)	G-Polynomial with recording.
GenPolynomial<C>	DGroebnerBaseSeq.inverse(GenPolynomial<C> h, List<GenPolynomial<C>> F)	Inverse for element modulo ideal.
boolean	DReductionSeq.isNormalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Is in Normalform.
boolean	EReductionSeq.isNormalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Is in Normalform.
boolean	Reduction.isNormalform(List<GenPolynomial<C>> P, GenPolynomial<C> A)	Is in Normalform.
boolean	ReductionAbstract.isNormalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Is in Normalform.
boolean	Reduction.isReducible(List<GenPolynomial<C>> P, GenPolynomial<C> A)	Is reducible.
boolean	ReductionAbstract.isReducible(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Is reducible.
boolean	Reduction.isReductionNF(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap, GenPolynomial<C> Np)	Is reduction of normal form.
boolean	ReductionAbstract.isReductionNF(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap, GenPolynomial<C> Np)	Is reduction of normal form.
boolean	DReductionSeq.isTopReducible(List<GenPolynomial<C>> P, GenPolynomial<C> A)	Is top reducible.
boolean	EReductionSeq.isTopReducible(List<GenPolynomial<C>> P, GenPolynomial<C> A)	Is top reducible.
boolean	Reduction.isTopReducible(List<GenPolynomial<C>> P, GenPolynomial<C> A)	Is top reducible.
boolean	ReductionAbstract.isTopReducible(List<GenPolynomial<C>> P, GenPolynomial<C> A)	Is top reducible.
boolean	Reduction.moduleCriterion(int modv, GenPolynomial<C> A, GenPolynomial<C> B)	Module criterium.
boolean	ReductionAbstract.moduleCriterion(int modv, GenPolynomial<C> A, GenPolynomial<C> B)	Module criterium.
(package private) SigPair<C>	GroebnerBaseArriSigSeqIter.newPair(GenPolynomial<C> s, SigPoly<C> A, SigPoly<C> B, List<SigPoly<C>> G)	Pair with signature.
(package private) SigPair<C>	GroebnerBaseSigSeqIter.newPair(GenPolynomial<C> s, SigPoly<C> A, SigPoly<C> B, List<SigPoly<C>> G)	Pair with signature.
GenPolynomial<C>	DReductionSeq.normalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform using d-reduction.
GenPolynomial<C>	DReductionSeq.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
GenPolynomial<C>	EReductionSeq.normalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform using e-reduction.
GenPolynomial<C>	EReductionSeq.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
GenPolynomial<C>	Reduction.normalform(List<GenPolynomial<C>> P, GenPolynomial<C> A)	Normalform.
GenPolynomial<C>	Reduction.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
GenPolynomial<C>	ReductionPar.normalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform.
GenPolynomial<C>	ReductionPar.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
GenPolynomial<C>	ReductionPar.normalform(Map<Integer, GenPolynomial<C>> mp, GenPolynomial<C> Ap)	Normalform.
GenPolynomial<C>	ReductionSeq.normalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform.
GenPolynomial<C>	ReductionSeq.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
GenPolynomial<C>	ReductionAbstract.normalformMarked(List<Monomial<C>> Mp, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with respect to marked head terms.
GenPolynomial<C>	ReductionSeq.normalformMarked(List<Monomial<C>> Mp, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with respect to marked head terms.
int	CriticalPairList.put(GenPolynomial<C> p)	Put a polynomial to the pairlist and reduction matrix.
int	OrderedMinPairlist.put(GenPolynomial<C> p)	Put one Polynomial to the pairlist and reduction matrix.
int	OrderedPairlist.put(GenPolynomial<C> p)	Put one Polynomial to the pairlist and reduction matrix.
int	OrderedSyzPairlist.put(GenPolynomial<C> p)	Put one Polynomial to the pairlist and reduction matrix.
int	PairList.put(GenPolynomial<C> p)	Put one Polynomial to the pairlist and reduction matrix.
int	OrderedPairlist.putOne(GenPolynomial<C> one)	Put the ONE-Polynomial to the pairlist.
int	CriticalPairList.record(CriticalPair<C> pair, GenPolynomial<C> p)	Record reduced polynomial.
void	CriticalPair.setReductum(GenPolynomial<C> r)	Set reduced polynomial.
GenPolynomial<C>	DReductionSeq.SPolynomial(GenPolynomial<C> Ap, GenPolynomial<C> Bp)	S-Polynomial.
GenPolynomial<C>	DReductionSeq.SPolynomial(List<GenPolynomial<C>> row, int i, GenPolynomial<C> Ap, int j, GenPolynomial<C> Bp)	S-Polynomial with recording.
GenPolynomial<C>	Reduction.SPolynomial(GenPolynomial<C> Ap, GenPolynomial<C> Bp)	S-Polynomial.
GenPolynomial<C>	Reduction.SPolynomial(List<GenPolynomial<C>> S, int i, GenPolynomial<C> Ap, int j, GenPolynomial<C> Bp)	S-Polynomial with recording.
GenPolynomial<C>	ReductionAbstract.SPolynomial(GenPolynomial<C> A, GenPolynomial<C> B)	S-Polynomial.
GenPolynomial<C>	ReductionAbstract.SPolynomial(List<GenPolynomial<C>> S, int i, GenPolynomial<C> A, int j, GenPolynomial<C> B)	S-Polynomial with recording.
int	CriticalPairList.update(CriticalPair<C> pair, GenPolynomial<C> p)	Record reduced polynomial and update critical pair list.

Method parameters in edu.jas.gb with type arguments of type GenPolynomial

Modifier and Type	Method	Description
int	GroebnerBaseAbstract.commonZeroTest(List<GenPolynomial<C>> F)	Common zero test.
GenPolynomial<C>	GroebnerBaseAbstract.constructUnivariate(int i, List<GenPolynomial<C>> G)	Construct univariate polynomial of minimal degree in variable i of a zero dimensional ideal(G).
(package private) boolean	GroebnerBaseAbstract.criterion3(int i, int j, ExpVector eij, List<GenPolynomial<C>> P)	GB criterium 3.
List<GenPolynomial<C>>	GBDistSP.execute(List<GenPolynomial<C>> F)	Deprecated. Execute a distributed GB example.
ExtendedGB<C>	DGroebnerBaseSeq.extGB(int modv, List<GenPolynomial<C>> F)	Extended Groebner base using pairlist class.
ExtendedGB<C>	GroebnerBase.extGB(int modv, List<GenPolynomial<C>> F)	Extended Groebner base using critical pair class.
ExtendedGB<C>	GroebnerBase.extGB(List<GenPolynomial<C>> F)	Extended Groebner base using critical pair class.
ExtendedGB<C>	GroebnerBaseAbstract.extGB(int modv, List<GenPolynomial<C>> F)	Extended Groebner base using critical pair class.
ExtendedGB<C>	GroebnerBaseAbstract.extGB(List<GenPolynomial<C>> F)	Extended Groebner base using critical pair class.
ExtendedGB<C>	GroebnerBaseSeq.extGB(int modv, List<GenPolynomial<C>> F)	Extended Groebner base using critical pair class.
ExtendedGB<C>	GroebnerBaseSeqPairSeq.extGB(int modv, List<GenPolynomial<C>> F)	Extended Groebner base using critical pair class.
List<GenPolynomial<C>>	DGroebnerBaseSeq.GB(int modv, List<GenPolynomial<C>> F)	D-Groebner base using pairlist class.
List<GenPolynomial<C>>	GBOptimized.GB(int modv, List<GenPolynomial<C>> F)	Groebner base.
List<GenPolynomial<C>>	GBProxy.GB(int modv, List<GenPolynomial<C>> F)	Groebner base.
List<GenPolynomial<C>>	GroebnerBase.GB(int modv, List<GenPolynomial<C>> F)	Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBase.GB(List<GenPolynomial<C>> F)	Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBaseAbstract.GB(List<GenPolynomial<C>> F)	Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBaseDistributedEC.GB(int modv, List<GenPolynomial<C>> F)	Distributed Groebner base.
List<GenPolynomial<C>>	GroebnerBaseDistributedHybridEC.GB(int modv, List<GenPolynomial<C>> F)	Distributed Groebner base.
List<GenPolynomial<C>>	GroebnerBaseParallel.GB(int modv, List<GenPolynomial<C>> F)	Parallel Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBaseParIter.GB(int modv, List<GenPolynomial<C>> F)	Parallel iterative Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBaseParIter.GB(int modv, List<GenPolynomial<C>> G, GenPolynomial<C> f)	Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBaseSeq.GB(int modv, List<GenPolynomial<C>> F)	Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBaseSeqIter.GB(int modv, List<GenPolynomial<C>> F)	Groebner base using pairlist class, iterative algorithm.
List<GenPolynomial<C>>	GroebnerBaseSeqIter.GB(int modv, List<GenPolynomial<C>> G, GenPolynomial<C> f)	Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBaseSeqPairDistributed.GB(int modv, List<GenPolynomial<C>> F)	Deprecated. Distributed Groebner base.
List<GenPolynomial<C>>	GroebnerBaseSeqPairParallel.GB(int modv, List<GenPolynomial<C>> F)	Parallel Groebner base using sequential pair order class.
List<GenPolynomial<C>>	GroebnerBaseSeqPairSeq.GB(int modv, List<GenPolynomial<C>> F)	Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBaseSigSeqIter.GB(int modv, List<GenPolynomial<C>> F)	Groebner base signature iterative algorithm.
List<GenPolynomial<C>>	GroebnerBaseSigSeqIter.GB(int modv, List<GenPolynomial<C>> G, GenPolynomial<C> f)	Groebner base iterated.
(package private) List<GenPolynomial<C>>	GroebnerBaseDistributedEC.GBMaster(int modv, List<GenPolynomial<C>> F)	Distributed Groebner base.
(package private) List<GenPolynomial<C>>	GroebnerBaseDistributedHybridEC.GBMaster(int modv, List<GenPolynomial<C>> F)	Distributed hybrid Groebner base.
GenPolynomial<C>	DReduction.GPolynomial(List<GenPolynomial<C>> S, int i, GenPolynomial<C> Ap, int j, GenPolynomial<C> Bp)	G-Polynomial with recording.
GenPolynomial<C>	DReductionSeq.GPolynomial(List<GenPolynomial<C>> row, int i, GenPolynomial<C> Ap, int j, GenPolynomial<C> Bp)	G-Polynomial with recording.
(package private) List<ExpVector>	GroebnerBaseArriSigSeqIter.initializeSyz(List<GenPolynomial<C>> F, List<SigPoly<C>> G)	Initializes syzygy list.
(package private) List<ExpVector>	GroebnerBaseF5zSigSeqIter.initializeSyz(List<GenPolynomial<C>> F, List<SigPoly<C>> G)	Initializes syzygy list.
(package private) List<ExpVector>	GroebnerBaseGGVSigSeqIter.initializeSyz(List<GenPolynomial<C>> F, List<SigPoly<C>> G)	Initializes syzygy list.
(package private) List<ExpVector>	GroebnerBaseSigSeqIter.initializeSyz(List<GenPolynomial<C>> F, List<SigPoly<C>> G)	Initializes syzygy list.
GenPolynomial<C>	DGroebnerBaseSeq.inverse(GenPolynomial<C> h, List<GenPolynomial<C>> F)	Inverse for element modulo ideal.
List<GenPolynomial<C>>	DReductionSeq.irreducibleSet(List<GenPolynomial<C>> Pp)	Irreducible set.
List<GenPolynomial<C>>	EReductionSeq.irreducibleSet(List<GenPolynomial<C>> Pp)	Irreducible set.
List<GenPolynomial<C>>	Reduction.irreducibleSet(List<GenPolynomial<C>> Pp)	Irreducible set.
List<GenPolynomial<C>>	ReductionAbstract.irreducibleSet(List<GenPolynomial<C>> Pp)	Irreducible set.
boolean	DGroebnerBaseSeq.isGB(int modv, List<GenPolynomial<C>> F)	D-Groebner base test.
boolean	GroebnerBase.isGB(int modv, List<GenPolynomial<C>> F)	Groebner base test.
boolean	GroebnerBase.isGB(List<GenPolynomial<C>> F)	Groebner base test.
boolean	GroebnerBaseAbstract.isGB(int modv, List<GenPolynomial<C>> F)	Groebner base test.
boolean	GroebnerBaseAbstract.isGB(int modv, List<GenPolynomial<C>> F, boolean b)	Groebner base test.
boolean	GroebnerBaseAbstract.isGB(List<GenPolynomial<C>> F)	Groebner base test.
boolean	GroebnerBaseAbstract.isGB(List<GenPolynomial<C>> F, boolean b)	Groebner base test.
boolean	GroebnerBaseAbstract.isGBidem(int modv, List<GenPolynomial<C>> F)	Groebner base idempotence test.
boolean	GroebnerBaseAbstract.isGBsimple(int modv, List<GenPolynomial<C>> F)	Groebner base simple test.
boolean	GroebnerBaseAbstract.isMinimalGB(List<GenPolynomial<C>> Gp)	Test for minimal ordered Groebner basis.
boolean	GroebnerBaseAbstract.isMinReductionMatrix(List<GenPolynomial<C>> F, List<GenPolynomial<C>> G, List<List<GenPolynomial<C>>> Mf, List<List<GenPolynomial<C>>> Mg)	Test if minimal reduction matrix.
boolean	DReductionSeq.isNormalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Is in Normalform.
boolean	EReductionSeq.isNormalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Is in Normalform.
boolean	Reduction.isNormalform(List<GenPolynomial<C>> Pp)	Is in Normalform.
boolean	Reduction.isNormalform(List<GenPolynomial<C>> P, GenPolynomial<C> A)	Is in Normalform.
boolean	ReductionAbstract.isNormalform(List<GenPolynomial<C>> Pp)	Is in Normalform.
boolean	ReductionAbstract.isNormalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Is in Normalform.
boolean	Reduction.isReducible(List<GenPolynomial<C>> P, GenPolynomial<C> A)	Is reducible.
boolean	ReductionAbstract.isReducible(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Is reducible.
boolean	GroebnerBase.isReductionMatrix(List<GenPolynomial<C>> F, List<GenPolynomial<C>> G, List<List<GenPolynomial<C>>> Mf, List<List<GenPolynomial<C>>> Mg)	Test if reduction matrix.
boolean	GroebnerBaseAbstract.isReductionMatrix(List<GenPolynomial<C>> F, List<GenPolynomial<C>> G, List<List<GenPolynomial<C>>> Mf, List<List<GenPolynomial<C>>> Mg)	Test if reduction matrix.
boolean	Reduction.isReductionNF(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap, GenPolynomial<C> Np)	Is reduction of normal form.
boolean	ReductionAbstract.isReductionNF(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap, GenPolynomial<C> Np)	Is reduction of normal form.
boolean	DReductionSeq.isTopReducible(List<GenPolynomial<C>> P, GenPolynomial<C> A)	Is top reducible.
boolean	EReductionSeq.isTopReducible(List<GenPolynomial<C>> P, GenPolynomial<C> A)	Is top reducible.
boolean	Reduction.isTopReducible(List<GenPolynomial<C>> P, GenPolynomial<C> A)	Is top reducible.
boolean	ReductionAbstract.isTopReducible(List<GenPolynomial<C>> P, GenPolynomial<C> A)	Is top reducible.
ExtendedGB<C>	DGroebnerBaseSeq.minimalExtendedGB(int flen, List<GenPolynomial<C>> Gp, List<List<GenPolynomial<C>>> M)	Minimal extended groebner basis.
ExtendedGB<C>	GroebnerBaseAbstract.minimalExtendedGB(int flen, List<GenPolynomial<C>> Gp, List<List<GenPolynomial<C>>> M)	Minimal extended groebner basis.
List<GenPolynomial<C>>	GroebnerBase.minimalGB(List<GenPolynomial<C>> Gp)	Minimal ordered groebner basis.
List<GenPolynomial<C>>	GroebnerBaseAbstract.minimalGB(List<GenPolynomial<C>> Gp)	Minimal ordered Groebner basis.
List<GenPolynomial<C>>	GroebnerBaseDistributedEC.minimalGB(List<GenPolynomial<C>> Fp)	Minimal ordered groebner basis.
List<GenPolynomial<C>>	GroebnerBaseDistributedHybridEC.minimalGB(List<GenPolynomial<C>> Fp)	Minimal ordered groebner basis.
List<GenPolynomial<C>>	GroebnerBaseParallel.minimalGB(List<GenPolynomial<C>> Fp)	Minimal ordered groebner basis, parallel.
List<GenPolynomial<C>>	GroebnerBaseParIter.minimalGB(List<GenPolynomial<C>> Fp)	Minimal ordered groebner basis, parallel.
List<GenPolynomial<C>>	GroebnerBaseSeqPairDistributed.minimalGB(List<GenPolynomial<C>> Fp)	Deprecated. Minimal ordered groebner basis.
List<GenPolynomial<C>>	GroebnerBaseSeqPairParallel.minimalGB(List<GenPolynomial<C>> Fp)	Minimal ordered groebner basis, parallel.
GenPolynomial<C>	DReductionSeq.normalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform using d-reduction.
GenPolynomial<C>	DReductionSeq.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
GenPolynomial<C>	EReductionSeq.normalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform using e-reduction.
GenPolynomial<C>	EReductionSeq.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
GenPolynomial<C>	Reduction.normalform(List<GenPolynomial<C>> P, GenPolynomial<C> A)	Normalform.
List<GenPolynomial<C>>	Reduction.normalform(List<GenPolynomial<C>> Pp, List<GenPolynomial<C>> Ap)	Normalform Set.
GenPolynomial<C>	Reduction.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
List<GenPolynomial<C>>	ReductionAbstract.normalform(List<GenPolynomial<C>> Pp, List<GenPolynomial<C>> Ap)	Normalform Set.
GenPolynomial<C>	ReductionPar.normalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform.
GenPolynomial<C>	ReductionPar.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
GenPolynomial<C>	ReductionPar.normalform(Map<Integer, GenPolynomial<C>> mp, GenPolynomial<C> Ap)	Normalform.
GenPolynomial<C>	ReductionSeq.normalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform.
GenPolynomial<C>	ReductionSeq.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
List<List<GenPolynomial<C>>>	GroebnerBaseAbstract.normalizeMatrix(int flen, List<List<GenPolynomial<C>>> M)	Normalize M.
List<GenPolynomial<C>>	GroebnerBaseAbstract.normalizeZerosOnes(List<GenPolynomial<C>> A)	Normalize polynomial list.
int	OrderedPairlist.put(List<GenPolynomial<C>> F)	Put all polynomials in F to the pairlist and reduction matrix.
int	PairList.put(List<GenPolynomial<C>> F)	Put all polynomials in F to the pairlist and reduction matrix.
void	OrderedPairlist.setList(List<GenPolynomial<C>> F)	Set the list of polynomials.
void	PairList.setList(List<GenPolynomial<C>> F)	Set the list of polynomials.
(package private) SigPoly<C>	GroebnerBaseArriSigSeqIter.sigNormalform(List<GenPolynomial<C>> F, List<SigPoly<C>> G, SigPoly<C> A)	Top normalform.
(package private) SigPoly<C>	GroebnerBaseF5zSigSeqIter.sigNormalform(List<GenPolynomial<C>> F, List<SigPoly<C>> G, SigPoly<C> A)	Top normalform.
(package private) SigPoly<C>	GroebnerBaseSigSeqIter.sigNormalform(List<GenPolynomial<C>> F, List<SigPoly<C>> G, SigPoly<C> A)	Top normalform.
SigPoly<C>	SigReduction.sigNormalform(List<GenPolynomial<C>> F, List<SigPoly<C>> G, SigPoly<C> A)	Normalform.
SigPoly<C>	SigReductionSeq.sigNormalform(List<GenPolynomial<C>> F, List<SigPoly<C>> G, SigPoly<C> A)	Top normalform.
SigPoly<C>	SigReductionSeq.sigSemiNormalform(List<GenPolynomial<C>> F, List<SigPoly<C>> G, SigPoly<C> A)	Top semi-complete normalform.
GenPolynomial<C>	DReductionSeq.SPolynomial(List<GenPolynomial<C>> row, int i, GenPolynomial<C> Ap, int j, GenPolynomial<C> Bp)	S-Polynomial with recording.
GenPolynomial<C>	Reduction.SPolynomial(List<GenPolynomial<C>> S, int i, GenPolynomial<C> Ap, int j, GenPolynomial<C> Bp)	S-Polynomial with recording.
GenPolynomial<C>	ReductionAbstract.SPolynomial(List<GenPolynomial<C>> S, int i, GenPolynomial<C> A, int j, GenPolynomial<C> B)	S-Polynomial with recording.
List<Long>	GroebnerBaseAbstract.univariateDegrees(List<GenPolynomial<C>> A)	Univariate head term degrees.

Constructors in edu.jas.gb with parameters of type GenPolynomial

Modifier	Constructor	Description
	AbstractPair(ExpVector lcm, GenPolynomial<C> a, GenPolynomial<C> b, int i, int j)	AbstractPair constructor.
	AbstractPair(ExpVector lcm, GenPolynomial<C> a, GenPolynomial<C> b, int i, int j, int s)	AbstractPair constructor.
	AbstractPair(GenPolynomial<C> a, GenPolynomial<C> b, int i, int j)	AbstractPair constructor.
	AbstractPair(GenPolynomial<C> a, GenPolynomial<C> b, int i, int j, int s)	AbstractPair constructor.
	CriticalPair(ExpVector e, GenPolynomial<C> pi, GenPolynomial<C> pj, int i, int j)	CriticalPair constructor.
	GBSPTransportMessPoly(GenPolynomial<C> p)	GBSPTransportMessPoly.
	GBTransportMessPoly(GenPolynomial<C> p)	GBTransportMessPoly.
(package private)	MiReducer(List<GenPolynomial<C>> G, GenPolynomial<C> p)
(package private)	MiReducerClient(List<GenPolynomial<C>> G, GenPolynomial<C> p)
(package private)	MiReducerClientEC(List<GenPolynomial<C>> G, GenPolynomial<C> p)
(package private)	MiReducerClientSeqPair(List<GenPolynomial<C>> G, GenPolynomial<C> p)
(package private)	MiReducerIter(List<GenPolynomial<C>> G, GenPolynomial<C> p)
(package private)	MiReducerSeqPair(List<GenPolynomial<C>> G, GenPolynomial<C> p)
(package private)	MiReducerServer(List<GenPolynomial<C>> G, GenPolynomial<C> p)
(package private)	MiReducerServerEC(List<GenPolynomial<C>> G, GenPolynomial<C> p)
(package private)	MiReducerServerSeqPair(List<GenPolynomial<C>> G, GenPolynomial<C> p)
	Pair(ExpVector lcm, GenPolynomial<C> a, GenPolynomial<C> b, int i, int j)	Pair constructor.
	Pair(ExpVector lcm, GenPolynomial<C> a, GenPolynomial<C> b, int i, int j, int s)	Pair constructor.
	Pair(GenPolynomial<C> a, GenPolynomial<C> b, int i, int j)	Pair constructor.
	Pair(GenPolynomial<C> a, GenPolynomial<C> b, int i, int j, int s)	Pair constructor.
	SigPair(GenPolynomial<C> sig, SigPoly<C> a, SigPoly<C> b, List<SigPoly<C>> Gs)	SigPair constructor.
	SigPoly(GenPolynomial<C> s, GenPolynomial<C> p)	Constructor.

Constructor parameters in edu.jas.gb with type arguments of type GenPolynomial

Modifier	Constructor	Description
	ExtendedGB(List<GenPolynomial<C>> F, List<GenPolynomial<C>> G, List<List<GenPolynomial<C>>> F2G, List<List<GenPolynomial<C>>> G2F)	Container for a GB and transformation matrices.
(package private)	HybridReducerClientEC(TaggedSocketChannel tc, DistHashTable<Integer, GenPolynomial<C>> dl)	Constructor.
(package private)	HybridReducerReceiverEC(Terminator fin, AtomicInteger a, TaggedSocketChannel pc, DistHashTable<Integer, GenPolynomial<C>> dl, PairList<C> L)	Constructor.
(package private)	HybridReducerServerEC(int tpn, Terminator fin, ChannelFactory cf, DistHashTable<Integer, GenPolynomial<C>> dl, PairList<C> L)	Constructor.
(package private)	MiReducer(List<GenPolynomial<C>> G, GenPolynomial<C> p)
(package private)	MiReducerClient(List<GenPolynomial<C>> G, GenPolynomial<C> p)
(package private)	MiReducerClientEC(List<GenPolynomial<C>> G, GenPolynomial<C> p)
(package private)	MiReducerClientSeqPair(List<GenPolynomial<C>> G, GenPolynomial<C> p)
(package private)	MiReducerIter(List<GenPolynomial<C>> G, GenPolynomial<C> p)
(package private)	MiReducerSeqPair(List<GenPolynomial<C>> G, GenPolynomial<C> p)
(package private)	MiReducerServer(List<GenPolynomial<C>> G, GenPolynomial<C> p)
(package private)	MiReducerServerEC(List<GenPolynomial<C>> G, GenPolynomial<C> p)
(package private)	MiReducerServerSeqPair(List<GenPolynomial<C>> G, GenPolynomial<C> p)
(package private)	Reducer(Terminator fin, List<GenPolynomial<C>> G, PairList<C> L)
(package private)	ReducerClientEC(SocketChannel pc, DistHashTable<Integer, GenPolynomial<C>> dl)
(package private)	ReducerClientSeqPair(SocketChannel pc, DistHashTable<Integer, GenPolynomial<C>> dl)
(package private)	ReducerIter(Terminator fin, List<GenPolynomial<C>> G, PairList<C> L)
(package private)	ReducerSeqPair(Terminator fin, List<GenPolynomial<C>> G, CriticalPairList<C> L)
(package private)	ReducerServerEC(Terminator fin, ChannelFactory cf, DistHashTable<Integer, GenPolynomial<C>> dl, PairList<C> L)
(package private)	ReducerServerSeqPair(Terminator fin, ChannelFactory cf, DistHashTable<Integer, GenPolynomial<C>> dl, CriticalPairList<C> L)

Uses of GenPolynomial in edu.jas.gbmod

Methods in edu.jas.gbmod that return types with arguments of type GenPolynomial

Modifier and Type	Method	Description
List<GenPolynomial<C>>	ModGroebnerBase.GB(int modv, List<GenPolynomial<C>> F)	Deprecated. Groebner base using pairlist class.
List<GenPolynomial<C>>	ModGroebnerBaseSeq.GB(int modv, List<GenPolynomial<C>> F)	Deprecated. Groebner base using pairlist class.

Method parameters in edu.jas.gbmod with type arguments of type GenPolynomial

Modifier and Type	Method	Description
List<GenPolynomial<C>>	ModGroebnerBase.GB(int modv, List<GenPolynomial<C>> F)	Deprecated. Groebner base using pairlist class.
List<GenPolynomial<C>>	ModGroebnerBaseSeq.GB(int modv, List<GenPolynomial<C>> F)	Deprecated. Groebner base using pairlist class.
boolean	ModGroebnerBase.isGB(int modv, List<GenPolynomial<C>> F)	Deprecated. Module Groebner base test.
boolean	ModGroebnerBaseSeq.isGB(int modv, List<GenPolynomial<C>> F)	Deprecated. Module Groebner base test.

Uses of GenPolynomial in edu.jas.gbufd

Subclasses with type arguments of type GenPolynomial in edu.jas.gbufd

Modifier and Type	Class	Description
class	GroebnerBasePseudoRecParallel<C extends GcdRingElem<C>>	Groebner Base with recursive pseudo reduction multi-threaded parallel algorithm.
class	GroebnerBasePseudoRecSeq<C extends GcdRingElem<C>>	Groebner Base with pseudo reduction sequential algorithm for integral function coefficients.
class	SolvableGroebnerBasePseudoRecSeq<C extends GcdRingElem<C>>	Solvable Groebner Base with pseudo reduction sequential algorithm.
class	WordGroebnerBasePseudoRecSeq<C extends GcdRingElem<C>>	Non-commutative word Groebner Base sequential algorithm.

Fields in edu.jas.gbufd declared as GenPolynomial

Modifier and Type	Field	Description
private GenPolynomial<C>	PseudoMiReducer.H
private GenPolynomial<GenPolynomial<C>>	PseudoMiReducerRec.H
final GenPolynomial<C>	PseudoReductionEntry.pol

Fields in edu.jas.gbufd with type parameters of type GenPolynomial

Modifier and Type	Field	Description
final GroebnerBaseAbstract<GenPolynomial<C>>	GroebnerBaseQuotient.bba
protected BasicLinAlg<GenPolynomial<C>>	SolvableSyzygyAbstract.blas	Linear algebra engine.
protected BasicLinAlg<GenPolynomial<C>>	SyzygyAbstract.blas	Linear algebra engine.
protected final RingFactory<GenPolynomial<C>>	GroebnerBasePseudoRecParallel.cofac	Coefficient ring factory.
protected final RingFactory<GenPolynomial<C>>	GroebnerBasePseudoRecSeq.cofac	Coefficient ring factory.
private final List<GenPolynomial<C>>	PseudoMiReducer.G
private final List<GenPolynomial<GenPolynomial<C>>>	PseudoMiReducerRec.G
private final List<GenPolynomial<GenPolynomial<C>>>	PseudoMiReducerRec.G
private final List<GenPolynomial<C>>	PseudoReducer.G
private final List<GenPolynomial<GenPolynomial<C>>>	PseudoReducerRec.G
private final List<GenPolynomial<GenPolynomial<C>>>	PseudoReducerRec.G
private GenPolynomial<GenPolynomial<C>>	PseudoMiReducerRec.H
final List<GenPolynomial<C>>	MultiplicativeSet.mset	Data structure.
private final PairList<GenPolynomial<C>>	PseudoReducerRec.pairlist
protected GroebnerBaseAbstract<GenPolynomial<C>>	GroebnerBasePartial.rbb	Backing recursive Groebner base engine.
protected final PseudoReduction<GenPolynomial<C>>	GroebnerBasePseudoRecParallel.red	Pseudo reduction engine.
protected final PseudoReduction<GenPolynomial<C>>	GroebnerBasePseudoRecSeq.red	Pseudo reduction engine.
private final PseudoReductionPar<GenPolynomial<C>>	PseudoReducerRec.red
protected final WordPseudoReduction<GenPolynomial<C>>	WordGroebnerBasePseudoRecSeq.red	Reduction engine.
protected final SolvablePseudoReduction<GenPolynomial<C>>	SolvableGroebnerBasePseudoRecSeq.sred	Pseudo reduction engine.

Methods in edu.jas.gbufd that return GenPolynomial

Modifier and Type	Method	Description
GenPolynomial<C>	RReduction.booleanClosure(GenPolynomial<C> A)	Boolean closure, compute idempotent(ldcf(A)) A.
GenPolynomial<C>	RReductionSeq.booleanClosure(GenPolynomial<C> A)	Boolean closure, compute idempotent(ldcf(A)) A.
GenPolynomial<C>	RReduction.booleanRemainder(GenPolynomial<C> A)	Boolean remainder, compute idemComplement(ldcf(A)) A.
GenPolynomial<C>	RReductionSeq.booleanRemainder(GenPolynomial<C> A)	Boolean remainder, compute idemComplement(ldcf(A)) A.
GenPolynomial<C>	CharacteristicSet.characteristicSetReduction(List<GenPolynomial<C>> A, GenPolynomial<C> P)	Characteristic set reduction.
GenPolynomial<C>	CharacteristicSetSimple.characteristicSetReduction(List<GenPolynomial<C>> A, GenPolynomial<C> P)	Characteristic set reduction.
GenPolynomial<C>	CharacteristicSetWu.characteristicSetReduction(List<GenPolynomial<C>> A, GenPolynomial<C> P)	Characteristic set reduction.
static <C extends GcdRingElem<C>> GenPolynomial<C>	PolyGBUtil.chineseRemainderTheorem(List<List<GenPolynomial<C>>> F, List<GenPolynomial<C>> A)	Chinese remainder theorem.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<GenPolynomial<C>>>	PolyGBUtil.coefficientPseudoRemainder(GenPolynomial<GenPolynomial<GenPolynomial<C>>> P, GenPolynomial<GenPolynomial<C>> A)	Polynomial leading coefficient pseudo remainder.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyGBUtil.coefficientPseudoRemainderBase(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<C> A)	Polynomial leading coefficient pseudo remainder, base case.
static <C extends GcdRingElem<C>> GenPolynomial<C>	PolyGBUtil.CRTInterpolation(GenPolynomialRing<C> fac, List<List<C>> E, List<C> V)	Chinese remainder theorem, interpolation.
GenPolynomial<C>	PseudoMiReducer.getNF()	getNF.
GenPolynomial<GenPolynomial<C>>	PseudoMiReducerRec.getNF()	getNF.
GenPolynomial<C>	GroebnerBaseFGLM.lMinterm(List<GenPolynomial<C>> G, GenPolynomial<C> t)	Algorithm lMinterm: MINTERM algorithm for inverse lexicographical term order.
GenPolynomial<C>	PseudoReductionPar.normalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform.
GenPolynomial<C>	PseudoReductionPar.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
GenPolynomial<C>	PseudoReductionSeq.normalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform.
GenPolynomial<C>	PseudoReductionSeq.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
GenPolynomial<C>	RPseudoReductionSeq.normalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform using r-reduction.
GenPolynomial<C>	RPseudoReductionSeq.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
GenPolynomial<C>	RReductionSeq.normalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform using r-reduction.
GenPolynomial<C>	RReductionSeq.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
GenPolynomial<GenPolynomial<C>>	PseudoReduction.normalformRecursive(List<GenPolynomial<GenPolynomial<C>>> Pp, GenPolynomial<GenPolynomial<C>> Ap)	Normalform recursive.
GenPolynomial<GenPolynomial<C>>	PseudoReductionPar.normalformRecursive(List<GenPolynomial<GenPolynomial<C>>> Pp, GenPolynomial<GenPolynomial<C>> Ap)	Normalform recursive.
GenPolynomial<GenPolynomial<C>>	PseudoReductionSeq.normalformRecursive(List<GenPolynomial<GenPolynomial<C>>> Pp, GenPolynomial<GenPolynomial<C>> Ap)	Normalform recursive.
GenPolynomial<GenPolynomial<C>>	RPseudoReductionSeq.normalformRecursive(List<GenPolynomial<GenPolynomial<C>>> Pp, GenPolynomial<GenPolynomial<C>> Ap)	Normalform recursive.
GenPolynomial<C>	WordGroebnerBasePseudoRecSeq.recursiveContent(GenWordPolynomial<GenPolynomial<C>> P)	GenWordPolynomial recursive coefficient content.
GenPolynomial<C>	MultiplicativeSet.removeFactors(GenPolynomial<C> cc)	Remove factors by mset factors division.
static <C extends GcdRingElem<C>> GenPolynomial<C>	PolyModUtil.syzGcd(GenPolynomialRing<C> r, GenPolynomial<C> n, GenPolynomial<C> d)	Greatest common divisor.
static <C extends GcdRingElem<C>> GenPolynomial<C>	PolyModUtil.syzLcm(GenPolynomialRing<C> r, GenPolynomial<C> n, GenPolynomial<C> d)	Least common multiple.
static <C extends RingElem<C>> GenPolynomial<C>	PolyGBUtil.topCoefficientPseudoRemainder(List<GenPolynomial<C>> A, GenPolynomial<C> P)	Top coefficient pseudo remainder of the leading coefficient of P wrt A in the main variables.
static <C extends RingElem<C>> GenPolynomial<C>	PolyGBUtil.topPseudoRemainder(List<GenPolynomial<C>> A, GenPolynomial<C> P)	Top pseudo reduction wrt the main variables.

Methods in edu.jas.gbufd that return types with arguments of type GenPolynomial

Modifier and Type	Method	Description
List<GenPolynomial<C>>	RReductionSeq.booleanClosure(List<GenPolynomial<C>> F)	Boolean closure, compute BC(A) for all A in F.
List<GenPolynomial<C>>	CharacteristicSet.characteristicSet(List<GenPolynomial<C>> A)	Characteristic set.
List<GenPolynomial<C>>	CharacteristicSetSimple.characteristicSet(List<GenPolynomial<C>> A)	Characteristic set.
List<GenPolynomial<C>>	CharacteristicSetWu.characteristicSet(List<GenPolynomial<C>> A)	Characteristic set.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<GenPolynomial<C>>>	PolyGBUtil.coefficientPseudoRemainder(GenPolynomial<GenPolynomial<GenPolynomial<C>>> P, GenPolynomial<GenPolynomial<C>> A)	Polynomial leading coefficient pseudo remainder.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<GenPolynomial<C>>>	PolyGBUtil.coefficientPseudoRemainder(GenPolynomial<GenPolynomial<GenPolynomial<C>>> P, GenPolynomial<GenPolynomial<C>> A)	Polynomial leading coefficient pseudo remainder.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyGBUtil.coefficientPseudoRemainderBase(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<C> A)	Polynomial leading coefficient pseudo remainder, base case.
List<GenPolynomial<C>>	GroebnerBaseFGLM.convGroebnerToLex(List<GenPolynomial<C>> groebnerBasis)	Algorithm CONVGROEBNER: Converts Groebner bases w.r.t.
List<GenPolynomial<C>>	GroebnerBaseFGLM.GB(int modv, List<GenPolynomial<C>> F)	Groebner base using FGLM algorithm.
List<GenPolynomial<C>>	GroebnerBasePartial.GB(int modv, List<GenPolynomial<C>> F)	Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBasePseudoParallel.GB(int modv, List<GenPolynomial<C>> F)	Groebner base using pairlist class.
List<GenPolynomial<GenPolynomial<C>>>	GroebnerBasePseudoRecParallel.GB(int modv, List<GenPolynomial<GenPolynomial<C>>> F)	Groebner base using pairlist class.
List<GenPolynomial<GenPolynomial<C>>>	GroebnerBasePseudoRecParallel.GB(int modv, List<GenPolynomial<GenPolynomial<C>>> F)	Groebner base using pairlist class.
List<GenPolynomial<GenPolynomial<C>>>	GroebnerBasePseudoRecSeq.GB(int modv, List<GenPolynomial<GenPolynomial<C>>> F)	Groebner base using pairlist class.
List<GenPolynomial<GenPolynomial<C>>>	GroebnerBasePseudoRecSeq.GB(int modv, List<GenPolynomial<GenPolynomial<C>>> F)	Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBasePseudoSeq.GB(int modv, List<GenPolynomial<C>> F)	Groebner base using pairlist class.
List<GenPolynomial<Quotient<C>>>	GroebnerBaseQuotient.GB(int modv, List<GenPolynomial<Quotient<C>>> F)	Groebner base using fraction free computation.
List<GenPolynomial<BigRational>>	GroebnerBaseRational.GB(int modv, List<GenPolynomial<BigRational>> F)	Groebner base using fraction free computation.
List<GenPolynomial<C>>	GroebnerBaseWalk.GB(int modv, List<GenPolynomial<C>> F)	Groebner base using Groebner Walk algorithm.
List<GenPolynomial<C>>	RGroebnerBasePseudoSeq.GB(int modv, List<GenPolynomial<C>> F)	R-Groebner base using pairlist class.
List<GenPolynomial<C>>	RGroebnerBaseSeq.GB(int modv, List<GenPolynomial<C>> F)	R-Groebner base using pairlist class.
List<GenWordPolynomial<GenPolynomial<C>>>	WordGroebnerBasePseudoRecSeq.GB(List<GenWordPolynomial<GenPolynomial<C>>> F)	Word Groebner base using word pairlist class.
static <C extends GcdRingElem<C>> GroebnerBaseAbstract<GenPolynomial<C>>	GBFactory.getImplementation(GenPolynomialRing<C> fac)	Determine suitable implementation of GB algorithms, case (recursive) polynomial.
static <C extends GcdRingElem<C>> GroebnerBaseAbstract<GenPolynomial<C>>	GBFactory.getImplementation(GenPolynomialRing<C> fac, PairList<GenPolynomial<C>> pl)	Determine suitable implementation of GB algorithms, case (recursive) polynomial.
static <C extends GcdRingElem<C>> GroebnerBaseAbstract<GenPolynomial<C>>	GBFactory.getImplementation(GenPolynomialRing<C> fac, GBFactory.Algo a)	Determine suitable implementation of GB algorithms, case (recursive) polynomial.
static <C extends GcdRingElem<C>> GroebnerBaseAbstract<GenPolynomial<C>>	GBFactory.getImplementation(GenPolynomialRing<C> fac, GBFactory.Algo a, PairList<GenPolynomial<C>> pl)	Determine suitable implementation of GB algorithms, case (recursive) polynomial.
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<GenPolynomial<C>>	SGBFactory.getImplementation(GenPolynomialRing<C> fac)	Determine suitable implementation of GB algorithms, case (recursive) polynomial.
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<GenPolynomial<C>>	SGBFactory.getImplementation(GenPolynomialRing<C> fac, PairList<GenPolynomial<C>> pl)	Determine suitable implementation of GB algorithms, case (recursive) polynomial.
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<GenPolynomial<C>>	SGBFactory.getImplementation(GenPolynomialRing<C> fac, GBFactory.Algo a)	Determine suitable implementation of GB algorithms, case (recursive) polynomial.
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<GenPolynomial<C>>	SGBFactory.getImplementation(GenPolynomialRing<C> fac, GBFactory.Algo a, PairList<GenPolynomial<C>> pl)	Determine suitable implementation of GB algorithms, case (recursive) polynomial.
GenPolynomial<GenPolynomial<C>>	PseudoMiReducerRec.getNF()	getNF.
static <C extends GcdRingElem<C>> GroebnerBaseAbstract<GenPolynomial<C>>	GBFactory.getProxy(GenPolynomialRing<C> fac)	Determine suitable parallel/concurrent implementation of GB algorithms if possible.
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<GenPolynomial<C>>	SGBFactory.getProxy(GenPolynomialRing<C> fac)	Determine suitable parallel/concurrent implementation of GB algorithms if possible.
static <C extends GcdRingElem<C>> List<GenPolynomial<C>>	PolyGBUtil.intersect(GenPolynomialRing<C> pfac, List<GenPolynomial<C>> A, List<GenPolynomial<C>> B)	Intersection.
List<GenPolynomial<C>>	RReductionSeq.irreducibleSet(List<GenPolynomial<C>> Pp)	Irreducible set.
List<GenSolvablePolynomial<GenPolynomial<C>>>	SolvableGroebnerBasePseudoRecSeq.leftGB(int modv, List<GenSolvablePolynomial<GenPolynomial<C>>> F)	Left Groebner base using pairlist class.
List<GenSolvablePolynomial<GenPolynomial<C>>>	SolvableGroebnerBasePseudoRecSeq.leftMinimalGB(List<GenSolvablePolynomial<GenPolynomial<C>>> Gp)	Minimal ordered Solvable Groebner basis.
GenSolvablePolynomial<GenPolynomial<C>>	SolvablePseudoReduction.leftNormalformRecursive(List<GenSolvablePolynomial<GenPolynomial<C>>> Pp, GenSolvablePolynomial<GenPolynomial<C>> Ap)	Left normalform recursive.
GenSolvablePolynomial<GenPolynomial<C>>	SolvablePseudoReductionSeq.leftNormalformRecursive(List<GenSolvablePolynomial<GenPolynomial<C>>> Pp, GenSolvablePolynomial<GenPolynomial<C>> Ap)	Left normalform recursive.
List<GenPolynomial<C>>	GroebnerBaseWalk.liftReductas(List<Monomial<C>> M, List<Monomial<C>> Mp, List<GenPolynomial<C>> G, List<GenPolynomial<C>> A)	Lift leading polynomials to full Groebner base with respect to term order.
List<GenPolynomial<C>>	GroebnerBasePseudoParallel.minimalGB(List<GenPolynomial<C>> Gp)	Minimal ordered Groebner basis.
List<GenPolynomial<GenPolynomial<C>>>	GroebnerBasePseudoRecParallel.minimalGB(List<GenPolynomial<GenPolynomial<C>>> Gp)	Minimal ordered Groebner basis.
List<GenPolynomial<GenPolynomial<C>>>	GroebnerBasePseudoRecParallel.minimalGB(List<GenPolynomial<GenPolynomial<C>>> Gp)	Minimal ordered Groebner basis.
List<GenPolynomial<GenPolynomial<C>>>	GroebnerBasePseudoRecSeq.minimalGB(List<GenPolynomial<GenPolynomial<C>>> Gp)	Minimal ordered Groebner basis.
List<GenPolynomial<GenPolynomial<C>>>	GroebnerBasePseudoRecSeq.minimalGB(List<GenPolynomial<GenPolynomial<C>>> Gp)	Minimal ordered Groebner basis.
List<GenPolynomial<C>>	GroebnerBasePseudoSeq.minimalGB(List<GenPolynomial<C>> Gp)	Minimal ordered Groebner basis.
List<GenPolynomial<Quotient<C>>>	GroebnerBaseQuotient.minimalGB(List<GenPolynomial<Quotient<C>>> Gp)	Minimal ordered Groebner basis.
List<GenPolynomial<BigRational>>	GroebnerBaseRational.minimalGB(List<GenPolynomial<BigRational>> Gp)	Minimal ordered Groebner basis.
List<GenPolynomial<C>>	RGroebnerBasePseudoSeq.minimalGB(List<GenPolynomial<C>> Gp)	Minimal ordered Groebner basis.
List<GenPolynomial<C>>	RGroebnerBaseSeq.minimalGB(List<GenPolynomial<C>> Gp)	Minimal ordered Groebner basis.
List<GenWordPolynomial<GenPolynomial<C>>>	WordGroebnerBasePseudoRecSeq.minimalGB(List<GenWordPolynomial<GenPolynomial<C>>> Gp)	Minimal ordered Groebner basis.
(package private) List<GenPolynomial<C>>	RGroebnerBasePseudoSeq.minimalGBtesting(List<GenPolynomial<C>> Gp)
GenPolynomial<GenPolynomial<C>>	PseudoReduction.normalformRecursive(List<GenPolynomial<GenPolynomial<C>>> Pp, GenPolynomial<GenPolynomial<C>> Ap)	Normalform recursive.
GenPolynomial<GenPolynomial<C>>	PseudoReductionPar.normalformRecursive(List<GenPolynomial<GenPolynomial<C>>> Pp, GenPolynomial<GenPolynomial<C>> Ap)	Normalform recursive.
GenPolynomial<GenPolynomial<C>>	PseudoReductionSeq.normalformRecursive(List<GenPolynomial<GenPolynomial<C>>> Pp, GenPolynomial<GenPolynomial<C>> Ap)	Normalform recursive.
GenPolynomial<GenPolynomial<C>>	RPseudoReductionSeq.normalformRecursive(List<GenPolynomial<GenPolynomial<C>>> Pp, GenPolynomial<GenPolynomial<C>> Ap)	Normalform recursive.
GenWordPolynomial<GenPolynomial<C>>	WordPseudoReduction.normalformRecursive(List<GenWordPolynomial<GenPolynomial<C>>> Pp, GenWordPolynomial<GenPolynomial<C>> Ap)	Left normalform recursive.
GenWordPolynomial<GenPolynomial<C>>	WordPseudoReductionSeq.normalformRecursive(List<GenWordPolynomial<GenPolynomial<C>>> Pp, GenWordPolynomial<GenPolynomial<C>> Ap)	Normalform with polynomial coefficients.
OptimizedPolynomialList<GenPolynomial<C>>	GroebnerBasePartial.partialGBrec(List<GenPolynomial<C>> F, String[] pvars)	Partial recursive Groebner base for specific variables.
GenWordPolynomial<GenPolynomial<C>>	WordGroebnerBasePseudoRecSeq.recursivePrimitivePart(GenWordPolynomial<GenPolynomial<C>> P)	GenWordPolynomial recursive coefficient primitive part.
List<GenWordPolynomial<GenPolynomial<C>>>	WordGroebnerBasePseudoRecSeq.recursivePrimitivePart(List<GenWordPolynomial<GenPolynomial<C>>> F)	List of GenWordPolynomial recursive coefficient primitive part.
List<GenPolynomial<C>>	GroebnerBaseFGLM.redTerms(List<GenPolynomial<C>> groebnerBasis)	Compute the residues to given polynomial list.
List<GenPolynomial<C>>	RReduction.reducedBooleanClosure(List<GenPolynomial<C>> F)	Reduced boolean closure, compute BC(A) for all A in F.
List<GenPolynomial<C>>	RReduction.reducedBooleanClosure(List<GenPolynomial<C>> F, GenPolynomial<C> A)	Reduced boolean closure, compute BC(A) modulo F.
List<GenPolynomial<C>>	RReductionSeq.reducedBooleanClosure(List<GenPolynomial<C>> F)	Reduced boolean closure, compute BC(A) for all A in F.
List<GenPolynomial<C>>	RReductionSeq.reducedBooleanClosure(List<GenPolynomial<C>> F, GenPolynomial<C> A)	Reduced boolean closure, compute BC(A) modulo F.
List<GenPolynomial<C>>	MultiplicativeSet.removeFactors(List<GenPolynomial<C>> L)	Remove factors by mset factors division.
GenSolvablePolynomial<GenPolynomial<C>>	SolvablePseudoReduction.rightNormalformRecursive(List<GenSolvablePolynomial<GenPolynomial<C>>> Pp, GenSolvablePolynomial<GenPolynomial<C>> Ap)	Right normalform recursive.
GenSolvablePolynomial<GenPolynomial<C>>	SolvablePseudoReductionSeq.rightNormalformRecursive(List<GenSolvablePolynomial<GenPolynomial<C>>> Pp, GenSolvablePolynomial<GenPolynomial<C>> Ap)	Right normalform recursive.
static <C extends GcdRingElem<C>> List<GenPolynomial<C>>	PolyGBUtil.subRing(List<GenPolynomial<C>> A)	Subring generators.
List<GenSolvablePolynomial<GenPolynomial<C>>>	SolvableGroebnerBasePseudoRecSeq.twosidedGB(int modv, List<GenSolvablePolynomial<GenPolynomial<C>>> Fp)	Twosided Solvable Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBaseWalk.walkGroebnerToTarget(int modv, List<GenPolynomial<C>> Gl, GenPolynomialRing<C> ufac)	Converts Groebner bases w.r.t.
static <C extends RingElem<C>> List<GenPolynomial<C>>	PolyGBUtil.zeroDegrees(List<GenPolynomial<C>> A)	Extract polynomials with degree zero in the main variable.
List<List<GenPolynomial<C>>>	Syzygy.zeroRelations(int modv, GenVector<GenPolynomial<C>> v)	Syzygy module from Groebner base.
List<List<GenPolynomial<C>>>	Syzygy.zeroRelations(int modv, List<GenPolynomial<C>> F)	Syzygy module from Groebner base.
List<List<GenPolynomial<C>>>	Syzygy.zeroRelations(List<GenPolynomial<C>> F)	Syzygy module from Groebner base.
List<List<GenPolynomial<C>>>	SyzygyAbstract.zeroRelations(int modv, GenVector<GenPolynomial<C>> v)	Syzygy module from Groebner base.
List<List<GenPolynomial<C>>>	SyzygyAbstract.zeroRelations(int modv, List<GenPolynomial<C>> F)	Syzygy module from Groebner base.
List<List<GenPolynomial<C>>>	SyzygyAbstract.zeroRelations(List<GenPolynomial<C>> F)	Syzygy module from Groebner base.
List<List<GenPolynomial<C>>>	Syzygy.zeroRelationsArbitrary(int modv, List<GenPolynomial<C>> F)	Syzygy module from arbitrary base.
List<List<GenPolynomial<C>>>	Syzygy.zeroRelationsArbitrary(List<GenPolynomial<C>> F)	Syzygy module from arbitrary base.
List<List<GenPolynomial<C>>>	SyzygyAbstract.zeroRelationsArbitrary(List<GenPolynomial<C>> F)	Syzygy module from arbitrary base.
List<List<GenPolynomial<C>>>	SyzygySeq.zeroRelationsArbitrary(int modv, List<GenPolynomial<C>> F)	Syzygy module from arbitrary base.

Methods in edu.jas.gbufd with parameters of type GenPolynomial

Modifier and Type	Method	Description
MultiplicativeSet<C>	MultiplicativeSet.add(GenPolynomial<C> cc)	Add polynomial to mset.
MultiplicativeSetCoPrime<C>	MultiplicativeSetCoPrime.add(GenPolynomial<C> cc)	Add polynomial to mset.
MultiplicativeSetFactors<C>	MultiplicativeSetFactors.add(GenPolynomial<C> cc)	Add polynomial to mset.
MultiplicativeSetSquarefree<C>	MultiplicativeSetSquarefree.add(GenPolynomial<C> cc)	Add polynomial to mset.
GenPolynomial<C>	RReduction.booleanClosure(GenPolynomial<C> A)	Boolean closure, compute idempotent(ldcf(A)) A.
GenPolynomial<C>	RReductionSeq.booleanClosure(GenPolynomial<C> A)	Boolean closure, compute idempotent(ldcf(A)) A.
GenPolynomial<C>	RReduction.booleanRemainder(GenPolynomial<C> A)	Boolean remainder, compute idemComplement(ldcf(A)) A.
GenPolynomial<C>	RReductionSeq.booleanRemainder(GenPolynomial<C> A)	Boolean remainder, compute idemComplement(ldcf(A)) A.
GenPolynomial<C>	CharacteristicSet.characteristicSetReduction(List<GenPolynomial<C>> A, GenPolynomial<C> P)	Characteristic set reduction.
GenPolynomial<C>	CharacteristicSetSimple.characteristicSetReduction(List<GenPolynomial<C>> A, GenPolynomial<C> P)	Characteristic set reduction.
GenPolynomial<C>	CharacteristicSetWu.characteristicSetReduction(List<GenPolynomial<C>> A, GenPolynomial<C> P)	Characteristic set reduction.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<GenPolynomial<C>>>	PolyGBUtil.coefficientPseudoRemainder(GenPolynomial<GenPolynomial<GenPolynomial<C>>> P, GenPolynomial<GenPolynomial<C>> A)	Polynomial leading coefficient pseudo remainder.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyGBUtil.coefficientPseudoRemainderBase(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<C> A)	Polynomial leading coefficient pseudo remainder, base case.
boolean	MultiplicativeSet.contains(GenPolynomial<C> c)	Test if a polynomial is contained in this multiplicative set.
boolean	RReductionSeq.criterion4(GenPolynomial<C> A, GenPolynomial<C> B)	GB criterium 4.
boolean	RReductionSeq.criterion4(GenPolynomial<C> A, GenPolynomial<C> B, ExpVector e)	GB criterium 4.
boolean	RReduction.isBooleanClosed(GenPolynomial<C> A)	Is boolean closed, test if A == idempotent(ldcf(A)) A.
boolean	RReductionSeq.isBooleanClosed(GenPolynomial<C> A)	Is boolean closed, test if A == idempotent(ldcf(A)) A.
static <C extends GcdRingElem<C>> boolean	PolyGBUtil.isChineseRemainder(List<List<GenPolynomial<C>>> F, List<GenPolynomial<C>> A, GenPolynomial<C> h)	Is Chinese remainder.
boolean	RReductionSeq.isNormalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Is in Normalform.
static <C extends GcdRingElem<C>> boolean	PolyGBUtil.isResultant(GenPolynomial<C> A, GenPolynomial<C> B, GenPolynomial<C> r)	Test for resultant.
boolean	RReduction.isStrongTopReducible(List<GenPolynomial<C>> P, GenPolynomial<C> A)	Is strong top reducible.
boolean	RReductionSeq.isStrongTopReducible(List<GenPolynomial<C>> P, GenPolynomial<C> A)	Is strong top reducible.
boolean	RReductionSeq.isTopReducible(List<GenPolynomial<C>> P, GenPolynomial<C> A)	Is top reducible.
GenPolynomial<C>	GroebnerBaseFGLM.lMinterm(List<GenPolynomial<C>> G, GenPolynomial<C> t)	Algorithm lMinterm: MINTERM algorithm for inverse lexicographical term order.
GenPolynomial<C>	PseudoReductionPar.normalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform.
GenPolynomial<C>	PseudoReductionPar.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
GenPolynomial<C>	PseudoReductionSeq.normalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform.
GenPolynomial<C>	PseudoReductionSeq.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
GenPolynomial<C>	RPseudoReductionSeq.normalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform using r-reduction.
GenPolynomial<C>	RPseudoReductionSeq.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
GenPolynomial<C>	RReductionSeq.normalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform using r-reduction.
GenPolynomial<C>	RReductionSeq.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
PseudoReductionEntry<C>	PseudoReduction.normalformFactor(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with multiplication factor.
PseudoReductionEntry<C>	PseudoReductionPar.normalformFactor(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform.
PseudoReductionEntry<C>	PseudoReductionSeq.normalformFactor(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform.
PseudoReductionEntry<C>	RPseudoReductionSeq.normalformFactor(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform using r-reduction.
GenPolynomial<GenPolynomial<C>>	PseudoReduction.normalformRecursive(List<GenPolynomial<GenPolynomial<C>>> Pp, GenPolynomial<GenPolynomial<C>> Ap)	Normalform recursive.
GenPolynomial<GenPolynomial<C>>	PseudoReductionPar.normalformRecursive(List<GenPolynomial<GenPolynomial<C>>> Pp, GenPolynomial<GenPolynomial<C>> Ap)	Normalform recursive.
GenPolynomial<GenPolynomial<C>>	PseudoReductionSeq.normalformRecursive(List<GenPolynomial<GenPolynomial<C>>> Pp, GenPolynomial<GenPolynomial<C>> Ap)	Normalform recursive.
GenPolynomial<GenPolynomial<C>>	RPseudoReductionSeq.normalformRecursive(List<GenPolynomial<GenPolynomial<C>>> Pp, GenPolynomial<GenPolynomial<C>> Ap)	Normalform recursive.
List<GenPolynomial<C>>	RReduction.reducedBooleanClosure(List<GenPolynomial<C>> F, GenPolynomial<C> A)	Reduced boolean closure, compute BC(A) modulo F.
List<GenPolynomial<C>>	RReductionSeq.reducedBooleanClosure(List<GenPolynomial<C>> F, GenPolynomial<C> A)	Reduced boolean closure, compute BC(A) modulo F.
GenPolynomial<C>	MultiplicativeSet.removeFactors(GenPolynomial<C> cc)	Remove factors by mset factors division.
static <C extends GcdRingElem<C>> boolean	PolyGBUtil.subRingAndMember(List<GenPolynomial<C>> A, GenPolynomial<C> g)	Subring and membership test.
static <C extends GcdRingElem<C>> boolean	PolyGBUtil.subRingMember(List<GenPolynomial<C>> A, GenPolynomial<C> g)	Subring membership.
static <C extends GcdRingElem<C>> GenPolynomial<C>	PolyModUtil.syzGcd(GenPolynomialRing<C> r, GenPolynomial<C> n, GenPolynomial<C> d)	Greatest common divisor.
static <C extends GcdRingElem<C>> GenPolynomial<C>	PolyModUtil.syzLcm(GenPolynomialRing<C> r, GenPolynomial<C> n, GenPolynomial<C> d)	Least common multiple.
static <C extends RingElem<C>> GenPolynomial<C>	PolyGBUtil.topCoefficientPseudoRemainder(List<GenPolynomial<C>> A, GenPolynomial<C> P)	Top coefficient pseudo remainder of the leading coefficient of P wrt A in the main variables.
static <C extends RingElem<C>> GenPolynomial<C>	PolyGBUtil.topPseudoRemainder(List<GenPolynomial<C>> A, GenPolynomial<C> P)	Top pseudo reduction wrt the main variables.

Method parameters in edu.jas.gbufd with type arguments of type GenPolynomial

Modifier and Type	Method	Description
int	GroebnerBaseFGLMExamples.bitHeight(List<GenPolynomial<BigRational>> list)	Method bitHeight returns the bitlength of the greatest number occurring during the computation of a Groebner base.
List<GenPolynomial<C>>	RReductionSeq.booleanClosure(List<GenPolynomial<C>> F)	Boolean closure, compute BC(A) for all A in F.
List<GenPolynomial<C>>	CharacteristicSet.characteristicSet(List<GenPolynomial<C>> A)	Characteristic set.
List<GenPolynomial<C>>	CharacteristicSetSimple.characteristicSet(List<GenPolynomial<C>> A)	Characteristic set.
List<GenPolynomial<C>>	CharacteristicSetWu.characteristicSet(List<GenPolynomial<C>> A)	Characteristic set.
GenPolynomial<C>	CharacteristicSet.characteristicSetReduction(List<GenPolynomial<C>> A, GenPolynomial<C> P)	Characteristic set reduction.
GenPolynomial<C>	CharacteristicSetSimple.characteristicSetReduction(List<GenPolynomial<C>> A, GenPolynomial<C> P)	Characteristic set reduction.
GenPolynomial<C>	CharacteristicSetWu.characteristicSetReduction(List<GenPolynomial<C>> A, GenPolynomial<C> P)	Characteristic set reduction.
static <C extends GcdRingElem<C>> GenPolynomial<C>	PolyGBUtil.chineseRemainderTheorem(List<List<GenPolynomial<C>>> F, List<GenPolynomial<C>> A)	Chinese remainder theorem.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<GenPolynomial<C>>>	PolyGBUtil.coefficientPseudoRemainder(GenPolynomial<GenPolynomial<GenPolynomial<C>>> P, GenPolynomial<GenPolynomial<C>> A)	Polynomial leading coefficient pseudo remainder.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<GenPolynomial<C>>>	PolyGBUtil.coefficientPseudoRemainder(GenPolynomial<GenPolynomial<GenPolynomial<C>>> P, GenPolynomial<GenPolynomial<C>> A)	Polynomial leading coefficient pseudo remainder.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyGBUtil.coefficientPseudoRemainderBase(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<C> A)	Polynomial leading coefficient pseudo remainder, base case.
boolean	MultiplicativeSet.contains(List<GenPolynomial<C>> L)	Test if a list of polynomials is contained in multiplicative set.
List<GenPolynomial<C>>	GroebnerBaseFGLM.convGroebnerToLex(List<GenPolynomial<C>> groebnerBasis)	Algorithm CONVGROEBNER: Converts Groebner bases w.r.t.
OptimizedPolynomialList<C>	GroebnerBasePartial.elimPartialGB(List<GenPolynomial<C>> F, String[] evars, String[] pvars)	Partial Groebner base for specific variables.
List<GenPolynomial<C>>	GroebnerBaseFGLM.GB(int modv, List<GenPolynomial<C>> F)	Groebner base using FGLM algorithm.
List<GenPolynomial<C>>	GroebnerBasePartial.GB(int modv, List<GenPolynomial<C>> F)	Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBasePseudoParallel.GB(int modv, List<GenPolynomial<C>> F)	Groebner base using pairlist class.
List<GenPolynomial<GenPolynomial<C>>>	GroebnerBasePseudoRecParallel.GB(int modv, List<GenPolynomial<GenPolynomial<C>>> F)	Groebner base using pairlist class.
List<GenPolynomial<GenPolynomial<C>>>	GroebnerBasePseudoRecParallel.GB(int modv, List<GenPolynomial<GenPolynomial<C>>> F)	Groebner base using pairlist class.
List<GenPolynomial<GenPolynomial<C>>>	GroebnerBasePseudoRecSeq.GB(int modv, List<GenPolynomial<GenPolynomial<C>>> F)	Groebner base using pairlist class.
List<GenPolynomial<GenPolynomial<C>>>	GroebnerBasePseudoRecSeq.GB(int modv, List<GenPolynomial<GenPolynomial<C>>> F)	Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBasePseudoSeq.GB(int modv, List<GenPolynomial<C>> F)	Groebner base using pairlist class.
List<GenPolynomial<Quotient<C>>>	GroebnerBaseQuotient.GB(int modv, List<GenPolynomial<Quotient<C>>> F)	Groebner base using fraction free computation.
List<GenPolynomial<BigRational>>	GroebnerBaseRational.GB(int modv, List<GenPolynomial<BigRational>> F)	Groebner base using fraction free computation.
List<GenPolynomial<C>>	GroebnerBaseWalk.GB(int modv, List<GenPolynomial<C>> F)	Groebner base using Groebner Walk algorithm.
List<GenPolynomial<C>>	RGroebnerBasePseudoSeq.GB(int modv, List<GenPolynomial<C>> F)	R-Groebner base using pairlist class.
List<GenPolynomial<C>>	RGroebnerBaseSeq.GB(int modv, List<GenPolynomial<C>> F)	R-Groebner base using pairlist class.
List<GenWordPolynomial<GenPolynomial<C>>>	WordGroebnerBasePseudoRecSeq.GB(List<GenWordPolynomial<GenPolynomial<C>>> F)	Word Groebner base using word pairlist class.
static <C extends GcdRingElem<C>> GroebnerBaseAbstract<GenPolynomial<C>>	GBFactory.getImplementation(GenPolynomialRing<C> fac, PairList<GenPolynomial<C>> pl)	Determine suitable implementation of GB algorithms, case (recursive) polynomial.
static <C extends GcdRingElem<C>> GroebnerBaseAbstract<GenPolynomial<C>>	GBFactory.getImplementation(GenPolynomialRing<C> fac, GBFactory.Algo a, PairList<GenPolynomial<C>> pl)	Determine suitable implementation of GB algorithms, case (recursive) polynomial.
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<GenPolynomial<C>>	SGBFactory.getImplementation(GenPolynomialRing<C> fac, PairList<GenPolynomial<C>> pl)	Determine suitable implementation of GB algorithms, case (recursive) polynomial.
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<GenPolynomial<C>>	SGBFactory.getImplementation(GenPolynomialRing<C> fac, GBFactory.Algo a, PairList<GenPolynomial<C>> pl)	Determine suitable implementation of GB algorithms, case (recursive) polynomial.
static <C extends GcdRingElem<C>> List<GenPolynomial<C>>	PolyGBUtil.intersect(GenPolynomialRing<C> pfac, List<GenPolynomial<C>> A, List<GenPolynomial<C>> B)	Intersection.
List<GenPolynomial<C>>	RReductionSeq.irreducibleSet(List<GenPolynomial<C>> Pp)	Irreducible set.
boolean	RReduction.isBooleanClosed(List<GenPolynomial<C>> F)	Is boolean closed, test if all A in F are boolean closed.
boolean	RReductionSeq.isBooleanClosed(List<GenPolynomial<C>> F)	Is boolean closed, test if all A in F are boolean closed.
boolean	CharacteristicSet.isCharacteristicSet(List<GenPolynomial<C>> A)	Characteristic set test.
boolean	CharacteristicSetSimple.isCharacteristicSet(List<GenPolynomial<C>> A)	Characteristic set test.
boolean	CharacteristicSetWu.isCharacteristicSet(List<GenPolynomial<C>> A)	Characteristic set test.
static <C extends GcdRingElem<C>> boolean	PolyGBUtil.isChineseRemainder(List<List<GenPolynomial<C>>> F, List<GenPolynomial<C>> A, GenPolynomial<C> h)	Is Chinese remainder.
boolean	RGroebnerBaseSeq.isGB(int modv, List<GenPolynomial<C>> F)	R-Groebner base test.
boolean	WordGroebnerBasePseudoRecSeq.isGB(List<GenWordPolynomial<GenPolynomial<C>>> F)	Wird Groebner base simple test.
boolean	GroebnerBasePartial.isGBrec(int modv, List<GenPolynomial<GenPolynomial<C>>> F)	Groebner base test.
boolean	GroebnerBasePartial.isGBrec(int modv, List<GenPolynomial<GenPolynomial<C>>> F)	Groebner base test.
boolean	GroebnerBasePartial.isGBrec(List<GenPolynomial<GenPolynomial<C>>> F)	Groebner base test.
boolean	GroebnerBasePartial.isGBrec(List<GenPolynomial<GenPolynomial<C>>> F)	Groebner base test.
boolean	GroebnerBasePseudoRecParallel.isGBsimple(int modv, List<GenPolynomial<GenPolynomial<C>>> F)	Groebner base simple test.
boolean	GroebnerBasePseudoRecParallel.isGBsimple(int modv, List<GenPolynomial<GenPolynomial<C>>> F)	Groebner base simple test.
boolean	GroebnerBasePseudoRecSeq.isGBsimple(int modv, List<GenPolynomial<GenPolynomial<C>>> F)	Groebner base simple test.
boolean	GroebnerBasePseudoRecSeq.isGBsimple(int modv, List<GenPolynomial<GenPolynomial<C>>> F)	Groebner base simple test.
boolean	SolvableGroebnerBasePseudoRecSeq.isLeftGBidem(int modv, List<GenSolvablePolynomial<GenPolynomial<C>>> F)	Left Groebner base idempotence test.
boolean	SolvableGroebnerBasePseudoRecSeq.isLeftGBsimple(int modv, List<GenSolvablePolynomial<GenPolynomial<C>>> F)	Left Groebner base test.
boolean	RReductionSeq.isNormalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Is in Normalform.
boolean	RReductionSeq.isReducedBooleanClosed(List<GenPolynomial<C>> F)	Is reduced boolean closed, test if all A in F are boolean closed or br(A) reduces to zero.
boolean	RReduction.isStrongTopReducible(List<GenPolynomial<C>> P, GenPolynomial<C> A)	Is strong top reducible.
boolean	RReductionSeq.isStrongTopReducible(List<GenPolynomial<C>> P, GenPolynomial<C> A)	Is strong top reducible.
boolean	RReductionSeq.isTopReducible(List<GenPolynomial<C>> P, GenPolynomial<C> A)	Is top reducible.
boolean	SolvableGroebnerBasePseudoRecSeq.isTwosidedGB(int modv, List<GenSolvablePolynomial<GenPolynomial<C>>> Fp)	Twosided Groebner base test.
boolean	Syzygy.isZeroRelation(List<List<GenPolynomial<C>>> Z, List<GenPolynomial<C>> F)	Test if sysygy.
boolean	SyzygyAbstract.isZeroRelation(List<List<GenPolynomial<C>>> Z, List<GenPolynomial<C>> F)	Test if sysygy.
List<GenSolvablePolynomial<GenPolynomial<C>>>	SolvableGroebnerBasePseudoRecSeq.leftGB(int modv, List<GenSolvablePolynomial<GenPolynomial<C>>> F)	Left Groebner base using pairlist class.
List<GenSolvablePolynomial<GenPolynomial<C>>>	SolvableGroebnerBasePseudoRecSeq.leftMinimalGB(List<GenSolvablePolynomial<GenPolynomial<C>>> Gp)	Minimal ordered Solvable Groebner basis.
GenSolvablePolynomial<GenPolynomial<C>>	SolvablePseudoReduction.leftNormalformRecursive(List<GenSolvablePolynomial<GenPolynomial<C>>> Pp, GenSolvablePolynomial<GenPolynomial<C>> Ap)	Left normalform recursive.
GenSolvablePolynomial<GenPolynomial<C>>	SolvablePseudoReduction.leftNormalformRecursive(List<GenSolvablePolynomial<GenPolynomial<C>>> Pp, GenSolvablePolynomial<GenPolynomial<C>> Ap)	Left normalform recursive.
GenSolvablePolynomial<GenPolynomial<C>>	SolvablePseudoReductionSeq.leftNormalformRecursive(List<GenSolvablePolynomial<GenPolynomial<C>>> Pp, GenSolvablePolynomial<GenPolynomial<C>> Ap)	Left normalform recursive.
GenSolvablePolynomial<GenPolynomial<C>>	SolvablePseudoReductionSeq.leftNormalformRecursive(List<GenSolvablePolynomial<GenPolynomial<C>>> Pp, GenSolvablePolynomial<GenPolynomial<C>> Ap)	Left normalform recursive.
GenPolynomial<C>	GroebnerBaseFGLM.lMinterm(List<GenPolynomial<C>> G, GenPolynomial<C> t)	Algorithm lMinterm: MINTERM algorithm for inverse lexicographical term order.
List<GenPolynomial<C>>	GroebnerBasePseudoParallel.minimalGB(List<GenPolynomial<C>> Gp)	Minimal ordered Groebner basis.
List<GenPolynomial<GenPolynomial<C>>>	GroebnerBasePseudoRecParallel.minimalGB(List<GenPolynomial<GenPolynomial<C>>> Gp)	Minimal ordered Groebner basis.
List<GenPolynomial<GenPolynomial<C>>>	GroebnerBasePseudoRecParallel.minimalGB(List<GenPolynomial<GenPolynomial<C>>> Gp)	Minimal ordered Groebner basis.
List<GenPolynomial<GenPolynomial<C>>>	GroebnerBasePseudoRecSeq.minimalGB(List<GenPolynomial<GenPolynomial<C>>> Gp)	Minimal ordered Groebner basis.
List<GenPolynomial<GenPolynomial<C>>>	GroebnerBasePseudoRecSeq.minimalGB(List<GenPolynomial<GenPolynomial<C>>> Gp)	Minimal ordered Groebner basis.
List<GenPolynomial<C>>	GroebnerBasePseudoSeq.minimalGB(List<GenPolynomial<C>> Gp)	Minimal ordered Groebner basis.
List<GenPolynomial<Quotient<C>>>	GroebnerBaseQuotient.minimalGB(List<GenPolynomial<Quotient<C>>> Gp)	Minimal ordered Groebner basis.
List<GenPolynomial<BigRational>>	GroebnerBaseRational.minimalGB(List<GenPolynomial<BigRational>> Gp)	Minimal ordered Groebner basis.
List<GenPolynomial<C>>	RGroebnerBasePseudoSeq.minimalGB(List<GenPolynomial<C>> Gp)	Minimal ordered Groebner basis.
List<GenPolynomial<C>>	RGroebnerBaseSeq.minimalGB(List<GenPolynomial<C>> Gp)	Minimal ordered Groebner basis.
List<GenWordPolynomial<GenPolynomial<C>>>	WordGroebnerBasePseudoRecSeq.minimalGB(List<GenWordPolynomial<GenPolynomial<C>>> Gp)	Minimal ordered Groebner basis.
(package private) List<GenPolynomial<C>>	RGroebnerBasePseudoSeq.minimalGBtesting(List<GenPolynomial<C>> Gp)
GenPolynomial<C>	PseudoReductionPar.normalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform.
GenPolynomial<C>	PseudoReductionPar.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
GenPolynomial<C>	PseudoReductionSeq.normalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform.
GenPolynomial<C>	PseudoReductionSeq.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
GenPolynomial<C>	RPseudoReductionSeq.normalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform using r-reduction.
GenPolynomial<C>	RPseudoReductionSeq.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
GenPolynomial<C>	RReductionSeq.normalform(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform using r-reduction.
GenPolynomial<C>	RReductionSeq.normalform(List<GenPolynomial<C>> row, List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with recording.
PseudoReductionEntry<C>	PseudoReduction.normalformFactor(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform with multiplication factor.
PseudoReductionEntry<C>	PseudoReductionPar.normalformFactor(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform.
PseudoReductionEntry<C>	PseudoReductionSeq.normalformFactor(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform.
PseudoReductionEntry<C>	RPseudoReductionSeq.normalformFactor(List<GenPolynomial<C>> Pp, GenPolynomial<C> Ap)	Normalform using r-reduction.
GenPolynomial<GenPolynomial<C>>	PseudoReduction.normalformRecursive(List<GenPolynomial<GenPolynomial<C>>> Pp, GenPolynomial<GenPolynomial<C>> Ap)	Normalform recursive.
GenPolynomial<GenPolynomial<C>>	PseudoReduction.normalformRecursive(List<GenPolynomial<GenPolynomial<C>>> Pp, GenPolynomial<GenPolynomial<C>> Ap)	Normalform recursive.
GenPolynomial<GenPolynomial<C>>	PseudoReduction.normalformRecursive(List<GenPolynomial<GenPolynomial<C>>> Pp, GenPolynomial<GenPolynomial<C>> Ap)	Normalform recursive.
GenPolynomial<GenPolynomial<C>>	PseudoReductionPar.normalformRecursive(List<GenPolynomial<GenPolynomial<C>>> Pp, GenPolynomial<GenPolynomial<C>> Ap)	Normalform recursive.
GenPolynomial<GenPolynomial<C>>	PseudoReductionPar.normalformRecursive(List<GenPolynomial<GenPolynomial<C>>> Pp, GenPolynomial<GenPolynomial<C>> Ap)	Normalform recursive.
GenPolynomial<GenPolynomial<C>>	PseudoReductionPar.normalformRecursive(List<GenPolynomial<GenPolynomial<C>>> Pp, GenPolynomial<GenPolynomial<C>> Ap)	Normalform recursive.
GenPolynomial<GenPolynomial<C>>	PseudoReductionSeq.normalformRecursive(List<GenPolynomial<GenPolynomial<C>>> Pp, GenPolynomial<GenPolynomial<C>> Ap)	Normalform recursive.
GenPolynomial<GenPolynomial<C>>	PseudoReductionSeq.normalformRecursive(List<GenPolynomial<GenPolynomial<C>>> Pp, GenPolynomial<GenPolynomial<C>> Ap)	Normalform recursive.
GenPolynomial<GenPolynomial<C>>	PseudoReductionSeq.normalformRecursive(List<GenPolynomial<GenPolynomial<C>>> Pp, GenPolynomial<GenPolynomial<C>> Ap)	Normalform recursive.
GenPolynomial<GenPolynomial<C>>	RPseudoReductionSeq.normalformRecursive(List<GenPolynomial<GenPolynomial<C>>> Pp, GenPolynomial<GenPolynomial<C>> Ap)	Normalform recursive.
GenPolynomial<GenPolynomial<C>>	RPseudoReductionSeq.normalformRecursive(List<GenPolynomial<GenPolynomial<C>>> Pp, GenPolynomial<GenPolynomial<C>> Ap)	Normalform recursive.
GenPolynomial<GenPolynomial<C>>	RPseudoReductionSeq.normalformRecursive(List<GenPolynomial<GenPolynomial<C>>> Pp, GenPolynomial<GenPolynomial<C>> Ap)	Normalform recursive.
GenWordPolynomial<GenPolynomial<C>>	WordPseudoReduction.normalformRecursive(List<GenWordPolynomial<GenPolynomial<C>>> Pp, GenWordPolynomial<GenPolynomial<C>> Ap)	Left normalform recursive.
GenWordPolynomial<GenPolynomial<C>>	WordPseudoReduction.normalformRecursive(List<GenWordPolynomial<GenPolynomial<C>>> Pp, GenWordPolynomial<GenPolynomial<C>> Ap)	Left normalform recursive.
GenWordPolynomial<GenPolynomial<C>>	WordPseudoReductionSeq.normalformRecursive(List<GenWordPolynomial<GenPolynomial<C>>> Pp, GenWordPolynomial<GenPolynomial<C>> Ap)	Normalform with polynomial coefficients.
GenWordPolynomial<GenPolynomial<C>>	WordPseudoReductionSeq.normalformRecursive(List<GenWordPolynomial<GenPolynomial<C>>> Pp, GenWordPolynomial<GenPolynomial<C>> Ap)	Normalform with polynomial coefficients.
OptimizedPolynomialList<C>	GroebnerBasePartial.partialGB(List<GenPolynomial<C>> F, String[] pvars)	Partial Groebner base for specific variables.
OptimizedPolynomialList<GenPolynomial<C>>	GroebnerBasePartial.partialGBrec(List<GenPolynomial<C>> F, String[] pvars)	Partial recursive Groebner base for specific variables.
GenPolynomial<C>	WordGroebnerBasePseudoRecSeq.recursiveContent(GenWordPolynomial<GenPolynomial<C>> P)	GenWordPolynomial recursive coefficient content.
GenWordPolynomial<GenPolynomial<C>>	WordGroebnerBasePseudoRecSeq.recursivePrimitivePart(GenWordPolynomial<GenPolynomial<C>> P)	GenWordPolynomial recursive coefficient primitive part.
List<GenWordPolynomial<GenPolynomial<C>>>	WordGroebnerBasePseudoRecSeq.recursivePrimitivePart(List<GenWordPolynomial<GenPolynomial<C>>> F)	List of GenWordPolynomial recursive coefficient primitive part.
List<GenPolynomial<C>>	GroebnerBaseFGLM.redTerms(List<GenPolynomial<C>> groebnerBasis)	Compute the residues to given polynomial list.
List<GenPolynomial<C>>	RReduction.reducedBooleanClosure(List<GenPolynomial<C>> F)	Reduced boolean closure, compute BC(A) for all A in F.
List<GenPolynomial<C>>	RReduction.reducedBooleanClosure(List<GenPolynomial<C>> F, GenPolynomial<C> A)	Reduced boolean closure, compute BC(A) modulo F.
List<GenPolynomial<C>>	RReductionSeq.reducedBooleanClosure(List<GenPolynomial<C>> F)	Reduced boolean closure, compute BC(A) for all A in F.
List<GenPolynomial<C>>	RReductionSeq.reducedBooleanClosure(List<GenPolynomial<C>> F, GenPolynomial<C> A)	Reduced boolean closure, compute BC(A) modulo F.
List<GenPolynomial<C>>	MultiplicativeSet.removeFactors(List<GenPolynomial<C>> L)	Remove factors by mset factors division.
MultiplicativeSet<C>	MultiplicativeSet.replace(List<GenPolynomial<C>> L)	Replace polynomial list of mset.
MultiplicativeSetCoPrime<C>	MultiplicativeSetCoPrime.replace(List<GenPolynomial<C>> L)	Replace polynomial list of mset.
MultiplicativeSetFactors<C>	MultiplicativeSetFactors.replace(List<GenPolynomial<C>> L)	Replace polynomial list of mset.
MultiplicativeSetSquarefree<C>	MultiplicativeSetSquarefree.replace(List<GenPolynomial<C>> L)	Replace polynomial list of mset.
GenSolvablePolynomial<GenPolynomial<C>>	SolvablePseudoReduction.rightNormalformRecursive(List<GenSolvablePolynomial<GenPolynomial<C>>> Pp, GenSolvablePolynomial<GenPolynomial<C>> Ap)	Right normalform recursive.
GenSolvablePolynomial<GenPolynomial<C>>	SolvablePseudoReduction.rightNormalformRecursive(List<GenSolvablePolynomial<GenPolynomial<C>>> Pp, GenSolvablePolynomial<GenPolynomial<C>> Ap)	Right normalform recursive.
GenSolvablePolynomial<GenPolynomial<C>>	SolvablePseudoReductionSeq.rightNormalformRecursive(List<GenSolvablePolynomial<GenPolynomial<C>>> Pp, GenSolvablePolynomial<GenPolynomial<C>> Ap)	Right normalform recursive.
GenSolvablePolynomial<GenPolynomial<C>>	SolvablePseudoReductionSeq.rightNormalformRecursive(List<GenSolvablePolynomial<GenPolynomial<C>>> Pp, GenSolvablePolynomial<GenPolynomial<C>> Ap)	Right normalform recursive.
static <C extends GcdRingElem<C>> List<GenPolynomial<C>>	PolyGBUtil.subRing(List<GenPolynomial<C>> A)	Subring generators.
static <C extends GcdRingElem<C>> boolean	PolyGBUtil.subRingAndMember(List<GenPolynomial<C>> A, GenPolynomial<C> g)	Subring and membership test.
static <C extends GcdRingElem<C>> boolean	PolyGBUtil.subRingMember(List<GenPolynomial<C>> A, GenPolynomial<C> g)	Subring membership.
static <C extends RingElem<C>> GenPolynomial<C>	PolyGBUtil.topCoefficientPseudoRemainder(List<GenPolynomial<C>> A, GenPolynomial<C> P)	Top coefficient pseudo remainder of the leading coefficient of P wrt A in the main variables.
static <C extends RingElem<C>> GenPolynomial<C>	PolyGBUtil.topPseudoRemainder(List<GenPolynomial<C>> A, GenPolynomial<C> P)	Top pseudo reduction wrt the main variables.
List<GenSolvablePolynomial<GenPolynomial<C>>>	SolvableGroebnerBasePseudoRecSeq.twosidedGB(int modv, List<GenSolvablePolynomial<GenPolynomial<C>>> Fp)	Twosided Solvable Groebner base using pairlist class.
List<GenPolynomial<C>>	GroebnerBaseWalk.walkGroebnerToTarget(int modv, List<GenPolynomial<C>> Gl, GenPolynomialRing<C> ufac)	Converts Groebner bases w.r.t.
static <C extends RingElem<C>> List<GenPolynomial<C>>	PolyGBUtil.zeroDegrees(List<GenPolynomial<C>> A)	Extract polynomials with degree zero in the main variable.
List<List<GenPolynomial<C>>>	Syzygy.zeroRelations(int modv, GenVector<GenPolynomial<C>> v)	Syzygy module from Groebner base.
List<List<GenPolynomial<C>>>	Syzygy.zeroRelations(int modv, List<GenPolynomial<C>> F)	Syzygy module from Groebner base.
List<List<GenPolynomial<C>>>	Syzygy.zeroRelations(List<GenPolynomial<C>> F)	Syzygy module from Groebner base.
List<List<GenPolynomial<C>>>	SyzygyAbstract.zeroRelations(int modv, GenVector<GenPolynomial<C>> v)	Syzygy module from Groebner base.
List<List<GenPolynomial<C>>>	SyzygyAbstract.zeroRelations(int modv, List<GenPolynomial<C>> F)	Syzygy module from Groebner base.
List<List<GenPolynomial<C>>>	SyzygyAbstract.zeroRelations(List<GenPolynomial<C>> F)	Syzygy module from Groebner base.
List<List<GenPolynomial<C>>>	Syzygy.zeroRelationsArbitrary(int modv, List<GenPolynomial<C>> F)	Syzygy module from arbitrary base.
List<List<GenPolynomial<C>>>	Syzygy.zeroRelationsArbitrary(List<GenPolynomial<C>> F)	Syzygy module from arbitrary base.
List<List<GenPolynomial<C>>>	SyzygyAbstract.zeroRelationsArbitrary(List<GenPolynomial<C>> F)	Syzygy module from arbitrary base.
List<List<GenPolynomial<C>>>	SyzygySeq.zeroRelationsArbitrary(int modv, List<GenPolynomial<C>> F)	Syzygy module from arbitrary base.

Constructors in edu.jas.gbufd with parameters of type GenPolynomial

Modifier	Constructor	Description
(package private)	PseudoMiReducer(List<GenPolynomial<C>> G, GenPolynomial<C> p, GreatestCommonDivisorAbstract<C> engine)
(package private)	PseudoMiReducerRec(List<GenPolynomial<GenPolynomial<C>>> G, GenPolynomial<GenPolynomial<C>> p, GreatestCommonDivisorAbstract<C> engine)
	PseudoReductionEntry(GenPolynomial<C> pol, C multiplicator)

Constructor parameters in edu.jas.gbufd with type arguments of type GenPolynomial

Modifier	Constructor	Description
	GroebnerBasePartial(RingFactory<GenPolynomial<C>> rf)	Constructor.
	GroebnerBasePseudoRecParallel(int threads, RingFactory<GenPolynomial<C>> rf)	Constructor.
	GroebnerBasePseudoRecParallel(int threads, RingFactory<GenPolynomial<C>> rf, PairList<GenPolynomial<C>> pl)	Constructor.
	GroebnerBasePseudoRecParallel(int threads, RingFactory<GenPolynomial<C>> rf, PairList<GenPolynomial<C>> pl)	Constructor.
	GroebnerBasePseudoRecParallel(int threads, RingFactory<GenPolynomial<C>> rf, PseudoReduction<GenPolynomial<C>> red)	Constructor.
	GroebnerBasePseudoRecParallel(int threads, RingFactory<GenPolynomial<C>> rf, PseudoReduction<GenPolynomial<C>> red)	Constructor.
	GroebnerBasePseudoRecParallel(int threads, RingFactory<GenPolynomial<C>> rf, PseudoReduction<GenPolynomial<C>> red, ExecutorService pool)	Constructor.
	GroebnerBasePseudoRecParallel(int threads, RingFactory<GenPolynomial<C>> rf, PseudoReduction<GenPolynomial<C>> red, ExecutorService pool)	Constructor.
	GroebnerBasePseudoRecParallel(int threads, RingFactory<GenPolynomial<C>> rf, PseudoReduction<GenPolynomial<C>> red, ExecutorService pool, PairList<GenPolynomial<C>> pl)	Constructor.
	GroebnerBasePseudoRecParallel(int threads, RingFactory<GenPolynomial<C>> rf, PseudoReduction<GenPolynomial<C>> red, ExecutorService pool, PairList<GenPolynomial<C>> pl)	Constructor.
	GroebnerBasePseudoRecParallel(int threads, RingFactory<GenPolynomial<C>> rf, PseudoReduction<GenPolynomial<C>> red, ExecutorService pool, PairList<GenPolynomial<C>> pl)	Constructor.
	GroebnerBasePseudoRecSeq(PseudoReduction<GenPolynomial<C>> red, RingFactory<GenPolynomial<C>> rf, PairList<GenPolynomial<C>> pl)	Constructor.
	GroebnerBasePseudoRecSeq(PseudoReduction<GenPolynomial<C>> red, RingFactory<GenPolynomial<C>> rf, PairList<GenPolynomial<C>> pl)	Constructor.
	GroebnerBasePseudoRecSeq(PseudoReduction<GenPolynomial<C>> red, RingFactory<GenPolynomial<C>> rf, PairList<GenPolynomial<C>> pl)	Constructor.
	GroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf)	Constructor.
	GroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf, PairList<GenPolynomial<C>> pl)	Constructor.
	GroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf, PairList<GenPolynomial<C>> pl)	Constructor.
	GroebnerBaseQuotient(int threads, QuotientRing<C> rf, PairList<GenPolynomial<C>> pl)	Constructor.
	GroebnerBaseQuotient(GroebnerBaseAbstract<GenPolynomial<C>> bba)	Constructor.
	GroebnerBaseQuotient(QuotientRing<C> rf, PairList<GenPolynomial<C>> pl)	Constructor.
protected	MultiplicativeSet(GenPolynomialRing<C> ring, List<GenPolynomial<C>> ms)	MultiplicativeSet constructor.
protected	MultiplicativeSetCoPrime(GenPolynomialRing<C> ring, List<GenPolynomial<C>> ms, GreatestCommonDivisorAbstract<C> eng)	MultiplicativeSet constructor.
protected	MultiplicativeSetFactors(GenPolynomialRing<C> ring, List<GenPolynomial<C>> ms, FactorAbstract<C> eng)	MultiplicativeSet constructor.
protected	MultiplicativeSetSquarefree(GenPolynomialRing<C> ring, List<GenPolynomial<C>> ms, SquarefreeAbstract<C> eng)	MultiplicativeSet constructor.
(package private)	PseudoMiReducer(List<GenPolynomial<C>> G, GenPolynomial<C> p, GreatestCommonDivisorAbstract<C> engine)
(package private)	PseudoMiReducerRec(List<GenPolynomial<GenPolynomial<C>>> G, GenPolynomial<GenPolynomial<C>> p, GreatestCommonDivisorAbstract<C> engine)
(package private)	PseudoMiReducerRec(List<GenPolynomial<GenPolynomial<C>>> G, GenPolynomial<GenPolynomial<C>> p, GreatestCommonDivisorAbstract<C> engine)
(package private)	PseudoMiReducerRec(List<GenPolynomial<GenPolynomial<C>>> G, GenPolynomial<GenPolynomial<C>> p, GreatestCommonDivisorAbstract<C> engine)
(package private)	PseudoReducer(Terminator fin, List<GenPolynomial<C>> G, PairList<C> L, GreatestCommonDivisorAbstract<C> engine)
(package private)	PseudoReducerRec(Terminator fin, List<GenPolynomial<GenPolynomial<C>>> G, PairList<GenPolynomial<C>> L, GreatestCommonDivisorAbstract<C> engine)
(package private)	PseudoReducerRec(Terminator fin, List<GenPolynomial<GenPolynomial<C>>> G, PairList<GenPolynomial<C>> L, GreatestCommonDivisorAbstract<C> engine)
(package private)	PseudoReducerRec(Terminator fin, List<GenPolynomial<GenPolynomial<C>>> G, PairList<GenPolynomial<C>> L, GreatestCommonDivisorAbstract<C> engine)
	SolvableGroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf)	Constructor.
	SolvableGroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf, PairList<GenPolynomial<C>> pl)	Constructor.
	SolvableGroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf, PairList<GenPolynomial<C>> pl)	Constructor.
	SolvableGroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf, SolvablePseudoReduction<C> red)	Constructor.
	SolvableGroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf, SolvablePseudoReduction<C> red, PairList<GenPolynomial<C>> pl)	Constructor.
	SolvableGroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf, SolvablePseudoReduction<C> red, PairList<GenPolynomial<C>> pl)	Constructor.
	WordGroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf)	Constructor.
	WordGroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf, WordPseudoReductionSeq<GenPolynomial<C>> red)	Constructor.
	WordGroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf, WordPseudoReductionSeq<GenPolynomial<C>> red)	Constructor.
	WordGroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf, WordPseudoReductionSeq<GenPolynomial<C>> red, WordPairList<GenPolynomial<C>> pl)	Constructor.
	WordGroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf, WordPseudoReductionSeq<GenPolynomial<C>> red, WordPairList<GenPolynomial<C>> pl)	Constructor.
	WordGroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf, WordPseudoReductionSeq<GenPolynomial<C>> red, WordPairList<GenPolynomial<C>> pl)	Constructor.

Uses of GenPolynomial in edu.jas.integrate

Fields in edu.jas.integrate declared as GenPolynomial

Modifier and Type	Field	Description
final GenPolynomial<C>	Integral.den	Original denominator polynomial with coefficients from C.
final GenPolynomial<C>	LogIntegral.den	Original (irreducible) denominator polynomial with coefficients from C.
final GenPolynomial<C>	Integral.num	Original numerator polynomial with coefficients from C.
final GenPolynomial<C>	LogIntegral.num	Original numerator polynomial with coefficients from C and deg(num) < deg(den).
final GenPolynomial<C>	Integral.pol	Integral of the polynomial part.

Fields in edu.jas.integrate with type parameters of type GenPolynomial

Modifier and Type	Field	Description
final List<GenPolynomial<AlgebraicNumber<C>>>	LogIntegral.adenom	List of factors of the denominator with coefficients from an AlgebraicNumberRing<C>.
final List<GenPolynomial<C>>	LogIntegral.cdenom	List of linear factors of the denominator with coefficients from C.
final List<GenPolynomial<C>>	Integral.rational	Integral of the rational part.

Methods in edu.jas.integrate that return types with arguments of type GenPolynomial

Modifier and Type	Method	Description
List<GenPolynomial<C>>[]	ElementaryIntegration.integrateHermite(GenPolynomial<C> a, GenPolynomial<C> d)	Integration of the rational part, Hermite reduction step.

Methods in edu.jas.integrate with parameters of type GenPolynomial

Modifier and Type	Method	Description
Integral<C>	ElementaryIntegration.integrate(GenPolynomial<C> a, GenPolynomial<C> d)	Integration of a rational function.
List<GenPolynomial<C>>[]	ElementaryIntegration.integrateHermite(GenPolynomial<C> a, GenPolynomial<C> d)	Integration of the rational part, Hermite reduction step.
LogIntegral<C>	ElementaryIntegration.integrateLogPart(GenPolynomial<C> A, GenPolynomial<C> P)	Univariate GenPolynomial integration of the logarithmic part, Rothstein-Trager algorithm.
LogIntegral<C>	ElementaryIntegrationBernoulli.integrateLogPart(GenPolynomial<C> A, GenPolynomial<C> P)	Univariate GenPolynomial integration of the logarithmic part, Bernoulli linear factorization algorithm.
LogIntegral<C>	ElementaryIntegrationCzichowski.integrateLogPart(GenPolynomial<C> A, GenPolynomial<C> P)	Univariate GenPolynomial integration of the logarithmic part, Czichowski
LogIntegral<C>	ElementaryIntegrationLazard.integrateLogPart(GenPolynomial<C> A, GenPolynomial<C> P)	Univariate GenPolynomial integration of the logarithmic part, Lazard - Rioboo - Trager
LogIntegral<C>	ElementaryIntegration.integrateLogPartPrepare(GenPolynomial<C> A, GenPolynomial<C> P)	Univariate GenPolynomial integration of the logarithmic part, eventual preparation for irreducible factorization of P.

Constructors in edu.jas.integrate with parameters of type GenPolynomial

Modifier	Constructor	Description
	Integral(GenPolynomial<C> n, GenPolynomial<C> d, GenPolynomial<C> p)	Constructor.
	Integral(GenPolynomial<C> n, GenPolynomial<C> d, GenPolynomial<C> p, List<GenPolynomial<C>> rat)	Constructor.
	Integral(GenPolynomial<C> n, GenPolynomial<C> d, GenPolynomial<C> p, List<GenPolynomial<C>> rat, List<LogIntegral<C>> log)	Constructor.
	LogIntegral(GenPolynomial<C> n, GenPolynomial<C> d, List<C> cf, List<GenPolynomial<C>> cd, List<AlgebraicNumber<C>> af, List<GenPolynomial<AlgebraicNumber<C>>> ad)	Constructor.
	QuotIntegral(Quotient<C> r, GenPolynomial<C> p, List<GenPolynomial<C>> rat)	Constructor.
	QuotIntegral(Quotient<C> r, GenPolynomial<C> p, List<GenPolynomial<C>> rat, List<LogIntegral<C>> log)	Constructor.

Constructor parameters in edu.jas.integrate with type arguments of type GenPolynomial

Modifier	Constructor	Description
	Integral(GenPolynomial<C> n, GenPolynomial<C> d, GenPolynomial<C> p, List<GenPolynomial<C>> rat)	Constructor.
	Integral(GenPolynomial<C> n, GenPolynomial<C> d, GenPolynomial<C> p, List<GenPolynomial<C>> rat, List<LogIntegral<C>> log)	Constructor.
	QuotIntegral(Quotient<C> r, GenPolynomial<C> p, List<GenPolynomial<C>> rat)	Constructor.
	QuotIntegral(Quotient<C> r, GenPolynomial<C> p, List<GenPolynomial<C>> rat, List<LogIntegral<C>> log)	Constructor.

Uses of GenPolynomial in edu.jas.poly

Classes in edu.jas.poly with type parameters of type GenPolynomial

Modifier and Type	Class	Description
class	QLRSolvablePolynomial<C extends GcdRingElem<C> & QuotPair<GenPolynomial<D>>, D extends GcdRingElem<D>>	QLRSolvablePolynomial generic recursive solvable polynomials implementing RingElem.
class	QLRSolvablePolynomialRing<C extends GcdRingElem<C> & QuotPair<GenPolynomial<D>>, D extends GcdRingElem<D>>	QLRSolvablePolynomialRing generic recursive solvable polynomial factory implementing RingFactory and extending GenSolvablePolynomialRing factory.

Subclasses of GenPolynomial in edu.jas.poly

Modifier and Type	Class	Description
class	GenSolvablePolynomial<C extends RingElem<C>>	GenSolvablePolynomial generic solvable polynomials implementing RingElem.
class	QLRSolvablePolynomial<C extends GcdRingElem<C> & QuotPair<GenPolynomial<D>>, D extends GcdRingElem<D>>	QLRSolvablePolynomial generic recursive solvable polynomials implementing RingElem.
class	RecSolvablePolynomial<C extends RingElem<C>>	RecSolvablePolynomial generic recursive solvable polynomials implementing RingElem.
class	RecSolvableWordPolynomial<C extends RingElem<C>>	RecSolvableWordPolynomial generic recursive solvable polynomials implementing RingElem.

Subclasses with type arguments of type GenPolynomial in edu.jas.poly

Modifier and Type	Class	Description
class	RecSolvablePolynomial<C extends RingElem<C>>	RecSolvablePolynomial generic recursive solvable polynomials implementing RingElem.
class	RecSolvablePolynomialRing<C extends RingElem<C>>	RecSolvablePolynomialRing generic recursive solvable polynomial factory implementing RingFactory and extending GenSolvablePolynomialRing factory.

Classes in edu.jas.poly that implement interfaces with type arguments of type GenPolynomial

Modifier and Type	Class	Description
(package private) class	AlgToPoly<C extends GcdRingElem<C>>	Algebraic to polynomial functor.
(package private) class	DistToRec<C extends RingElem<C>>	Conversion of distributive to recursive representation.
(package private) class	DistToRec<C extends RingElem<C>>	Conversion of distributive to recursive representation.
(package private) class	DistToRec<C extends RingElem<C>>	Conversion of distributive to recursive representation.
(package private) class	EvalAllPol<C extends RingElem<C>>	Evaluate all variable functor.
(package private) class	EvalMain<C extends RingElem<C>>	Evaluate main variable functor.
(package private) class	EvalMainPol<C extends RingElem<C>>	Evaluate main variable functor.
(package private) class	EvalMainPol<C extends RingElem<C>>	Evaluate main variable functor.
(package private) class	FromIntegerPoly<D extends RingElem<D>>	Conversion from GenPolynomial functor.
(package private) class	FromIntegerPoly<D extends RingElem<D>>	Conversion from GenPolynomial functor.
class	GenPolynomial<C extends RingElem<C>>	GenPolynomial generic polynomials implementing RingElem.
(package private) class	GenPolynomialIterator<C extends RingElem<C>>	Polynomial iterator.
(package private) class	GenPolynomialMonomialIterator<C extends RingElem<C>>	Polynomial monomial iterator.
class	GenPolynomialRing<C extends RingElem<C>>	GenPolynomialRing generic polynomial factory.
class	GenPolynomialRing<C extends RingElem<C>>	GenPolynomialRing generic polynomial factory.
class	PolynomialComparator<C extends RingElem<C>>	Comparator for polynomials.
(package private) class	PolyToAlg<C extends GcdRingElem<C>>	Polynomial to algebriac functor.
(package private) class	RatToIntPoly	Conversion from GenPolynomial to GenPolynomial functor.
(package private) class	RatToIntPoly	Conversion from GenPolynomial to GenPolynomial functor.
(package private) class	RecToDist<C extends RingElem<C>>	Conversion of recursive to distributive representation.
(package private) class	RecToDist<C extends RingElem<C>>	Conversion of recursive to distributive representation.
(package private) class	RecToDist<C extends RingElem<C>>	Conversion of recursive to distributive representation.

Fields in edu.jas.poly declared as GenPolynomial

Modifier and Type	Field	Description
(package private) GenPolynomial<C>	GenPolynomialIterator.current
(package private) GenPolynomial<C>	GenPolynomialMonomialIterator.current
final GenPolynomial	AlgebraicNotInvertibleException.f
final GenPolynomial	AlgebraicNotInvertibleException.f1
final GenPolynomial	AlgebraicNotInvertibleException.f2
final GenPolynomial<C>	AlgebraicNumberRing.modul	Module part of the factory data structure.
GenPolynomial<C>	GenPolynomialRing.ONE	The constant polynomial 1 for this ring.
final GenPolynomial<C>	AlgebraicNumber.val	Value part of the element data structure.
protected final GenPolynomial<C>	CoeffToAlg.zero
GenPolynomial<C>	GenPolynomialRing.ZERO	The constant polynomial 0 for this ring.

Fields in edu.jas.poly with type parameters of type GenPolynomial

Modifier and Type	Field	Description
final RelationTable<GenPolynomial<C>>	RecSolvablePolynomialRing.coeffTable	The solvable multiplication relations between variables and coefficients.
(package private) GenPolynomialRing<GenPolynomial<C>>	DistToRec.fac
final List<List<GenPolynomial<C>>>	ModuleList.list	The data structure is a List of Lists of polynomials.
final List<GenPolynomial<C>>	PolynomialList.list	The data structure is a List of polynomials.
(package private) final List<GenPolynomial<C>>	AlgebraicNumberIterator.powers
final QuotPairFactory<GenPolynomial<D>, C>	QLRSolvablePolynomialRing.qpfac	Factory to create coefficients.

Methods in edu.jas.poly that return GenPolynomial

Modifier and Type	Method	Description
GenPolynomial<C>	GenPolynomial.abs()	GenPolynomial absolute value, i.e.
static <C extends GcdRingElem<C>> GenPolynomial<AlgebraicNumber<C>>	PolyUtil.algebraicFromComplex(GenPolynomialRing<AlgebraicNumber<C>> fac, GenPolynomial<Complex<C>> A)	AlgebraicNumber from complex coefficients.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.baseDensePseudoQuotient(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial dense pseudo quotient.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.baseDensePseudoRemainder(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial dense pseudo remainder.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.baseDerivative(GenPolynomial<C> P)	GenPolynomial polynomial derivative main variable.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.baseDerivative(GenPolynomial<C> P, int r)	GenPolynomial polynomial partial derivative variable r.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.baseIntegral(GenPolynomial<C> P)	GenPolynomial polynomial integral main variable.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.basePseudoDivide(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial sparse pseudo divide.
static <C extends RingElem<C>> GenPolynomial<C>[]	PolyUtil.basePseudoQuotientRemainder(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial sparse pseudo quotient and remainder.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.basePseudoRemainder(GenPolynomial<C> P, GenPolynomial<C> S)	Deprecated. (forRemoval=true) Use PolyUtil.baseSparsePseudoRemainder(edu.jas.poly.GenPolynomial,edu.jas.poly.GenPolynomial) instead
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.baseRecursiveDivide(GenPolynomial<GenPolynomial<C>> P, C s)	GenPolynomial base divide.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.baseRemainderPoly(GenPolynomial<C> P, C s)	GenPolynomial coefficient wise remainder.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.baseSparsePseudoRemainder(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial sparse pseudo remainder.
GenPolynomial<C>	GenPolynomialRing.charPolynomial(GenMatrix<C> A)	Characteristic polynomial of matrix.
static <C extends RingElem<C> & Modular> GenPolynomial<C>	PolyUtil.chineseRemainder(GenPolynomialRing<C> fac, GenPolynomial<C> A, C mi, GenPolynomial<C> B)	ModInteger chinese remainder algorithm on coefficients.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.coefficientBasePseudoDivide(GenPolynomial<C> P, C s)	GenPolynomial pseudo divide.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.coefficientPseudoDivide(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<C> s)	GenPolynomial pseudo divide.
GenPolynomial<C>	GenPolynomial.coeffPrimitivePart()	GenPolynomial coefficient primitive part.
static <C extends RingElem<C> & Rational> GenPolynomial<Complex<BigDecimal>>	PolyUtil.complexDecimalFromRational(GenPolynomialRing<Complex<BigDecimal>> fac, GenPolynomial<Complex<C>> A)	Convert to complex decimal coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<Complex<C>>	PolyUtil.complexFromAlgebraic(GenPolynomialRing<Complex<C>> fac, GenPolynomial<AlgebraicNumber<C>> A)	Complex from algebraic coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<Complex<C>>	PolyUtil.complexFromAny(GenPolynomialRing<Complex<C>> fac, GenPolynomial<C> A)	Complex from ring element coefficients.
static GenPolynomial<BigComplex>	PolyUtil.complexFromRational(GenPolynomialRing<BigComplex> fac, GenPolynomial<BigRational> A)	Complex from rational coefficients.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.conjugateCoeff(GenPolynomial<C> A)	Conjugate coefficients.
GenPolynomial<C>	GenPolynomial.contractCoeff(GenPolynomialRing<C> pfac)	Contract variables to coefficient polynomial.
static <C extends GcdRingElem<C>> GenPolynomial<AlgebraicNumber<C>>	PolyUtil.convertRecursiveToAlgebraicCoefficients(GenPolynomialRing<AlgebraicNumber<C>> pfac, GenPolynomial<GenPolynomial<C>> A)	Convert to AlgebraicNumber coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<AlgebraicNumber<C>>	PolyUtil.convertToAlgebraicCoefficients(GenPolynomialRing<AlgebraicNumber<C>> pfac, GenPolynomial<C> A)	Convert to AlgebraicNumber coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<AlgebraicNumber<C>>	PolyUtil.convertToRecAlgebraicCoefficients(int depth, GenPolynomialRing<AlgebraicNumber<C>> pfac, GenPolynomial<C> A)	Convert to recursive AlgebraicNumber coefficients.
GenPolynomial<C>	GenPolynomial.copy()	Copy this GenPolynomial.
GenPolynomial<C>	GenPolynomialRing.copy(GenPolynomial<C> c)	Copy polynomial c.
static <C extends RingElem<C> & Rational> GenPolynomial<BigDecimal>	PolyUtil.decimalFromRational(GenPolynomialRing<BigDecimal> fac, GenPolynomial<C> A)	Convert to decimal coefficients.
GenPolynomial<C>	GenPolynomial.deHomogenize(GenPolynomialRing<C> pfac)	Dehomogenize.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.distribute(GenPolynomialRing<C> dfac, GenPolynomial<GenPolynomial<C>> B)	Distribute a recursive polynomial to a generic polynomial.
GenPolynomial<C>	GenPolynomial.divide(C s)	GenPolynomial division.
GenPolynomial<C>	GenPolynomial.divide(GenPolynomial<C> S)	GenPolynomial division.
GenPolynomial<C>[]	GenPolynomial.egcd(GenPolynomial<C> S)	GenPolynomial extended greatest common divisor.
GenPolynomial<C>	AlgToPoly.eval(AlgebraicNumber<C> c)
GenPolynomial<GenPolynomial<C>>	DistToRec.eval(GenPolynomial<C> c)
GenPolynomial<C>	EvalMainPol.eval(GenPolynomial<C> c)
GenPolynomial<D>	FromIntegerPoly.eval(GenPolynomial<BigInteger> c)
GenPolynomial<BigInteger>	RatToIntPoly.eval(GenPolynomial<BigRational> c)
GenPolynomial<C>	RecToDist.eval(GenPolynomial<GenPolynomial<C>> c)
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.evaluate(GenPolynomialRing<C> cfac, GenPolynomialRing<GenPolynomial<C>> rfac, GenPolynomialRing<GenPolynomial<C>> nfac, GenPolynomialRing<C> dfac, GenPolynomial<C> A, C a)	Evaluate at k-th variable.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.evaluateFirst(GenPolynomialRing<C> cfac, GenPolynomialRing<C> dfac, GenPolynomial<C> A, C a)	Evaluate at first (lowest) variable.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.evaluateFirstRec(GenPolynomialRing<C> cfac, GenPolynomialRing<C> dfac, GenPolynomial<GenPolynomial<C>> A, C a)	Evaluate at first (lowest) variable.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.evaluateMain(GenPolynomialRing<C> cfac, GenPolynomial<C> A, C a)	Evaluate at main variable.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.evaluateMainRecursive(GenPolynomialRing<C> cfac, GenPolynomial<GenPolynomial<C>> A, C a)	Evaluate at main variable.
GenPolynomial<C>	GenPolynomial.extend(GenPolynomialRing<C> pfac, int j, long k)	Extend variables.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.extendCoefficients(GenPolynomialRing<GenPolynomial<C>> pfac, GenPolynomial<GenPolynomial<C>> A, int j, long k)	Extend coefficient variables.
GenPolynomial<C>	GenPolynomial.extendLower(GenPolynomialRing<C> pfac, int j, long k)	Extend lower variables.
GenPolynomial<C>	GenPolynomial.extendUnivariate(GenPolynomialRing<C> pfac, int i)	Extend univariate to multivariate polynomial.
static <C extends GcdRingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.fromAlgebraicCoefficients(GenPolynomialRing<GenPolynomial<C>> rfac, GenPolynomial<AlgebraicNumber<C>> A)	From AlgebraicNumber coefficients.
GenPolynomial<C>	GenPolynomialRing.fromInteger(long a)	Get a (constant) GenPolynomial<C> element from a long value.
GenPolynomial<C>	GenPolynomialRing.fromInteger(BigInteger a)	Get a (constant) GenPolynomial<C> element from a BigInteger value.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.fromIntegerCoefficients(GenPolynomialRing<C> fac, GenPolynomial<BigInteger> A)	From BigInteger coefficients.
GenPolynomial<C>	GenPolynomialRing.fromVector(GenVector<C> a)	Get a GenPolynomial<C> from a GenVector<C>.
GenPolynomial<C>	GenPolynomial.gcd(GenPolynomial<C> S)	GenPolynomial greatest common divisor.
GenPolynomial<C>	AlgebraicNumberRing.getModul()	Get the module part.
GenPolynomial<C>	GenPolynomialRing.getONE()	Get the one element.
GenPolynomial<C>	AlgebraicNumber.getVal()	Get the value part.
GenPolynomial<C>	GenPolynomialRing.getZERO()	Get the zero element.
GenPolynomial<C>[]	GenPolynomial.hegcd(GenPolynomial<C> S)	GenPolynomial half extended greatest common divisor.
GenPolynomial<C>	GenPolynomial.homogenize(GenPolynomialRing<C> pfac)	Make homogeneous.
static GenPolynomial<BigRational>	PolyUtil.imaginaryPart(GenPolynomialRing<BigRational> fac, GenPolynomial<BigComplex> A)	Imaginary part.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.imaginaryPartFromComplex(GenPolynomialRing<C> fac, GenPolynomial<Complex<C>> A)	Imaginary part.
GenPolynomial<C>	GenPolynomial.inflate(long e)	GenPolynomial inflate.
static <C extends RingElem<C> & Modular> GenPolynomial<BigInteger>	PolyUtil.integerFromModularCoefficients(GenPolynomialRing<BigInteger> fac, GenPolynomial<C> A)	BigInteger from ModInteger coefficients, symmetric.
static <C extends RingElem<C> & Modular> GenPolynomial<BigInteger>	PolyUtil.integerFromModularCoefficientsPositive(GenPolynomialRing<BigInteger> fac, GenPolynomial<C> A)	BigInteger from ModInteger coefficients, positive.
static GenPolynomial<BigInteger>	PolyUtil.integerFromRationalCoefficients(GenPolynomialRing<BigInteger> fac, GenPolynomial<BigRational> A)	BigInteger from BigRational coefficients.
static GenPolynomial<BigInteger>	PolyUtil.integerFromRationalCoefficients(GenPolynomialRing<BigInteger> fac, BigInteger gcd, BigInteger lcm, GenPolynomial<BigRational> A)	BigInteger from BigRational coefficients.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.interpolate(GenPolynomialRing<C> fac, GenPolynomial<C> A, GenPolynomial<C> M, C mi, C a, C am)	Univariate polynomial interpolation.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.interpolate(GenPolynomialRing<GenPolynomial<C>> fac, GenPolynomial<GenPolynomial<C>> A, GenPolynomial<C> M, C mi, GenPolynomial<C> B, C am)	ModInteger interpolate on first variable.
GenPolynomial<C>	GenPolynomial.inverse()	GenPolynomial inverse.
GenPolynomial<C>	GenPolynomial.leadingFacetPolynomial(ExpVector u, ExpVector uv)	Leading facet normal polynomial.
GenPolynomial<C>	GenPolynomial.leadingWeightPolynomial()	Leading weight polynomial.
GenPolynomial<C>	GenPolynomial.leftDivideCoeff(C s)	GenPolynomial left division.
GenPolynomial<C>	GenPolynomial.map(UnaryFunctor<? super C, C> f)	Map a unary function to the coefficients.
static <C extends RingElem<C>, D extends RingElem<D>> GenPolynomial<D>	PolyUtil.map(GenPolynomialRing<D> ring, GenPolynomial<C> p, UnaryFunctor<C,D> f)	Map a unary function to the coefficients.
GenPolynomial<C>	GenPolynomial.mapOnStream(Function<? super Map.Entry<ExpVector, C>, ? extends Map.Entry<ExpVector, C>> f)	Map a function to the polynomial stream entries.
GenPolynomial<C>	GenPolynomial.mapOnStream(Function<? super Map.Entry<ExpVector, C>, ? extends Map.Entry<ExpVector, C>> f, boolean parallel)	Map a function to the polynomial stream entries.
(package private) GenPolynomial<C>	GenPolynomial.mapWrong(UnaryFunctor<? super C, C> f)
GenPolynomial<C>	GenPolynomial.modInverse(GenPolynomial<C> m)	GenPolynomial modular inverse.
GenPolynomial<C>	GenPolynomial.monic()	GenPolynomial monic, i.e.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.monic(GenPolynomial<GenPolynomial<C>> p)	GenPolynomial monic, i.e.
GenPolynomial<C>	GenPolynomial.monicRight()	GenPolynomial monic, i.e.
GenPolynomial<C>	GenPolynomial.multiply(C s)	GenPolynomial multiplication.
GenPolynomial<C>	GenPolynomial.multiply(C s, ExpVector e)	GenPolynomial multiplication.
GenPolynomial<C>	GenPolynomial.multiply(ExpVector e)	GenPolynomial multiplication.
GenPolynomial<C>	GenPolynomial.multiply(GenPolynomial<C> S)	GenPolynomial multiplication.
GenPolynomial<C>	GenPolynomial.multiply(Map.Entry<ExpVector, C> m)	GenPolynomial multiplication.
GenPolynomial<C>	GenPolynomial.multiplyLeft(C s)	GenPolynomial left multiplication.
GenPolynomial<C>	GenPolynomial.negate()	GenPolynomial negation.
GenPolynomial<C>	GenPolynomial.negateAlt()	GenPolynomial negation, alternative implementation.
GenPolynomial<C>	GenPolynomialIterator.next()	Get next polynomial.
GenPolynomial<C>	GenPolynomialMonomialIterator.next()	Get next polynomial.
GenPolynomial	GenPolynomialTokenizer.nextPolynomial()	Parsing method for GenPolynomial.
GenPolynomial<C>	GenPolynomialRing.parse(Reader r)	Parse a polynomial with the use of GenPolynomialTokenizer.
GenPolynomial<C>	GenPolynomialRing.parse(String s)	Parse a polynomial with the use of GenPolynomialTokenizer.
static <C extends RingElem<C>> GenPolynomial<C>	TermOrderOptimization.permutation(List<Integer> P, GenPolynomialRing<C> R, GenPolynomial<C> A)	Permutation of polynomial exponent vectors.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	TermOrderOptimization.permutationOnCoefficients(List<Integer> P, GenPolynomialRing<GenPolynomial<C>> R, GenPolynomial<GenPolynomial<C>> A)	Permutation of polynomial exponent vectors of coefficient polynomials.
GenPolynomial<C>[]	GenPolynomial.quotientRemainder(GenPolynomial<C> S)	GenPolynomial division with remainder.
GenPolynomial<C>	GenPolynomialRing.random(int n)	Random polynomial.
GenPolynomial<C>	GenPolynomialRing.random(int k, int l, int d, float q)	Generate a random polynomial.
GenPolynomial<C>	GenPolynomialRing.random(int k, int l, int d, float q, Random rnd)	Generate a random polynomial.
GenPolynomial<C>	GenPolynomialRing.random(int n, Random rnd)	Random polynomial.
static GenPolynomial<BigRational>	PolyUtil.realPart(GenPolynomialRing<BigRational> fac, GenPolynomial<BigComplex> A)	Real part.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.realPartFromComplex(GenPolynomialRing<C> fac, GenPolynomial<Complex<C>> A)	Real part.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.reciprocalTransformation(GenPolynomial<C> A)	Polynomial reciprocal transformation.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.reciprocalTransformation(GenPolynomial<C> A, int i)	Polynomial reciprocal transformation.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursive(GenPolynomialRing<GenPolynomial<C>> rfac, GenPolynomial<C> A)	Recursive representation.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursiveDensePseudoRemainder(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	GenPolynomial dense pseudo remainder.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursiveDerivative(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive polynomial derivative main variable.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursiveDivide(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<C> s)	GenPolynomial divide.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursivePseudoDivide(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	GenPolynomial recursive pseudo divide.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursivePseudoRemainder(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Deprecated. (forRemoval=true) Use PolyUtil.recursiveSparsePseudoRemainder(edu.jas.poly.GenPolynomial,edu.jas.poly.GenPolynomial) instead
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursiveSparsePseudoRemainder(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	GenPolynomial sparse pseudo remainder.
GenPolynomial<C>	GenPolynomial.reductum()	Reductum.
GenPolynomial<C>	GenPolynomial.remainder(GenPolynomial<C> S)	GenPolynomial remainder.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.removeUnusedLowerVariables(GenPolynomial<C> p)	Remove all lower variables which do not occur in polynomial.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.removeUnusedMiddleVariables(GenPolynomial<C> p)	Remove upper block of middle variables which do not occur in polynomial.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.removeUnusedUpperVariables(GenPolynomial<C> p)	Remove all upper variables which do not occur in polynomial.
GenPolynomial<C>	GenPolynomial.reverse(GenPolynomialRing<C> oring)	Reverse variables.
GenPolynomial<C>	GenPolynomial.rightDivideCoeff(C s)	GenPolynomial right division.
GenPolynomial<C>	GenPolynomial.rightGcd(GenPolynomial<C> S)	GenPolynomial greatest common divisor.
GenPolynomial<C>	GenPolynomial.scaleSubtractMultiple(C b, C a, ExpVector e, GenPolynomial<C> S)	GenPolynomial scale and subtract a multiple.
GenPolynomial<C>	GenPolynomial.scaleSubtractMultiple(C b, C a, GenPolynomial<C> S)	GenPolynomial scale and subtract a multiple.
GenPolynomial<C>	GenPolynomial.scaleSubtractMultiple(C b, ExpVector g, C a, ExpVector e, GenPolynomial<C> S)	GenPolynomial scale and subtract a multiple.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.selectWithVariable(List<GenPolynomial<C>> P, int i)	Select polynomial with univariate leading term in variable i.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.seriesOfTaylor(GenPolynomial<C> f, C a)	Taylor series for polynomial.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.substituteMain(GenPolynomial<C> A, GenPolynomial<C> s)	Substitute main variable.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.substituteUnivariate(GenPolynomial<C> f, GenPolynomial<C> t)	Substitute univariate polynomial.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.substituteUnivariateMult(GenPolynomial<C> f, GenPolynomial<C> t)	Substitute univariate polynomial with multivariate coefficients.
GenPolynomial<C>	GenPolynomial.subtract(C a)	GenPolynomial subtract.
GenPolynomial<C>	GenPolynomial.subtract(C a, ExpVector e)	GenPolynomial subtraction.
GenPolynomial<C>	GenPolynomial.subtract(GenPolynomial<C> S)	GenPolynomial subtraction.
GenPolynomial<C>	GenPolynomial.subtract(Monomial<C> m)	GenPolynomial subtraction.
GenPolynomial<C>	GenPolynomial.subtractMultiple(C a, ExpVector e, GenPolynomial<C> S)	GenPolynomial subtract a multiple.
GenPolynomial<C>	GenPolynomial.subtractMultiple(C a, GenPolynomial<C> S)	GenPolynomial subtract a multiple.
GenPolynomial<C>	GenPolynomial.sum(C a)	GenPolynomial addition.
GenPolynomial<C>	GenPolynomial.sum(C a, ExpVector e)	GenPolynomial addition.
GenPolynomial<C>	GenPolynomial.sum(GenPolynomial<C> S)	GenPolynomial summation.
GenPolynomial<C>	GenPolynomial.sum(Monomial<C> m)	GenPolynomial addition.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.switchVariables(GenPolynomial<GenPolynomial<C>> P)	Recursive GenPolynomial switch variable blocks.
static <C extends RingElem<C>> GenPolynomial<Complex<C>>	PolyUtil.toComplex(GenPolynomialRing<Complex<C>> fac, GenPolynomial<C> A)	Complex from real polynomial.
static GenPolynomial<Product<ModInteger>>	PolyUtil.toProduct(GenPolynomialRing<Product<ModInteger>> pfac, GenPolynomial<BigInteger> A)	Product representation.
static <C extends GcdRingElem<C>> GenPolynomial<Product<C>>	PolyUtil.toProductGen(GenPolynomialRing<Product<C>> pfac, GenPolynomial<C> A)	Product representation.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.toRecursive(GenPolynomialRing<GenPolynomial<C>> rfac, GenPolynomial<C> A)	To recursive representation.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.translation(GenPolynomial<C> A, List<C> H)	Polynomial translation, all variables.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.translation1(GenPolynomial<C> A, List<C> H)	Polynomial translation, r-1 variables.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.translationBase(GenPolynomial<C> A, C h)	Polynomial translation, base univariate.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.translationMain(GenPolynomial<C> A, C h)	Polynomial translation, main variable.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.translationMainRecursive(GenPolynomial<GenPolynomial<C>> A, C h)	Polynomial translation, main variable.
GenPolynomial<C>	GenPolynomialRing.univariate(int i)	Generate univariate polynomial in a given variable.
GenPolynomial<C>	GenPolynomialRing.univariate(int modv, int i, long e)	Generate univariate polynomial in a given variable with given exponent.
GenPolynomial<C>	GenPolynomialRing.univariate(int i, long e)	Generate univariate polynomial in a given variable with given exponent.
GenPolynomial<C>	GenPolynomialRing.univariate(String x)	Generate univariate polynomial in a given variable with given exponent.
GenPolynomial<C>	GenPolynomialRing.univariate(String x, long e)	Generate univariate polynomial in a given variable with given exponent.
GenPolynomial<C>	GenPolynomialRing.valueOf(C a)	Get a (constant) GenPolynomial<C> element from a coefficient value.
GenPolynomial<C>	GenPolynomialRing.valueOf(C a, ExpVector e)	Get a GenPolynomial<C> element from a coefficient and an exponent vector.
GenPolynomial<C>	GenPolynomialRing.valueOf(ExpVector e)	Get a GenPolynomial<C> element from an exponent vector.
GenPolynomial<C>	GenPolynomialRing.valueOf(Monomial<C> m)	Get a GenPolynomial<C> element from a monomial.

Methods in edu.jas.poly that return types with arguments of type GenPolynomial

Modifier and Type	Method	Description
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.baseRecursiveDivide(GenPolynomial<GenPolynomial<C>> P, C s)	GenPolynomial base divide.
static <C extends RingElem<C>> List<List<GenPolynomial<C>>>	ModuleList.castToList(List<List<GenSolvablePolynomial<C>>> slist)	Get a solvable polynomials list as List of GenPolynomials.
static <C extends RingElem<C>> List<GenPolynomial<C>>	PolynomialList.castToList(List<? extends GenPolynomial<C>> slist)	Get list of extensions of polynomials as List of GenPolynomials.
static <C extends RingElem<C>> List<List<GenPolynomial<C>>>	PolynomialList.castToMatrix(List<List<? extends GenPolynomial<C>>> slist)	Get list of list of extensions of polynomials as List of List of GenPolynomials.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.coefficientPseudoDivide(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<C> s)	GenPolynomial pseudo divide.
Map<ExpVector, GenPolynomial<C>>	GenPolynomial.contract(GenPolynomialRing<C> pfac)	Contract variables.
List<GenPolynomial<C>>	GenPolynomialRing.copy(List<GenPolynomial<C>> L)	Copy polynomial list.
static <C extends RingElem<C>> List<GenPolynomial<BigInteger>>	TermOrderOptimization.degreeMatrix(GenPolynomial<C> A)	Degree matrix.
static <C extends RingElem<C>> List<GenPolynomial<BigInteger>>	TermOrderOptimization.degreeMatrix(Collection<GenPolynomial<C>> L)	Degree matrix.
static <C extends RingElem<C>> List<GenPolynomial<BigInteger>>	TermOrderOptimization.degreeMatrixOfCoefficients(GenPolynomial<GenPolynomial<C>> A)	Degree matrix of coefficient polynomials.
static <C extends RingElem<C>> List<GenPolynomial<BigInteger>>	TermOrderOptimization.degreeMatrixOfCoefficients(Collection<GenPolynomial<GenPolynomial<C>>> L)	Degree matrix of coefficient polynomials.
static <C extends RingElem<C>> List<GenPolynomial<C>>	PolyUtil.distribute(GenPolynomialRing<C> dfac, List<GenPolynomial<GenPolynomial<C>>> L)	Distribute a recursive polynomial list to a generic polynomial list.
GenPolynomial<GenPolynomial<C>>	DistToRec.eval(GenPolynomial<C> c)
GenSolvablePolynomial<GenPolynomial<C>>	RecSolvablePolynomial.evalAsRightRecursivePolynomial()	Evaluate RecSolvablePolynomial as right coefficients polynomial.
static <C extends RingElem<C>> List<GenPolynomial<C>>	PolyUtil.evaluateMain(GenPolynomialRing<C> cfac, List<GenPolynomial<C>> L, C a)	Evaluate at main variable.
static List<GenPolynomial<BigInteger>>	TermOrderOptimization.expVectorAdd(List<GenPolynomial<BigInteger>> dm, ExpVector e)	Degree matrix exponent vector add.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.extendCoefficients(GenPolynomialRing<GenPolynomial<C>> pfac, GenPolynomial<GenPolynomial<C>> A, int j, long k)	Extend coefficient variables.
static <C extends RingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	PolyUtil.extendCoefficients(GenSolvablePolynomialRing<GenPolynomial<C>> pfac, GenSolvablePolynomial<GenPolynomial<C>> A, int j, long k)	Extend coefficient variables.
static <C extends RingElem<C>> GenExteriorPolynomial<GenPolynomial<C>>	PolyUtil.exteriorDerivativePoly(GenExteriorPolynomial<GenPolynomial<C>> P)	GenExteriorPolynomial over polynomial exterior derivative.
static <C extends GcdRingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.fromAlgebraicCoefficients(GenPolynomialRing<GenPolynomial<C>> rfac, GenPolynomial<AlgebraicNumber<C>> A)	From AlgebraicNumber coefficients.
static <C extends RingElem<C>> List<GenPolynomial<C>>	PolyUtil.fromIntegerCoefficients(GenPolynomialRing<C> fac, List<GenPolynomial<BigInteger>> L)	From BigInteger coefficients.
(package private) Map<ExpVectorPair, GenPolynomial<C>>	RelationTable.fromListDeg2(List a)	Convert mixed list to map for base relations.
List<GenPolynomial<C>>	GenPolynomialRing.generators()	Get a list of the generating elements.
List<GenPolynomial<C>>	GenPolynomialRing.generators(int modv)	Get a list of the generating elements excluding the module variables.
List<GenPolynomial<C>>	GenPolynomialRing.getGenerators()	Get the generating elements excluding the generators for the coefficient ring.
List<GenPolynomial<C>>	PolynomialList.getList()	Get list.
static <C extends RingElem<C> & Modular> List<GenPolynomial<BigInteger>>	PolyUtil.integerFromModularCoefficients(GenPolynomialRing<BigInteger> fac, List<GenPolynomial<C>> L)	BigInteger from ModInteger coefficients, symmetric.
static List<GenPolynomial<BigInteger>>	PolyUtil.integerFromRationalCoefficients(GenPolynomialRing<BigInteger> fac, List<GenPolynomial<BigRational>> L)	BigInteger from BigRational coefficients.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.interpolate(GenPolynomialRing<GenPolynomial<C>> fac, GenPolynomial<GenPolynomial<C>> A, GenPolynomial<C> M, C mi, GenPolynomial<C> B, C am)	ModInteger interpolate on first variable.
static <C extends RingElem<C>> List<GenPolynomial<C>>	PolyUtil.intersect(GenPolynomialRing<C> R, List<GenPolynomial<C>> F)	Intersection.
Iterator<GenPolynomial<C>>	GenPolynomialRing.iterator()	Get a GenPolynomial iterator.
List<GenPolynomial<C>>	PolynomialList.leadingWeightPolynomials()	Leading weight polynomials.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.monic(GenPolynomial<GenPolynomial<C>> p)	GenPolynomial monic, i.e.
static <C extends RingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	PolyUtil.monic(GenSolvablePolynomial<GenPolynomial<C>> p)	GenSolvablePolynomial monic, i.e.
static <C extends RingElem<C>> List<GenPolynomial<C>>	PolyUtil.monic(List<GenPolynomial<C>> L)	Polynomial list monic.
static <C extends RingElem<C>> List<GenPolynomial<GenPolynomial<C>>>	PolyUtil.monicRec(List<GenPolynomial<GenPolynomial<C>>> L)	Recursive polynomial list monic.
static <C extends RingElem<C>> List<GenPolynomial<GenPolynomial<C>>>	PolyUtil.monicRec(List<GenPolynomial<GenPolynomial<C>>> L)	Recursive polynomial list monic.
List<GenPolynomial>	GenPolynomialTokenizer.nextPolynomialList()	Parsing method for polynomial list.
List<List<GenPolynomial>>	GenPolynomialTokenizer.nextSubModuleList()	Parsing method for submodule list.
static <C extends RingElem<C>> OptimizedPolynomialList<GenPolynomial<C>>	TermOrderOptimization.optimizeTermOrderOnCoefficients(GenPolynomialRing<GenPolynomial<C>> ring, List<GenPolynomial<GenPolynomial<C>>> L)	Optimize variable order on coefficients.
static <C extends RingElem<C>> OptimizedModuleList<GenPolynomial<C>>	TermOrderOptimization.optimizeTermOrderOnCoefficients(ModuleList<GenPolynomial<C>> P)	Optimize variable order on coefficients.
static <C extends RingElem<C>> OptimizedPolynomialList<GenPolynomial<C>>	TermOrderOptimization.optimizeTermOrderOnCoefficients(PolynomialList<GenPolynomial<C>> P)	Optimize variable order on coefficients.
static <C extends RingElem<C>> List<List<GenPolynomial<C>>>	ModuleList.padCols(GenPolynomialRing<C> ring, List<List<GenPolynomial<C>>> l)	Pad columns and remove zero rows.
GenSolvablePolynomialRing<GenPolynomial<C>>	RecSolvablePolynomialRing.permutation(List<Integer> P)	Permutation of polynomial ring variables.
static <C extends RingElem<C>> List<GenPolynomial<C>>	TermOrderOptimization.permutation(List<Integer> P, GenPolynomialRing<C> R, List<GenPolynomial<C>> L)	Permutation of polynomial exponent vectors.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	TermOrderOptimization.permutationOnCoefficients(List<Integer> P, GenPolynomialRing<GenPolynomial<C>> R, GenPolynomial<GenPolynomial<C>> A)	Permutation of polynomial exponent vectors of coefficient polynomials.
static <C extends RingElem<C>> List<GenPolynomial<GenPolynomial<C>>>	TermOrderOptimization.permutationOnCoefficients(List<Integer> P, GenPolynomialRing<GenPolynomial<C>> R, List<GenPolynomial<GenPolynomial<C>>> L)	Permutation of polynomial exponent vectors of coefficients.
static <C extends RingElem<C>> List<GenPolynomial<GenPolynomial<C>>>	TermOrderOptimization.permutationOnCoefficients(List<Integer> P, GenPolynomialRing<GenPolynomial<C>> R, List<GenPolynomial<GenPolynomial<C>>> L)	Permutation of polynomial exponent vectors of coefficients.
GenPolynomialRing<GenPolynomial<C>>	GenPolynomialRing.recursive(int i)	Recursive representation as polynomial with i main variables.
GenSolvablePolynomialRing<GenPolynomial<C>>	GenSolvablePolynomialRing.recursive(int i)	Recursive representation as polynomial ring with i main variables.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursive(GenPolynomialRing<GenPolynomial<C>> rfac, GenPolynomial<C> A)	Recursive representation.
static <C extends RingElem<C>> List<GenPolynomial<GenPolynomial<C>>>	PolyUtil.recursive(GenPolynomialRing<GenPolynomial<C>> rfac, List<GenPolynomial<C>> L)	Recursive representation.
static <C extends RingElem<C>> List<GenPolynomial<GenPolynomial<C>>>	PolyUtil.recursive(GenPolynomialRing<GenPolynomial<C>> rfac, List<GenPolynomial<C>> L)	Recursive representation.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursiveDensePseudoRemainder(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	GenPolynomial dense pseudo remainder.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursiveDerivative(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive polynomial derivative main variable.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursiveDivide(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<C> s)	GenPolynomial divide.
static <C extends RingElem<C>> GenWordPolynomial<GenPolynomial<C>>	PolyUtil.recursiveDivide(GenWordPolynomial<GenPolynomial<C>> P, GenPolynomial<C> s)	GenPolynomial divide.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursivePseudoDivide(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	GenPolynomial recursive pseudo divide.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursivePseudoRemainder(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Deprecated. (forRemoval=true) Use PolyUtil.recursiveSparsePseudoRemainder(edu.jas.poly.GenPolynomial,edu.jas.poly.GenPolynomial) instead
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursiveSparsePseudoRemainder(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	GenPolynomial sparse pseudo remainder.
static <C extends RingElem<C>> List<GenPolynomial<C>>	PolyUtil.rightMonic(List<GenPolynomial<C>> L)	Solvable polynomial list right monic.
GenSolvablePolynomial<GenPolynomial<C>>	RecSolvablePolynomial.rightRecursivePolynomial()	RecSolvablePolynomial right coefficients from left coefficients.
static <C extends RingElem<C>> List<List<GenPolynomial<C>>>	OrderedModuleList.sort(GenPolynomialRing<C> r, List<List<GenPolynomial<C>>> l)	Sort a list of vectors of polynomials with respect to the ascending order of the leading Exponent vectors of the first column.
static <C extends RingElem<C>> List<GenPolynomial<C>>	OrderedPolynomialList.sort(GenPolynomialRing<C> r, List<GenPolynomial<C>> L)	Sort a list of polynomials with respect to the ascending order of the leading Exponent vectors.
static <C extends RingElem<C>> List<GenPolynomial<C>>	OrderedPolynomialList.sort(List<GenPolynomial<C>> L)	Sort a list of polynomials with respect to the ascending order of the leading Exponent vectors.
static <C extends RingElem<C>> List<GenPolynomial<C>>	OrderedPolynomialList.sortDegree(List<GenPolynomial<C>> L)	Sort a list of polynomials with respect to the ascending order of the degree.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.switchVariables(GenPolynomial<GenPolynomial<C>> P)	Recursive GenPolynomial switch variable blocks.
static <C extends RingElem<C>> Product<GenPolynomial<C>>	PolyUtil.toProduct(ProductRing<GenPolynomial<C>> pfac, C c, ExpVector e)	Product representation.
static <C extends RingElem<C>> Product<GenPolynomial<C>>	PolyUtil.toProduct(ProductRing<GenPolynomial<C>> pfac, GenPolynomial<C> A)	Product representation.
static List<GenPolynomial<Product<ModInteger>>>	PolyUtil.toProduct(GenPolynomialRing<Product<ModInteger>> pfac, List<GenPolynomial<BigInteger>> L)	Product representation.
static <C extends GcdRingElem<C>> List<GenPolynomial<Product<C>>>	PolyUtil.toProductGen(GenPolynomialRing<Product<C>> pfac, List<GenPolynomial<C>> L)	Product representation.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.toRecursive(GenPolynomialRing<GenPolynomial<C>> rfac, GenPolynomial<C> A)	To recursive representation.
static <C extends RingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	PolyUtil.toRecursive(GenSolvablePolynomialRing<GenPolynomial<C>> rfac, GenSolvablePolynomial<C> A)	To recursive representation.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.translationMainRecursive(GenPolynomial<GenPolynomial<C>> A, C h)	Polynomial translation, main variable.
List<? extends GenPolynomial<C>>	GenPolynomialRing.univariateList()	Generate list of univariate polynomials in all variables.
List<? extends GenPolynomial<C>>	GenPolynomialRing.univariateList(int modv)	Generate list of univariate polynomials in all variables.
List<? extends GenPolynomial<C>>	GenPolynomialRing.univariateList(int modv, long e)	Generate list of univariate polynomials in all variables with given exponent.
List<GenPolynomial<C>>	GenPolynomialRing.valueOf(Iterable<ExpVector> E)	Get a GenPolynomial<C> element from a list of exponent vectors.
static <C extends RingElem<C>> List<List<GenPolynomial<C>>>	ModuleList.vecToList(List<GenVector<GenPolynomial<C>>> vlist)	Get a list of vectors as List of list of GenPolynomials.

Methods in edu.jas.poly with parameters of type GenPolynomial

Modifier and Type	Method	Description
static <C extends RingElem<C>> C	PolyUtil.absNorm(GenPolynomial<C> p)	Absolute norm.
static <C extends GcdRingElem<C>> GenPolynomial<AlgebraicNumber<C>>	PolyUtil.algebraicFromComplex(GenPolynomialRing<AlgebraicNumber<C>> fac, GenPolynomial<Complex<C>> A)	AlgebraicNumber from complex coefficients.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.baseDensePseudoQuotient(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial dense pseudo quotient.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.baseDensePseudoRemainder(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial dense pseudo remainder.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.baseDerivative(GenPolynomial<C> P)	GenPolynomial polynomial derivative main variable.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.baseDerivative(GenPolynomial<C> P, int r)	GenPolynomial polynomial partial derivative variable r.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.baseIntegral(GenPolynomial<C> P)	GenPolynomial polynomial integral main variable.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.basePseudoDivide(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial sparse pseudo divide.
static <C extends RingElem<C>> GenPolynomial<C>[]	PolyUtil.basePseudoQuotientRemainder(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial sparse pseudo quotient and remainder.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.basePseudoRemainder(GenPolynomial<C> P, GenPolynomial<C> S)	Deprecated. (forRemoval=true) Use PolyUtil.baseSparsePseudoRemainder(edu.jas.poly.GenPolynomial,edu.jas.poly.GenPolynomial) instead
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.baseRecursiveDivide(GenPolynomial<GenPolynomial<C>> P, C s)	GenPolynomial base divide.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.baseRemainderPoly(GenPolynomial<C> P, C s)	GenPolynomial coefficient wise remainder.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.baseSparsePseudoRemainder(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial sparse pseudo remainder.
static <C extends RingElem<C> & Modular> GenPolynomial<C>	PolyUtil.chineseRemainder(GenPolynomialRing<C> fac, GenPolynomial<C> A, C mi, GenPolynomial<C> B)	ModInteger chinese remainder algorithm on coefficients.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.coefficientBasePseudoDivide(GenPolynomial<C> P, C s)	GenPolynomial pseudo divide.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.coefficientPseudoDivide(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<C> s)	GenPolynomial pseudo divide.
static <C extends RingElem<C>> long	PolyUtil.coeffMaxDegree(GenPolynomial<GenPolynomial<C>> A)	Maximal degree in the coefficient polynomials.
int	PolynomialComparator.compare(GenPolynomial<C> p1, GenPolynomial<C> p2)	Compare polynomials.
int	GenPolynomial.compareTo(GenPolynomial<C> b)	GenPolynomial comparison.
static <C extends RingElem<C> & Rational> GenPolynomial<Complex<BigDecimal>>	PolyUtil.complexDecimalFromRational(GenPolynomialRing<Complex<BigDecimal>> fac, GenPolynomial<Complex<C>> A)	Convert to complex decimal coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<Complex<C>>	PolyUtil.complexFromAlgebraic(GenPolynomialRing<Complex<C>> fac, GenPolynomial<AlgebraicNumber<C>> A)	Complex from algebraic coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<Complex<C>>	PolyUtil.complexFromAny(GenPolynomialRing<Complex<C>> fac, GenPolynomial<C> A)	Complex from ring element coefficients.
static GenPolynomial<BigComplex>	PolyUtil.complexFromRational(GenPolynomialRing<BigComplex> fac, GenPolynomial<BigRational> A)	Complex from rational coefficients.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.conjugateCoeff(GenPolynomial<C> A)	Conjugate coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<AlgebraicNumber<C>>	PolyUtil.convertRecursiveToAlgebraicCoefficients(GenPolynomialRing<AlgebraicNumber<C>> pfac, GenPolynomial<GenPolynomial<C>> A)	Convert to AlgebraicNumber coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<AlgebraicNumber<C>>	PolyUtil.convertToAlgebraicCoefficients(GenPolynomialRing<AlgebraicNumber<C>> pfac, GenPolynomial<C> A)	Convert to AlgebraicNumber coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<AlgebraicNumber<C>>	PolyUtil.convertToRecAlgebraicCoefficients(int depth, GenPolynomialRing<AlgebraicNumber<C>> pfac, GenPolynomial<C> A)	Convert to recursive AlgebraicNumber coefficients.
GenPolynomial<C>	GenPolynomialRing.copy(GenPolynomial<C> c)	Copy polynomial c.
static <C extends RingElem<C> & Rational> GenPolynomial<BigDecimal>	PolyUtil.decimalFromRational(GenPolynomialRing<BigDecimal> fac, GenPolynomial<C> A)	Convert to decimal coefficients.
static <C extends RingElem<C>> List<GenPolynomial<BigInteger>>	TermOrderOptimization.degreeMatrix(GenPolynomial<C> A)	Degree matrix.
static <C extends RingElem<C>> List<GenPolynomial<BigInteger>>	TermOrderOptimization.degreeMatrixOfCoefficients(GenPolynomial<GenPolynomial<C>> A)	Degree matrix of coefficient polynomials.
C	GenPolynomialRing.determinantFromCharPol(GenPolynomial<C> P)	Determinant of matrix from characteristic polynomial.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.distribute(GenPolynomialRing<C> dfac, GenPolynomial<GenPolynomial<C>> B)	Distribute a recursive polynomial to a generic polynomial.
GenPolynomial<C>	GenPolynomial.divide(GenPolynomial<C> S)	GenPolynomial division.
void	GenPolynomial.doAddTo(GenPolynomial<C> S)	GenPolynomial destructive summation.
GenPolynomial<C>[]	GenPolynomial.egcd(GenPolynomial<C> S)	GenPolynomial extended greatest common divisor.
GenPolynomial<GenPolynomial<C>>	DistToRec.eval(GenPolynomial<C> c)
C	EvalAllPol.eval(GenPolynomial<C> c)
C	EvalMain.eval(GenPolynomial<C> c)
GenPolynomial<C>	EvalMainPol.eval(GenPolynomial<C> c)
GenPolynomial<D>	FromIntegerPoly.eval(GenPolynomial<BigInteger> c)
AlgebraicNumber<C>	PolyToAlg.eval(GenPolynomial<C> c)
GenPolynomial<BigInteger>	RatToIntPoly.eval(GenPolynomial<BigRational> c)
GenPolynomial<C>	RecToDist.eval(GenPolynomial<GenPolynomial<C>> c)
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.evaluate(GenPolynomialRing<C> cfac, GenPolynomialRing<GenPolynomial<C>> rfac, GenPolynomialRing<GenPolynomial<C>> nfac, GenPolynomialRing<C> dfac, GenPolynomial<C> A, C a)	Evaluate at k-th variable.
static <C extends RingElem<C>> C	PolyUtil.evaluateAll(RingFactory<C> cfac, GenPolynomial<C> A, List<C> a)	Evaluate all variables.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.evaluateFirst(GenPolynomialRing<C> cfac, GenPolynomialRing<C> dfac, GenPolynomial<C> A, C a)	Evaluate at first (lowest) variable.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.evaluateFirstRec(GenPolynomialRing<C> cfac, GenPolynomialRing<C> dfac, GenPolynomial<GenPolynomial<C>> A, C a)	Evaluate at first (lowest) variable.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.evaluateMain(GenPolynomialRing<C> cfac, GenPolynomial<C> A, C a)	Evaluate at main variable.
static <C extends RingElem<C>> C	PolyUtil.evaluateMain(RingFactory<C> cfac, GenPolynomial<C> A, C a)	Evaluate at main variable.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.evaluateMainRecursive(GenPolynomialRing<C> cfac, GenPolynomial<GenPolynomial<C>> A, C a)	Evaluate at main variable.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.extendCoefficients(GenPolynomialRing<GenPolynomial<C>> pfac, GenPolynomial<GenPolynomial<C>> A, int j, long k)	Extend coefficient variables.
static <C extends GcdRingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.fromAlgebraicCoefficients(GenPolynomialRing<GenPolynomial<C>> rfac, GenPolynomial<AlgebraicNumber<C>> A)	From AlgebraicNumber coefficients.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.fromIntegerCoefficients(GenPolynomialRing<C> fac, GenPolynomial<BigInteger> A)	From BigInteger coefficients.
GenExteriorPolynomial<C>	GenExteriorPolynomialRing.fromPolynomial(GenPolynomial<C> a)	Get a GenExteriorPolynomial from a univariate GenPolynomial.
GenPolynomial<C>	GenPolynomial.gcd(GenPolynomial<C> S)	GenPolynomial greatest common divisor.
GenPolynomial<C>[]	GenPolynomial.hegcd(GenPolynomial<C> S)	GenPolynomial half extended greatest common divisor.
static GenPolynomial<BigRational>	PolyUtil.imaginaryPart(GenPolynomialRing<BigRational> fac, GenPolynomial<BigComplex> A)	Imaginary part.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.imaginaryPartFromComplex(GenPolynomialRing<C> fac, GenPolynomial<Complex<C>> A)	Imaginary part.
static <C extends RingElem<C> & Modular> GenPolynomial<BigInteger>	PolyUtil.integerFromModularCoefficients(GenPolynomialRing<BigInteger> fac, GenPolynomial<C> A)	BigInteger from ModInteger coefficients, symmetric.
static <C extends RingElem<C> & Modular> GenPolynomial<BigInteger>	PolyUtil.integerFromModularCoefficientsPositive(GenPolynomialRing<BigInteger> fac, GenPolynomial<C> A)	BigInteger from ModInteger coefficients, positive.
static GenPolynomial<BigInteger>	PolyUtil.integerFromRationalCoefficients(GenPolynomialRing<BigInteger> fac, GenPolynomial<BigRational> A)	BigInteger from BigRational coefficients.
static GenPolynomial<BigInteger>	PolyUtil.integerFromRationalCoefficients(GenPolynomialRing<BigInteger> fac, BigInteger gcd, BigInteger lcm, GenPolynomial<BigRational> A)	BigInteger from BigRational coefficients.
static Object[]	PolyUtil.integerFromRationalCoefficientsFactor(GenPolynomialRing<BigInteger> fac, GenPolynomial<BigRational> A)	BigInteger from BigRational coefficients.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.interpolate(GenPolynomialRing<C> fac, GenPolynomial<C> A, GenPolynomial<C> M, C mi, C a, C am)	Univariate polynomial interpolation.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.interpolate(GenPolynomialRing<GenPolynomial<C>> fac, GenPolynomial<GenPolynomial<C>> A, GenPolynomial<C> M, C mi, GenPolynomial<C> B, C am)	ModInteger interpolate on first variable.
static <C extends RingElem<C>> boolean	PolyUtil.isBasePseudoQuotientRemainder(GenPolynomial<C> P, GenPolynomial<C> S, GenPolynomial<C> q, GenPolynomial<C> r)	Is GenPolynomial pseudo quotient and remainder.
static <C extends RingElem<C>> boolean	PolyUtil.isRecursivePseudoQuotientRemainder(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S, GenPolynomial<GenPolynomial<C>> q, GenPolynomial<GenPolynomial<C>> r)	Is recursive GenPolynomial pseudo quotient and remainder.
static <C extends RingElem<C>, D extends RingElem<D>> GenPolynomial<D>	PolyUtil.map(GenPolynomialRing<D> ring, GenPolynomial<C> p, UnaryFunctor<C,D> f)	Map a unary function to the coefficients.
GenPolynomial<C>	GenPolynomial.modInverse(GenPolynomial<C> m)	GenPolynomial modular inverse.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.monic(GenPolynomial<GenPolynomial<C>> p)	GenPolynomial monic, i.e.
AlgebraicNumber<C>	AlgebraicNumber.multiply(GenPolynomial<C> c)	AlgebraicNumber multiplication.
GenPolynomial<C>	GenPolynomial.multiply(GenPolynomial<C> S)	GenPolynomial multiplication.
RecSolvablePolynomial<C>	RecSolvablePolynomial.multiply(GenPolynomial<C> b, ExpVector e)	RecSolvablePolynomial multiplication.
RecSolvablePolynomial<C>	RecSolvablePolynomial.multiply(GenPolynomial<C> b, ExpVector e, GenPolynomial<C> c, ExpVector f)	RecSolvablePolynomial left and right multiplication.
RecSolvablePolynomial<C>	RecSolvablePolynomial.multiply(GenPolynomial<C> b, GenPolynomial<C> c)	RecSolvablePolynomial left and right multiplication.
RecSolvablePolynomial<C>	RecSolvablePolynomial.multiplyLeft(GenPolynomial<C> b)	RecSolvablePolynomial multiplication.
RecSolvablePolynomial<C>	RecSolvablePolynomial.multiplyLeft(GenPolynomial<C> b, ExpVector e)	RecSolvablePolynomial multiplication.
RecSolvablePolynomial<C>	RecSolvablePolynomial.multiplyRightComm(GenPolynomial<C> b)	RecSolvablePolynomial multiplication.
static <C extends RingElem<C>> GenPolynomial<C>	TermOrderOptimization.permutation(List<Integer> P, GenPolynomialRing<C> R, GenPolynomial<C> A)	Permutation of polynomial exponent vectors.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	TermOrderOptimization.permutationOnCoefficients(List<Integer> P, GenPolynomialRing<GenPolynomial<C>> R, GenPolynomial<GenPolynomial<C>> A)	Permutation of polynomial exponent vectors of coefficient polynomials.
GenPolynomial<C>[]	GenPolynomial.quotientRemainder(GenPolynomial<C> S)	GenPolynomial division with remainder.
static GenPolynomial<BigRational>	PolyUtil.realPart(GenPolynomialRing<BigRational> fac, GenPolynomial<BigComplex> A)	Real part.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.realPartFromComplex(GenPolynomialRing<C> fac, GenPolynomial<Complex<C>> A)	Real part.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.reciprocalTransformation(GenPolynomial<C> A)	Polynomial reciprocal transformation.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.reciprocalTransformation(GenPolynomial<C> A, int i)	Polynomial reciprocal transformation.
RecSolvablePolynomial<C>	RecSolvablePolynomial.recMultiply(GenPolynomial<C> b)	RecSolvablePolynomial multiplication.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursive(GenPolynomialRing<GenPolynomial<C>> rfac, GenPolynomial<C> A)	Recursive representation.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursiveDensePseudoRemainder(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	GenPolynomial dense pseudo remainder.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursiveDerivative(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive polynomial derivative main variable.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursiveDivide(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<C> s)	GenPolynomial divide.
static <C extends RingElem<C>> GenWordPolynomial<GenPolynomial<C>>	PolyUtil.recursiveDivide(GenWordPolynomial<GenPolynomial<C>> P, GenPolynomial<C> s)	GenPolynomial divide.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursivePseudoDivide(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	GenPolynomial recursive pseudo divide.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursivePseudoRemainder(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Deprecated. (forRemoval=true) Use PolyUtil.recursiveSparsePseudoRemainder(edu.jas.poly.GenPolynomial,edu.jas.poly.GenPolynomial) instead
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursiveSparsePseudoRemainder(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	GenPolynomial sparse pseudo remainder.
GenPolynomial<C>	GenPolynomial.remainder(GenPolynomial<C> S)	GenPolynomial remainder.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.removeUnusedLowerVariables(GenPolynomial<C> p)	Remove all lower variables which do not occur in polynomial.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.removeUnusedMiddleVariables(GenPolynomial<C> p)	Remove upper block of middle variables which do not occur in polynomial.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.removeUnusedUpperVariables(GenPolynomial<C> p)	Remove all upper variables which do not occur in polynomial.
C	GenExteriorPolynomialRing.resultant(GenPolynomial<C> A, GenPolynomial<C> B)	Resultant of two commutative polynaomials.
GenPolynomial<C>	GenPolynomial.rightGcd(GenPolynomial<C> S)	GenPolynomial greatest common divisor.
GenPolynomial<C>	GenPolynomial.scaleSubtractMultiple(C b, C a, ExpVector e, GenPolynomial<C> S)	GenPolynomial scale and subtract a multiple.
GenPolynomial<C>	GenPolynomial.scaleSubtractMultiple(C b, C a, GenPolynomial<C> S)	GenPolynomial scale and subtract a multiple.
GenPolynomial<C>	GenPolynomial.scaleSubtractMultiple(C b, ExpVector g, C a, ExpVector e, GenPolynomial<C> S)	GenPolynomial scale and subtract a multiple.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.seriesOfTaylor(GenPolynomial<C> f, C a)	Taylor series for polynomial.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.substituteMain(GenPolynomial<C> A, GenPolynomial<C> s)	Substitute main variable.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.substituteUnivariate(GenPolynomial<C> f, GenPolynomial<C> t)	Substitute univariate polynomial.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.substituteUnivariateMult(GenPolynomial<C> f, GenPolynomial<C> t)	Substitute univariate polynomial with multivariate coefficients.
GenPolynomial<C>	GenPolynomial.subtract(GenPolynomial<C> S)	GenPolynomial subtraction.
GenPolynomial<C>	GenPolynomial.subtractMultiple(C a, ExpVector e, GenPolynomial<C> S)	GenPolynomial subtract a multiple.
GenPolynomial<C>	GenPolynomial.subtractMultiple(C a, GenPolynomial<C> S)	GenPolynomial subtract a multiple.
AlgebraicNumber<C>	AlgebraicNumber.sum(GenPolynomial<C> c)	AlgebraicNumber summation.
GenPolynomial<C>	GenPolynomial.sum(GenPolynomial<C> S)	GenPolynomial summation.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.switchVariables(GenPolynomial<GenPolynomial<C>> P)	Recursive GenPolynomial switch variable blocks.
static <C extends RingElem<C>> GenPolynomial<Complex<C>>	PolyUtil.toComplex(GenPolynomialRing<Complex<C>> fac, GenPolynomial<C> A)	Complex from real polynomial.
RecSolvablePolynomial<D>	QLRSolvablePolynomialRing.toPolyCoefficients(GenPolynomial<C> A)	Integral function from rational polynomial coefficients.
static <C extends RingElem<C>> Product<GenPolynomial<C>>	PolyUtil.toProduct(ProductRing<GenPolynomial<C>> pfac, GenPolynomial<C> A)	Product representation.
static GenPolynomial<Product<ModInteger>>	PolyUtil.toProduct(GenPolynomialRing<Product<ModInteger>> pfac, GenPolynomial<BigInteger> A)	Product representation.
static <C extends GcdRingElem<C>> GenPolynomial<Product<C>>	PolyUtil.toProductGen(GenPolynomialRing<Product<C>> pfac, GenPolynomial<C> A)	Product representation.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.toRecursive(GenPolynomialRing<GenPolynomial<C>> rfac, GenPolynomial<C> A)	To recursive representation.
C	GenPolynomialRing.traceFromCharPol(GenPolynomial<C> P)	Trace of matrix from characteristic polynomial.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.translation(GenPolynomial<C> A, List<C> H)	Polynomial translation, all variables.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.translation1(GenPolynomial<C> A, List<C> H)	Polynomial translation, r-1 variables.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.translationBase(GenPolynomial<C> A, C h)	Polynomial translation, base univariate.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.translationMain(GenPolynomial<C> A, C h)	Polynomial translation, main variable.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.translationMainRecursive(GenPolynomial<GenPolynomial<C>> A, C h)	Polynomial translation, main variable.
void	RelationTable.update(ExpVector e, ExpVector f, GenPolynomial<C> p)	Update or initialize RelationTable with new relation.
void	RelationTable.update(GenPolynomial<C> E, GenPolynomial<C> F, GenPolynomial<C> p)	Update or initialize RelationTable with new relation.
void	RelationTable.update(GenPolynomial<C> E, GenPolynomial<C> F, GenSolvablePolynomial<C> p)	Update or initialize RelationTable with new relation.
GenExteriorPolynomial<C>	GenExteriorPolynomialRing.valueOf(GenPolynomial<C> a)	Get a GenExteriorPolynomial from a multivariate GenPolynomial, terms with exponents > 1 are set to zero.
GenWordPolynomial<C>	GenWordPolynomialRing.valueOf(GenPolynomial<C> a)	Get a GenWordPolynomial<C> element from a GenPolynomial<C>.
RecSolvablePolynomial<C>	RecSolvablePolynomialRing.valueOf(GenPolynomial<C> a)	Get a (constant) RecSolvablePolynomial<C> element from a coefficient value.
RecSolvablePolynomial<C>	RecSolvablePolynomialRing.valueOf(GenPolynomial<C> a, ExpVector e)	Get a RecSolvablePolynomial<C> element from a coefficient and an exponent vector.

Method parameters in edu.jas.poly with type arguments of type GenPolynomial

Modifier and Type	Method	Description
void	RecSolvablePolynomialRing.addCoeffRelations(List<GenPolynomial<GenPolynomial<C>>> rel)	Generate the coefficient relation table of the solvable polynomial ring from a polynomial list of relations.
void	RecSolvablePolynomialRing.addCoeffRelations(List<GenPolynomial<GenPolynomial<C>>> rel)	Generate the coefficient relation table of the solvable polynomial ring from a polynomial list of relations.
void	GenSolvablePolynomialRing.addRelations(List<GenPolynomial<C>> rel)	Generate the relation table of the solvable polynomial ring from a polynomial list of relations.
void	RelationTable.addRelations(List<GenPolynomial<C>> rel)	Add list of polynomial triples as relations.
void	RecSolvablePolynomialRing.addSolvCoeffRelations(List<GenSolvablePolynomial<GenPolynomial<C>>> rel)	Generate the coefficient relation table of the solvable polynomial ring from a solvable polynomial list of relations.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.baseRecursiveDivide(GenPolynomial<GenPolynomial<C>> P, C s)	GenPolynomial base divide.
static <C extends RingElem<C>> List<GenPolynomial<C>>	PolynomialList.castToList(List<? extends GenPolynomial<C>> slist)	Get list of extensions of polynomials as List of GenPolynomials.
static <C extends RingElem<C>> List<List<GenPolynomial<C>>>	PolynomialList.castToMatrix(List<List<? extends GenPolynomial<C>>> slist)	Get list of list of extensions of polynomials as List of List of GenPolynomials.
static <C extends RingElem<C>> List<GenSolvablePolynomial<C>>	PolynomialList.castToSolvableList(List<GenPolynomial<C>> list)	Get list as List of GenSolvablePolynomials.
static <C extends RingElem<C>> List<List<GenSolvablePolynomial<C>>>	PolynomialList.castToSolvableMatrix(List<List<GenPolynomial<C>>> list)	Get list of list as List of List of GenSolvablePolynomials.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.coefficientPseudoDivide(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<C> s)	GenPolynomial pseudo divide.
static <C extends RingElem<C>> long	PolyUtil.coeffMaxDegree(GenPolynomial<GenPolynomial<C>> A)	Maximal degree in the coefficient polynomials.
static <C extends GcdRingElem<C>> GenPolynomial<AlgebraicNumber<C>>	PolyUtil.convertRecursiveToAlgebraicCoefficients(GenPolynomialRing<AlgebraicNumber<C>> pfac, GenPolynomial<GenPolynomial<C>> A)	Convert to AlgebraicNumber coefficients.
List<GenPolynomial<C>>	GenPolynomialRing.copy(List<GenPolynomial<C>> L)	Copy polynomial list.
static <C extends RingElem<C>> List<GenPolynomial<BigInteger>>	TermOrderOptimization.degreeMatrix(Collection<GenPolynomial<C>> L)	Degree matrix.
static <C extends RingElem<C>> List<GenPolynomial<BigInteger>>	TermOrderOptimization.degreeMatrixOfCoefficients(GenPolynomial<GenPolynomial<C>> A)	Degree matrix of coefficient polynomials.
static <C extends RingElem<C>> List<GenPolynomial<BigInteger>>	TermOrderOptimization.degreeMatrixOfCoefficients(Collection<GenPolynomial<GenPolynomial<C>>> L)	Degree matrix of coefficient polynomials.
static <C extends RingElem<C>> List<GenPolynomial<BigInteger>>	TermOrderOptimization.degreeMatrixOfCoefficients(Collection<GenPolynomial<GenPolynomial<C>>> L)	Degree matrix of coefficient polynomials.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.distribute(GenPolynomialRing<C> dfac, GenPolynomial<GenPolynomial<C>> B)	Distribute a recursive polynomial to a generic polynomial.
static <C extends RingElem<C>> List<GenPolynomial<C>>	PolyUtil.distribute(GenPolynomialRing<C> dfac, List<GenPolynomial<GenPolynomial<C>>> L)	Distribute a recursive polynomial list to a generic polynomial list.
static <C extends RingElem<C>> List<GenPolynomial<C>>	PolyUtil.distribute(GenPolynomialRing<C> dfac, List<GenPolynomial<GenPolynomial<C>>> L)	Distribute a recursive polynomial list to a generic polynomial list.
(package private) boolean	RelationTable.equalMaps(Map<ExpVectorPair, GenPolynomial<C>> m1, Map<ExpVectorPair, GenPolynomial<C>> m2)	Equals for special maps.
GenPolynomial<C>	RecToDist.eval(GenPolynomial<GenPolynomial<C>> c)
static <C extends RingElem<C>> List<C>	PolyUtil.evaluateAll(RingFactory<C> cfac, List<GenPolynomial<C>> L, List<C> a)	Evaluate all variables.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.evaluateFirstRec(GenPolynomialRing<C> cfac, GenPolynomialRing<C> dfac, GenPolynomial<GenPolynomial<C>> A, C a)	Evaluate at first (lowest) variable.
static <C extends RingElem<C>> List<GenPolynomial<C>>	PolyUtil.evaluateMain(GenPolynomialRing<C> cfac, List<GenPolynomial<C>> L, C a)	Evaluate at main variable.
static <C extends RingElem<C>> List<C>	PolyUtil.evaluateMain(RingFactory<C> cfac, List<GenPolynomial<C>> L, C a)	Evaluate at main variable.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.evaluateMainRecursive(GenPolynomialRing<C> cfac, GenPolynomial<GenPolynomial<C>> A, C a)	Evaluate at main variable.
static List<GenPolynomial<BigInteger>>	TermOrderOptimization.expVectorAdd(List<GenPolynomial<BigInteger>> dm, ExpVector e)	Degree matrix exponent vector add.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.extendCoefficients(GenPolynomialRing<GenPolynomial<C>> pfac, GenPolynomial<GenPolynomial<C>> A, int j, long k)	Extend coefficient variables.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.extendCoefficients(GenPolynomialRing<GenPolynomial<C>> pfac, GenPolynomial<GenPolynomial<C>> A, int j, long k)	Extend coefficient variables.
static <C extends RingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	PolyUtil.extendCoefficients(GenSolvablePolynomialRing<GenPolynomial<C>> pfac, GenSolvablePolynomial<GenPolynomial<C>> A, int j, long k)	Extend coefficient variables.
static <C extends RingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	PolyUtil.extendCoefficients(GenSolvablePolynomialRing<GenPolynomial<C>> pfac, GenSolvablePolynomial<GenPolynomial<C>> A, int j, long k)	Extend coefficient variables.
static <C extends RingElem<C>> GenExteriorPolynomial<GenPolynomial<C>>	PolyUtil.exteriorDerivativePoly(GenExteriorPolynomial<GenPolynomial<C>> P)	GenExteriorPolynomial over polynomial exterior derivative.
static <C extends GcdRingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.fromAlgebraicCoefficients(GenPolynomialRing<GenPolynomial<C>> rfac, GenPolynomial<AlgebraicNumber<C>> A)	From AlgebraicNumber coefficients.
static <C extends RingElem<C>> List<GenPolynomial<C>>	PolyUtil.fromIntegerCoefficients(GenPolynomialRing<C> fac, List<GenPolynomial<BigInteger>> L)	From BigInteger coefficients.
QLRSolvablePolynomial<C,D>	QLRSolvablePolynomialRing.fromPolyCoefficients(GenSolvablePolynomial<GenPolynomial<D>> A)	Rational function from integral polynomial coefficients.
static <C extends RingElem<C> & Modular> List<GenPolynomial<BigInteger>>	PolyUtil.integerFromModularCoefficients(GenPolynomialRing<BigInteger> fac, List<GenPolynomial<C>> L)	BigInteger from ModInteger coefficients, symmetric.
static List<GenPolynomial<BigInteger>>	PolyUtil.integerFromRationalCoefficients(GenPolynomialRing<BigInteger> fac, List<GenPolynomial<BigRational>> L)	BigInteger from BigRational coefficients.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.interpolate(GenPolynomialRing<GenPolynomial<C>> fac, GenPolynomial<GenPolynomial<C>> A, GenPolynomial<C> M, C mi, GenPolynomial<C> B, C am)	ModInteger interpolate on first variable.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.interpolate(GenPolynomialRing<GenPolynomial<C>> fac, GenPolynomial<GenPolynomial<C>> A, GenPolynomial<C> M, C mi, GenPolynomial<C> B, C am)	ModInteger interpolate on first variable.
static <C extends RingElem<C>> List<GenPolynomial<C>>	PolyUtil.intersect(GenPolynomialRing<C> R, List<GenPolynomial<C>> F)	Intersection.
static <C extends RingElem<C>> boolean	PolyUtil.isRecursivePseudoQuotientRemainder(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S, GenPolynomial<GenPolynomial<C>> q, GenPolynomial<GenPolynomial<C>> r)	Is recursive GenPolynomial pseudo quotient and remainder.
boolean	RecSolvablePolynomial.isRightRecursivePolynomial(GenSolvablePolynomial<GenPolynomial<C>> R)	Test RecSolvablePolynomial right coefficients polynomial.
static <C extends RingElem<C>> List<ExpVector>	PolyUtil.leadingExpVector(List<GenPolynomial<C>> L)	Polynomial list leading exponent vectors.
static <C extends RingElem<C>> long	PolyUtil.maxDegree(List<GenPolynomial<C>> P)	Maximal degree of polynomial list.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.monic(GenPolynomial<GenPolynomial<C>> p)	GenPolynomial monic, i.e.
static <C extends RingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	PolyUtil.monic(GenSolvablePolynomial<GenPolynomial<C>> p)	GenSolvablePolynomial monic, i.e.
static <C extends RingElem<C>> List<GenPolynomial<C>>	PolyUtil.monic(List<GenPolynomial<C>> L)	Polynomial list monic.
static <C extends RingElem<C>> List<GenPolynomial<GenPolynomial<C>>>	PolyUtil.monicRec(List<GenPolynomial<GenPolynomial<C>>> L)	Recursive polynomial list monic.
static <C extends RingElem<C>> List<GenPolynomial<GenPolynomial<C>>>	PolyUtil.monicRec(List<GenPolynomial<GenPolynomial<C>>> L)	Recursive polynomial list monic.
RecSolvablePolynomial<C>	RecSolvablePolynomial.multiply(Map.Entry<ExpVector, GenPolynomial<C>> m)	RecSolvablePolynomial multiplication.
RecSolvablePolynomial<C>	RecSolvablePolynomial.multiplyLeft(Map.Entry<ExpVector, GenPolynomial<C>> m)	RecSolvablePolynomial multiplication.
static List<Integer>	TermOrderOptimization.optimalPermutation(List<GenPolynomial<BigInteger>> D)	Optimal permutation for the Degree matrix.
static <C extends RingElem<C>> OptimizedPolynomialList<C>	TermOrderOptimization.optimizeTermOrder(GenPolynomialRing<C> R, List<GenPolynomial<C>> L)	Optimize variable order.
static <C extends RingElem<C>> OptimizedModuleList<C>	TermOrderOptimization.optimizeTermOrderModule(GenPolynomialRing<C> R, List<List<GenPolynomial<C>>> L)	Optimize variable order.
static <C extends RingElem<C>> OptimizedPolynomialList<GenPolynomial<C>>	TermOrderOptimization.optimizeTermOrderOnCoefficients(GenPolynomialRing<GenPolynomial<C>> ring, List<GenPolynomial<GenPolynomial<C>>> L)	Optimize variable order on coefficients.
static <C extends RingElem<C>> OptimizedPolynomialList<GenPolynomial<C>>	TermOrderOptimization.optimizeTermOrderOnCoefficients(GenPolynomialRing<GenPolynomial<C>> ring, List<GenPolynomial<GenPolynomial<C>>> L)	Optimize variable order on coefficients.
static <C extends RingElem<C>> OptimizedPolynomialList<GenPolynomial<C>>	TermOrderOptimization.optimizeTermOrderOnCoefficients(GenPolynomialRing<GenPolynomial<C>> ring, List<GenPolynomial<GenPolynomial<C>>> L)	Optimize variable order on coefficients.
static <C extends RingElem<C>> OptimizedModuleList<GenPolynomial<C>>	TermOrderOptimization.optimizeTermOrderOnCoefficients(ModuleList<GenPolynomial<C>> P)	Optimize variable order on coefficients.
static <C extends RingElem<C>> OptimizedPolynomialList<GenPolynomial<C>>	TermOrderOptimization.optimizeTermOrderOnCoefficients(PolynomialList<GenPolynomial<C>> P)	Optimize variable order on coefficients.
static <C extends RingElem<C>> List<List<GenPolynomial<C>>>	ModuleList.padCols(GenPolynomialRing<C> ring, List<List<GenPolynomial<C>>> l)	Pad columns and remove zero rows.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	TermOrderOptimization.permutationOnCoefficients(List<Integer> P, GenPolynomialRing<GenPolynomial<C>> R, GenPolynomial<GenPolynomial<C>> A)	Permutation of polynomial exponent vectors of coefficient polynomials.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	TermOrderOptimization.permutationOnCoefficients(List<Integer> P, GenPolynomialRing<GenPolynomial<C>> R, GenPolynomial<GenPolynomial<C>> A)	Permutation of polynomial exponent vectors of coefficient polynomials.
static <C extends RingElem<C>> List<GenPolynomial<GenPolynomial<C>>>	TermOrderOptimization.permutationOnCoefficients(List<Integer> P, GenPolynomialRing<GenPolynomial<C>> R, List<GenPolynomial<GenPolynomial<C>>> L)	Permutation of polynomial exponent vectors of coefficients.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursive(GenPolynomialRing<GenPolynomial<C>> rfac, GenPolynomial<C> A)	Recursive representation.
static <C extends RingElem<C>> List<GenPolynomial<GenPolynomial<C>>>	PolyUtil.recursive(GenPolynomialRing<GenPolynomial<C>> rfac, List<GenPolynomial<C>> L)	Recursive representation.
static <C extends RingElem<C>> List<GenPolynomial<GenPolynomial<C>>>	PolyUtil.recursive(GenPolynomialRing<GenPolynomial<C>> rfac, List<GenPolynomial<C>> L)	Recursive representation.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursiveDensePseudoRemainder(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	GenPolynomial dense pseudo remainder.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursiveDerivative(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive polynomial derivative main variable.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursiveDivide(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<C> s)	GenPolynomial divide.
static <C extends RingElem<C>> GenWordPolynomial<GenPolynomial<C>>	PolyUtil.recursiveDivide(GenWordPolynomial<GenPolynomial<C>> P, GenPolynomial<C> s)	GenPolynomial divide.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursivePseudoDivide(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	GenPolynomial recursive pseudo divide.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursivePseudoRemainder(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Deprecated. (forRemoval=true) Use PolyUtil.recursiveSparsePseudoRemainder(edu.jas.poly.GenPolynomial,edu.jas.poly.GenPolynomial) instead
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.recursiveSparsePseudoRemainder(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	GenPolynomial sparse pseudo remainder.
static <C extends RingElem<C>> List<GenPolynomial<C>>	PolyUtil.rightMonic(List<GenPolynomial<C>> L)	Solvable polynomial list right monic.
static <C extends RingElem<C>> GenPolynomial<C>	PolyUtil.selectWithVariable(List<GenPolynomial<C>> P, int i)	Select polynomial with univariate leading term in variable i.
static <C extends RingElem<C>> List<List<GenPolynomial<C>>>	OrderedModuleList.sort(GenPolynomialRing<C> r, List<List<GenPolynomial<C>>> l)	Sort a list of vectors of polynomials with respect to the ascending order of the leading Exponent vectors of the first column.
static <C extends RingElem<C>> List<GenPolynomial<C>>	OrderedPolynomialList.sort(GenPolynomialRing<C> r, List<GenPolynomial<C>> L)	Sort a list of polynomials with respect to the ascending order of the leading Exponent vectors.
static <C extends RingElem<C>> List<GenPolynomial<C>>	OrderedPolynomialList.sort(List<GenPolynomial<C>> L)	Sort a list of polynomials with respect to the ascending order of the leading Exponent vectors.
static <C extends RingElem<C>> List<GenPolynomial<C>>	OrderedPolynomialList.sortDegree(List<GenPolynomial<C>> L)	Sort a list of polynomials with respect to the ascending order of the degree.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.switchVariables(GenPolynomial<GenPolynomial<C>> P)	Recursive GenPolynomial switch variable blocks.
static <C extends RingElem<C>> Product<GenPolynomial<C>>	PolyUtil.toProduct(ProductRing<GenPolynomial<C>> pfac, C c, ExpVector e)	Product representation.
static <C extends RingElem<C>> Product<GenPolynomial<C>>	PolyUtil.toProduct(ProductRing<GenPolynomial<C>> pfac, GenPolynomial<C> A)	Product representation.
static List<GenPolynomial<Product<ModInteger>>>	PolyUtil.toProduct(GenPolynomialRing<Product<ModInteger>> pfac, List<GenPolynomial<BigInteger>> L)	Product representation.
static <C extends GcdRingElem<C>> List<GenPolynomial<Product<C>>>	PolyUtil.toProductGen(GenPolynomialRing<Product<C>> pfac, List<GenPolynomial<C>> L)	Product representation.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.toRecursive(GenPolynomialRing<GenPolynomial<C>> rfac, GenPolynomial<C> A)	To recursive representation.
static <C extends RingElem<C>> GenSolvablePolynomial<GenPolynomial<C>>	PolyUtil.toRecursive(GenSolvablePolynomialRing<GenPolynomial<C>> rfac, GenSolvablePolynomial<C> A)	To recursive representation.
static <C extends RingElem<C>> long	PolyUtil.totalDegree(List<GenPolynomial<C>> P)	Total degree of polynomial list.
static <C extends RingElem<C>> long	PolyUtil.totalDegreeLeadingTerm(List<GenPolynomial<C>> P)	Maximal degree of leading terms of a polynomial list.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUtil.translationMainRecursive(GenPolynomial<GenPolynomial<C>> A, C h)	Polynomial translation, main variable.
List<GenExteriorPolynomial<C>>	GenExteriorPolynomialRing.valueOf(List<GenPolynomial<C>> A)	Get a list of GenExteriorPolynomials from a list of GenPolynomials.
List<GenWordPolynomial<C>>	GenWordPolynomialRing.valueOf(List<GenPolynomial<C>> A)	Get a list of GenWordPolynomial<C> element from a list of GenPolynomial<C>.
static <C extends RingElem<C>> List<List<GenPolynomial<C>>>	ModuleList.vecToList(List<GenVector<GenPolynomial<C>>> vlist)	Get a list of vectors as List of list of GenPolynomials.

Constructors in edu.jas.poly with parameters of type GenPolynomial

Modifier	Constructor	Description
	AlgebraicNotInvertibleException(GenPolynomial f, GenPolynomial f1, GenPolynomial f2)	Constructor.
	AlgebraicNotInvertibleException(String c, GenPolynomial f, GenPolynomial f1, GenPolynomial f2)	Constructor.
	AlgebraicNotInvertibleException(String c, Throwable t, GenPolynomial f, GenPolynomial f1, GenPolynomial f2)	Constructor.
	AlgebraicNotInvertibleException(Throwable t, GenPolynomial f, GenPolynomial f1, GenPolynomial f2)	Constructor.
	AlgebraicNumber(AlgebraicNumberRing<C> r, GenPolynomial<C> a)	The constructor creates a AlgebraicNumber object from AlgebraicNumberRing modul and a GenPolynomial value.
	AlgebraicNumberRing(GenPolynomial<C> m)	The constructor creates a AlgebraicNumber factory object from a GenPolynomial objects module.
	AlgebraicNumberRing(GenPolynomial<C> m, boolean isField)	The constructor creates a AlgebraicNumber factory object from a GenPolynomial objects module.
	RecSolvablePolynomial(RecSolvablePolynomialRing<C> r, GenPolynomial<C> c)	Constructor for RecSolvablePolynomial.
	RecSolvablePolynomial(RecSolvablePolynomialRing<C> r, GenPolynomial<C> c, ExpVector e)	Constructor for RecSolvablePolynomial.

Constructor parameters in edu.jas.poly with type arguments of type GenPolynomial

Modifier	Constructor	Description
	DistToRec(GenPolynomialRing<GenPolynomial<C>> fac)
	ModuleList(GenPolynomialRing<C> r, List<List<GenPolynomial<C>>> l)	Constructor.
	ModuleList(GenVectorModul<GenPolynomial<C>> r, List<GenVector<GenPolynomial<C>>> l)	Constructor.
	ModuleList(GenVectorModul<GenPolynomial<C>> r, List<GenVector<GenPolynomial<C>>> l)	Constructor.
	OrderedModuleList(GenPolynomialRing<C> r, List<List<GenPolynomial<C>>> l)	Constructor.
	OrderedPolynomialList(GenPolynomialRing<C> r, List<GenPolynomial<C>> l)	Constructor.
	PolynomialList(GenPolynomialRing<C> r, List<GenPolynomial<C>> l)	Constructor.
	RecSolvablePolynomial(RecSolvablePolynomialRing<C> r, GenSolvablePolynomial<GenPolynomial<C>> S)	Constructor for RecSolvablePolynomial.
protected	RecSolvablePolynomial(RecSolvablePolynomialRing<C> r, SortedMap<ExpVector, GenPolynomial<C>> v)	Constructor for RecSolvablePolynomial.
	RecSolvablePolynomialRing(RingFactory<GenPolynomial<C>> cf, int n)	The constructor creates a solvable polynomial factory object with the default term order and commutative relations.
	RecSolvablePolynomialRing(RingFactory<GenPolynomial<C>> cf, int n, RelationTable<GenPolynomial<C>> rt)	The constructor creates a solvable polynomial factory object with the default term order.
	RecSolvablePolynomialRing(RingFactory<GenPolynomial<C>> cf, int n, RelationTable<GenPolynomial<C>> rt)	The constructor creates a solvable polynomial factory object with the default term order.
	RecSolvablePolynomialRing(RingFactory<GenPolynomial<C>> cf, int n, TermOrder t)	The constructor creates a solvable polynomial factory object with the given term order and commutative relations.
	RecSolvablePolynomialRing(RingFactory<GenPolynomial<C>> cf, int n, TermOrder t, RelationTable<GenPolynomial<C>> rt)	The constructor creates a solvable polynomial factory object with the given term order.
	RecSolvablePolynomialRing(RingFactory<GenPolynomial<C>> cf, int n, TermOrder t, RelationTable<GenPolynomial<C>> rt)	The constructor creates a solvable polynomial factory object with the given term order.
	RecSolvablePolynomialRing(RingFactory<GenPolynomial<C>> cf, int n, TermOrder t, String[] v)	The constructor creates a solvable polynomial factory object with the given term order and commutative relations.
	RecSolvablePolynomialRing(RingFactory<GenPolynomial<C>> cf, int n, TermOrder t, String[] v, RelationTable<GenPolynomial<C>> rt)	The constructor creates a solvable polynomial factory object with the given term order.
	RecSolvablePolynomialRing(RingFactory<GenPolynomial<C>> cf, int n, TermOrder t, String[] v, RelationTable<GenPolynomial<C>> rt)	The constructor creates a solvable polynomial factory object with the given term order.
	RecSolvablePolynomialRing(RingFactory<GenPolynomial<C>> cf, RecSolvablePolynomialRing o)	The constructor creates a solvable polynomial factory object with the the same term order, number of variables and variable names as the given polynomial factory, only the coefficient factories differ and the solvable multiplication relations are empty.
	RecSolvablePolynomialRing(RingFactory<GenPolynomial<C>> cf, TermOrder t, String[] v)	The constructor creates a solvable polynomial factory object with the given term order and commutative relations.
	RecSolvablePolynomialRing(RingFactory<GenPolynomial<C>> cf, String[] v)	The constructor creates a solvable polynomial factory object with the default term order.

Uses of GenPolynomial in edu.jas.ps

Fields in edu.jas.ps declared as GenPolynomial

Modifier and Type	Field	Description
(package private) final GenPolynomial<C>	PolynomialTaylorFunction.pol

Fields in edu.jas.ps with type parameters of type GenPolynomial

Modifier and Type	Field	Description
final HashMap<Long, GenPolynomial<C>>	MultiVarCoefficients.coeffCache	Cache for already computed coefficients.

Methods in edu.jas.ps that return GenPolynomial

Modifier and Type	Method	Description
GenPolynomial<C>	MultiVarPowerSeries.asPolynomial()	Get a GenPolynomial<C> from this.
GenPolynomial<C>	UnivPowerSeries.asPolynomial()	Get a GenPolynomial<C> from this.
GenPolynomial<C>	MultiVarCoefficients.getHomPart(long tdeg)	Homogeneous part.
GenPolynomial<C>	MultiVarPowerSeries.homogeneousPart(long tdeg)	Homogeneous part.

Methods in edu.jas.ps with parameters of type GenPolynomial

Modifier and Type	Method	Description
MultiVarPowerSeries<C>	MultiVarPowerSeriesRing.fromPolynomial(GenPolynomial<C> a)	Get a MultiVarPowerSeries<C> from a GenPolynomial<C>.
UnivPowerSeries<C>	UnivPowerSeriesRing.fromPolynomial(GenPolynomial<C> a)	Get a UnivPowerSeries<C> from a GenPolynomial<C>.

Method parameters in edu.jas.ps with type arguments of type GenPolynomial

Modifier and Type	Method	Description
List<MultiVarPowerSeries<C>>	MultiVarPowerSeriesRing.fromPolynomial(List<GenPolynomial<C>> A)	Get a list of MultiVarPowerSeries<C> from a list of GenPolynomial<C>.

Constructors in edu.jas.ps with parameters of type GenPolynomial

Modifier	Constructor	Description
	PolynomialTaylorFunction(GenPolynomial<C> p)
	PolynomialTaylorFunction(GenPolynomial<C> p, long f)

Constructor parameters in edu.jas.ps with type arguments of type GenPolynomial

Modifier	Constructor	Description
	MultiVarCoefficients(GenPolynomialRing<C> pf, HashMap<Long, GenPolynomial<C>> cache)	Public with pre-filled coefficient cache.
	MultiVarCoefficients(GenPolynomialRing<C> pf, HashMap<Long, GenPolynomial<C>> cache, BitSet hc)	Public constructor with pre-filled caches.
	MultiVarCoefficients(GenPolynomialRing<C> pf, HashMap<Long, GenPolynomial<C>> cache, HashSet<ExpVector> zeros)	Public constructor with pre-filled caches.
	MultiVarCoefficients(GenPolynomialRing<C> pf, HashMap<Long, GenPolynomial<C>> cache, HashSet<ExpVector> zeros, BitSet hc)	Public constructor with pre-filled caches.

Uses of GenPolynomial in edu.jas.root

Classes in edu.jas.root that implement interfaces with type arguments of type GenPolynomial

Modifier and Type	Class	Description
(package private) class	PolyToReAlg<C extends GcdRingElem<C> & Rational>	Polynomial to algebraic functor.

Fields in edu.jas.root declared as GenPolynomial

Modifier and Type	Field	Description
final GenPolynomial<Complex<C>>	Boundary.A	Polynomial.
final GenPolynomial<Complex<C>>	AlgebraicRoots.cp	Univariate polynomial with complex coefficients equivalent to p.
final GenPolynomial<Complex<C>>	DecimalRoots.cp	univariate polynomial with complex coefficients.
final GenPolynomial<C>	AlgebraicRoots.p	Univariate polynomial.
final GenPolynomial<C>	DecimalRoots.p	univariate polynomial.
final GenPolynomial<Complex<C>>[]	Boundary.polys	Boundary polynomials.
protected final GenPolynomial<C>	CoeffToReAlg.zero

Methods in edu.jas.root that return GenPolynomial

Modifier and Type	Method	Description
static <C extends GcdRingElem<C> & Rational> GenPolynomial<AlgebraicNumber<C>>	PolyUtilRoot.algebraicFromRealCoefficients(GenPolynomialRing<AlgebraicNumber<C>> afac, GenPolynomial<RealAlgebraicNumber<C>> A)	Convert to AlgebraicNumber coefficients.
static <C extends GcdRingElem<C> & Rational> GenPolynomial<Complex<C>>	PolyUtilRoot.complexFromAny(GenPolynomial<C> f)	Convert to Complex coefficients.
static <C extends GcdRingElem<C> & Rational> GenPolynomial<RealAlgebraicNumber<C>>	PolyUtilRoot.convertRecursiveToAlgebraicCoefficients(GenPolynomialRing<RealAlgebraicNumber<C>> pfac, GenPolynomial<GenPolynomial<C>> A)	Convert to RealAlgebraicNumber coefficients.
static <C extends GcdRingElem<C> & Rational> GenPolynomial<RealAlgebraicNumber<C>>	PolyUtilRoot.convertToAlgebraicCoefficients(GenPolynomialRing<RealAlgebraicNumber<C>> pfac, GenPolynomial<C> A)	Convert to RealAlgebraicNumber coefficients.
static <C extends GcdRingElem<C> & Rational> GenPolynomial<ComplexAlgebraicNumber<C>>	PolyUtilRoot.convertToComplexCoefficients(GenPolynomialRing<ComplexAlgebraicNumber<C>> pfac, GenPolynomial<C> A)	Convert to ComplexAlgebraicNumber coefficients.
static <C extends GcdRingElem<C> & Rational> GenPolynomial<ComplexAlgebraicNumber<C>>	PolyUtilRoot.convertToComplexCoefficientsFromComplex(GenPolynomialRing<ComplexAlgebraicNumber<C>> pfac, GenPolynomial<Complex<C>> A)	Convert to ComplexAlgebraicNumber coefficients.
static <C extends GcdRingElem<C> & Rational> GenPolynomial<RealAlgebraicNumber<C>>	PolyUtilRoot.convertToRealCoefficients(GenPolynomialRing<RealAlgebraicNumber<C>> pfac, GenPolynomial<C> A)	Convert to RealAlgebraicNumber coefficients.
static <C extends GcdRingElem<C> & Rational> GenPolynomial<RealAlgebraicNumber<C>>	PolyUtilRoot.convertToRecAlgebraicCoefficients(int depth, GenPolynomialRing<RealAlgebraicNumber<C>> pfac, GenPolynomial<C> A)	Convert to recursive RealAlgebraicNumber coefficients.
GenPolynomial<C>	Boundary.getImagPart(int i)	Get imaginary part for polynomial i.
GenPolynomial<C>	Boundary.getRealPart(int i)	Get real part for polynomial i.
static <C extends GcdRingElem<C> & Rational> GenPolynomial<RealAlgebraicNumber<C>>	PolyUtilRoot.realFromAlgebraicCoefficients(GenPolynomialRing<RealAlgebraicNumber<C>> rfac, GenPolynomial<AlgebraicNumber<C>> A)	Convert to RealAlgebraicNumber coefficients.

Methods in edu.jas.root that return types with arguments of type GenPolynomial

Modifier and Type	Method	Description
List<GenPolynomial<C>>	RealRootsAbstract.fourierSequence(GenPolynomial<C> f)	Fourier sequence.
List<GenPolynomial<C>>	ComplexRootsSturm.sturmSequence(GenPolynomial<C> f, GenPolynomial<C> g)	Sturm sequence.
List<GenPolynomial<C>>	RealRootsSturm.sturmSequence(GenPolynomial<C> f)	Sturm sequence.

Methods in edu.jas.root with parameters of type GenPolynomial

Modifier and Type	Method	Description
static <C extends GcdRingElem<C> & Rational> GenPolynomial<AlgebraicNumber<C>>	PolyUtilRoot.algebraicFromRealCoefficients(GenPolynomialRing<AlgebraicNumber<C>> afac, GenPolynomial<RealAlgebraicNumber<C>> A)	Convert to AlgebraicNumber coefficients.
static <C extends GcdRingElem<C> & Rational> AlgebraicRoots<C>	RootFactory.algebraicRoots(GenPolynomial<C> f)	Roots as real and complex algebraic numbers.
Complex<BigDecimal>	ComplexRootsAbstract.approximateRoot(Rectangle<C> rt, GenPolynomial<Complex<C>> f, BigRational eps)	Approximate complex root.
BigDecimal	RealRootsAbstract.approximateRoot(Interval<C> iv, GenPolynomial<C> f, BigRational eps)	Approximate real root.
List<Complex<BigDecimal>>	ComplexRootsAbstract.approximateRoots(GenPolynomial<Complex<C>> a, BigRational eps)	List of decimal approximations of complex roots of complex polynomial.
List<BigDecimal>	RealRootsAbstract.approximateRoots(GenPolynomial<C> f, BigRational eps)	Approximate real roots.
C	RealRootsAbstract.bisectionPoint(Interval<C> iv, GenPolynomial<C> f)	Bi-section point.
static <C extends GcdRingElem<C> & Rational> List<ComplexAlgebraicNumber<C>>	RootFactory.complexAlgebraicNumbers(GenPolynomial<C> f)	Complex algebraic numbers.
static <C extends GcdRingElem<C> & Rational> List<ComplexAlgebraicNumber<C>>	RootFactory.complexAlgebraicNumbers(GenPolynomial<C> f, BigRational eps)	Complex algebraic numbers.
static <C extends GcdRingElem<C> & Rational> List<ComplexAlgebraicNumber<C>>	RootFactory.complexAlgebraicNumbersComplex(GenPolynomial<Complex<C>> f)	Complex algebraic numbers.
static <C extends GcdRingElem<C> & Rational> List<ComplexAlgebraicNumber<C>>	RootFactory.complexAlgebraicNumbersComplex(GenPolynomial<Complex<C>> f, BigRational eps)	Complex algebraic numbers.
static <C extends GcdRingElem<C> & Rational> GenPolynomial<Complex<C>>	PolyUtilRoot.complexFromAny(GenPolynomial<C> f)	Convert to Complex coefficients.
Complex<C>	ComplexRootsAbstract.complexMagnitude(Rectangle<C> rect, GenPolynomial<Complex<C>> f, GenPolynomial<Complex<C>> g, BigRational eps)	Complex algebraic number magnitude.
Complex<C>	ComplexRootsAbstract.complexRectangleMagnitude(Rectangle<C> rect, GenPolynomial<Complex<C>> f, GenPolynomial<Complex<C>> g)	Complex algebraic number magnitude.
long	ComplexRoots.complexRootCount(Rectangle<C> rect, GenPolynomial<Complex<C>> a)	Complex root count of complex polynomial on rectangle.
abstract long	ComplexRootsAbstract.complexRootCount(Rectangle<C> rect, GenPolynomial<Complex<C>> a)	Complex root count of complex polynomial on rectangle.
long	ComplexRootsSturm.complexRootCount(Rectangle<C> rect, GenPolynomial<Complex<C>> a)	Complex root count of complex polynomial on rectangle.
Rectangle<C>	ComplexRoots.complexRootRefinement(Rectangle<C> rect, GenPolynomial<Complex<C>> a, BigRational len)	Complex root refinement of complex polynomial a on rectangle.
Rectangle<C>	ComplexRootsAbstract.complexRootRefinement(Rectangle<C> rect, GenPolynomial<Complex<C>> a, BigRational len)	Complex root refinement of complex polynomial a on rectangle.
List<Rectangle<C>>	ComplexRoots.complexRoots(GenPolynomial<Complex<C>> a)	List of complex roots of complex polynomial.
List<Rectangle<C>>	ComplexRoots.complexRoots(Rectangle<C> rect, GenPolynomial<Complex<C>> a)	List of complex roots of complex polynomial a on rectangle.
List<Rectangle<C>>	ComplexRootsAbstract.complexRoots(GenPolynomial<Complex<C>> a)	List of complex roots of complex polynomial.
List<Rectangle<C>>	ComplexRootsAbstract.complexRoots(GenPolynomial<Complex<C>> a, BigRational len)	List of complex roots of complex polynomial.
abstract List<Rectangle<C>>	ComplexRootsAbstract.complexRoots(Rectangle<C> rect, GenPolynomial<Complex<C>> a)	List of complex roots of complex polynomial a on rectangle.
List<Rectangle<C>>	ComplexRootsSturm.complexRoots(Rectangle<C> rect, GenPolynomial<Complex<C>> a)	List of complex roots of complex polynomial a on rectangle.
static <C extends GcdRingElem<C> & Rational> GenPolynomial<RealAlgebraicNumber<C>>	PolyUtilRoot.convertRecursiveToAlgebraicCoefficients(GenPolynomialRing<RealAlgebraicNumber<C>> pfac, GenPolynomial<GenPolynomial<C>> A)	Convert to RealAlgebraicNumber coefficients.
static <C extends GcdRingElem<C> & Rational> GenPolynomial<RealAlgebraicNumber<C>>	PolyUtilRoot.convertToAlgebraicCoefficients(GenPolynomialRing<RealAlgebraicNumber<C>> pfac, GenPolynomial<C> A)	Convert to RealAlgebraicNumber coefficients.
static <C extends GcdRingElem<C> & Rational> GenPolynomial<ComplexAlgebraicNumber<C>>	PolyUtilRoot.convertToComplexCoefficients(GenPolynomialRing<ComplexAlgebraicNumber<C>> pfac, GenPolynomial<C> A)	Convert to ComplexAlgebraicNumber coefficients.
static <C extends GcdRingElem<C> & Rational> GenPolynomial<ComplexAlgebraicNumber<C>>	PolyUtilRoot.convertToComplexCoefficientsFromComplex(GenPolynomialRing<ComplexAlgebraicNumber<C>> pfac, GenPolynomial<Complex<C>> A)	Convert to ComplexAlgebraicNumber coefficients.
static <C extends GcdRingElem<C> & Rational> GenPolynomial<RealAlgebraicNumber<C>>	PolyUtilRoot.convertToRealCoefficients(GenPolynomialRing<RealAlgebraicNumber<C>> pfac, GenPolynomial<C> A)	Convert to RealAlgebraicNumber coefficients.
static <C extends GcdRingElem<C> & Rational> GenPolynomial<RealAlgebraicNumber<C>>	PolyUtilRoot.convertToRecAlgebraicCoefficients(int depth, GenPolynomialRing<RealAlgebraicNumber<C>> pfac, GenPolynomial<C> A)	Convert to recursive RealAlgebraicNumber coefficients.
static <C extends GcdRingElem<C> & Rational> DecimalRoots<C>	RootFactory.decimalRoots(GenPolynomial<C> f, BigRational eps)	Roots as real and complex decimal numbers.
RealAlgebraicNumber<C>	PolyToReAlg.eval(GenPolynomial<C> c)
Rectangle<C>	ComplexRootsSturm.excludeZero(Rectangle<C> rect, GenPolynomial<Complex<C>> f)	Exclude zero.
static <C extends GcdRingElem<C> & Rational> List<Complex<BigDecimal>>	RootFactory.filterOutRealRoots(GenPolynomial<C> f, List<Complex<BigDecimal>> c, List<BigDecimal> r, BigRational eps)	Filter real roots from complex roots.
static <C extends GcdRingElem<C> & Rational> List<ComplexAlgebraicNumber<C>>	RootFactory.filterOutRealRoots(GenPolynomial<C> f, List<ComplexAlgebraicNumber<C>> c, List<RealAlgebraicNumber<C>> r)	Filter real roots from complex roots.
List<GenPolynomial<C>>	RealRootsAbstract.fourierSequence(GenPolynomial<C> f)	Fourier sequence.
Interval<C>	RealRootsAbstract.halfInterval(Interval<C> iv, GenPolynomial<C> f)	Half interval.
long	ComplexRootsSturm.indexOfCauchy(C a, C b, GenPolynomial<C> f, GenPolynomial<C> g)	Cauchy index of rational function f/g on interval.
long[]	ComplexRootsSturm.indexOfRouth(C a, C b, GenPolynomial<C> f, GenPolynomial<C> g)	Routh index of complex function f + i g on interval.
Interval<C>	RealRootsAbstract.invariantMagnitudeInterval(Interval<C> iv, GenPolynomial<C> f, GenPolynomial<C> g, BigRational eps)	Invariant interval for algebraic number magnitude.
Rectangle<C>	ComplexRootsAbstract.invariantMagnitudeRectangle(Rectangle<C> rect, GenPolynomial<Complex<C>> f, GenPolynomial<Complex<C>> g, BigRational eps)	Invariant rectangle for algebraic number magnitude.
abstract Rectangle<C>	ComplexRootsAbstract.invariantRectangle(Rectangle<C> rect, GenPolynomial<Complex<C>> f, GenPolynomial<Complex<C>> g)	Invariant rectangle for algebraic number.
Rectangle<C>	ComplexRootsSturm.invariantRectangle(Rectangle<C> rect, GenPolynomial<Complex<C>> f, GenPolynomial<Complex<C>> g)	Invariant rectangle for algebraic number.
abstract Interval<C>	RealRootsAbstract.invariantSignInterval(Interval<C> iv, GenPolynomial<C> f, GenPolynomial<C> g)	Invariant interval for algebraic number sign.
Interval<C>	RealRootsSturm.invariantSignInterval(Interval<C> iv, GenPolynomial<C> f, GenPolynomial<C> g)	Invariant interval for algebraic number sign.
Interval<C>	RealRootsSturm.invariantSignInterval(Interval<C> iv, GenPolynomial<C> f, List<GenPolynomial<C>> Sg)	Invariant interval for algebraic number sign.
boolean	RealRootsAbstract.isApproximateRoot(BigDecimal x, GenPolynomial<C> f, C eps)	Test if x is an approximate real root.
boolean	RealRootsAbstract.isApproximateRoot(BigDecimal x, GenPolynomial<BigDecimal> f, GenPolynomial<BigDecimal> fp, BigDecimal eps)	Test if x is an approximate real root.
boolean	RealRootsAbstract.isApproximateRoot(List<BigDecimal> R, GenPolynomial<C> f, BigRational eps)	Test if each x in R is an approximate real root.
static <C extends GcdRingElem<C> & Rational> boolean	RootFactory.isRealRoot(GenPolynomial<C> f, Complex<BigDecimal> c, BigDecimal r, BigRational eps)	Is complex decimal number a real root of a polynomial.
static <C extends GcdRingElem<C> & Rational> boolean	RootFactory.isRealRoot(GenPolynomial<C> f, ComplexAlgebraicNumber<C> c, RealAlgebraicNumber<C> r)	Is complex algebraic number a real root of a polynomial.
static <C extends GcdRingElem<C> & Rational> boolean	RootFactory.isRoot(GenPolynomial<C> f, ComplexAlgebraicNumber<C> r)	Is complex algebraic number a root of a polynomial.
static <C extends GcdRingElem<C> & Rational> boolean	RootFactory.isRoot(GenPolynomial<C> f, RealAlgebraicNumber<C> r)	Is real algebraic number a root of a polynomial.
static <C extends GcdRingElem<C> & Rational> boolean	RootFactory.isRootComplex(GenPolynomial<Complex<C>> f, ComplexAlgebraicNumber<C> r)	Is complex algebraic number a root of a complex polynomial.
C	ComplexRootsAbstract.magnitudeBound(Rectangle<C> rect, GenPolynomial<Complex<C>> f)	Magnitude bound.
C	RealRootsAbstract.magnitudeBound(Interval<C> iv, GenPolynomial<C> f)	Magnitude bound.
ComplexAlgebraicNumber<C>	ComplexAlgebraicNumber.multiply(GenPolynomial<Complex<C>> c)	ComplexAlgebraicNumber multiplication.
RealAlgebraicNumber<C>	RealAlgebraicNumber.multiply(GenPolynomial<C> c)	RealAlgebraicNumber multiplication.
static <C extends GcdRingElem<C> & Rational> List<RealAlgebraicNumber<C>>	RootFactory.realAlgebraicNumbers(GenPolynomial<C> f)	Real algebraic numbers.
static <C extends GcdRingElem<C> & Rational> List<RealAlgebraicNumber<C>>	RootFactory.realAlgebraicNumbers(GenPolynomial<C> f, BigRational eps)	Real algebraic numbers.
static <C extends GcdRingElem<C> & Rational> List<RealAlgebraicNumber<C>>	RootFactory.realAlgebraicNumbersField(GenPolynomial<C> f)	Real algebraic numbers from a field.
static <C extends GcdRingElem<C> & Rational> List<RealAlgebraicNumber<C>>	RootFactory.realAlgebraicNumbersField(GenPolynomial<C> f, BigRational eps)	Real algebraic numbers from a field.
static <C extends GcdRingElem<C> & Rational> List<RealAlgebraicNumber<C>>	RootFactory.realAlgebraicNumbersIrred(GenPolynomial<C> f)	Real algebraic numbers from a irreducible polynomial.
static <C extends GcdRingElem<C> & Rational> List<RealAlgebraicNumber<C>>	RootFactory.realAlgebraicNumbersIrred(GenPolynomial<C> f, BigRational eps)	Real algebraic numbers from a irreducible polynomial.
static <C extends GcdRingElem<C> & Rational> GenPolynomial<RealAlgebraicNumber<C>>	PolyUtilRoot.realFromAlgebraicCoefficients(GenPolynomialRing<RealAlgebraicNumber<C>> rfac, GenPolynomial<AlgebraicNumber<C>> A)	Convert to RealAlgebraicNumber coefficients.
C	RealRootsAbstract.realIntervalMagnitude(Interval<C> iv, GenPolynomial<C> f, GenPolynomial<C> g)	Real algebraic number magnitude.
Interval<C>	RealRootsAbstract.realIntervalMagnitudeInterval(Interval<C> iv, GenPolynomial<C> f, GenPolynomial<C> g)	Real algebraic number magnitude.
int	RealRootsAbstract.realIntervalSign(Interval<C> iv, GenPolynomial<C> f, GenPolynomial<C> g)	Real algebraic number sign.
C	RealRoots.realMagnitude(Interval<C> iv, GenPolynomial<C> f, GenPolynomial<C> g, BigRational eps)	Real algebraic number magnitude.
C	RealRootsAbstract.realMagnitude(Interval<C> iv, GenPolynomial<C> f, GenPolynomial<C> g, BigRational eps)	Real algebraic number magnitude.
C	RealRootsAbstract.realMinimalRootBound(GenPolynomial<C> f)	Real minimal root bound.
C	RealRootsAbstract.realMinimalRootSeparation(GenPolynomial<C> f)	Real minimal root separation.
C	RealRoots.realRootBound(GenPolynomial<C> f)	Real root bound.
C	RealRootsAbstract.realRootBound(GenPolynomial<C> f)	Real root bound.
long	RealRoots.realRootCount(Interval<C> iv, GenPolynomial<C> f)	Number of real roots in interval.
abstract long	RealRootsAbstract.realRootCount(Interval<C> iv, GenPolynomial<C> f)	Number of real roots in interval.
long	RealRootsSturm.realRootCount(Interval<C> iv, GenPolynomial<C> f)	Number of real roots in interval.
Long	RealRootsAbstract.realRootNumber(GenPolynomial<C> f, Interval<C> v)	Root number.
List<Interval<C>>	RealRoots.realRoots(GenPolynomial<C> f)	Isolating intervals for the real roots.
List<Interval<C>>	RealRoots.realRoots(GenPolynomial<C> f, C eps)	Isolating intervals for the real roots.
List<Interval<C>>	RealRoots.realRoots(GenPolynomial<C> f, BigRational eps)	Isolating intervals for the real roots.
abstract List<Interval<C>>	RealRootsAbstract.realRoots(GenPolynomial<C> f)	Isolating intervals for the real roots.
List<Interval<C>>	RealRootsAbstract.realRoots(GenPolynomial<C> f, C eps)	Isolating intervals for the real roots.
List<Interval<C>>	RealRootsAbstract.realRoots(GenPolynomial<C> f, BigRational eps)	Isolating intervals for the real roots.
List<Interval<C>>	RealRootsSturm.realRoots(GenPolynomial<C> f)	Isolating intervals for the real roots.
int	RealRoots.realSign(Interval<C> iv, GenPolynomial<C> f, GenPolynomial<C> g)	Real algebraic number sign.
int	RealRootsAbstract.realSign(Interval<C> iv, GenPolynomial<C> f, GenPolynomial<C> g)	Real algebraic number sign.
Interval<C>	RealRoots.refineInterval(Interval<C> iv, GenPolynomial<C> f, BigRational eps)	Refine interval.
Interval<C>	RealRootsAbstract.refineInterval(Interval<C> iv, GenPolynomial<C> f, BigRational eps)	Refine interval.
List<Interval<C>>	RealRoots.refineIntervals(List<Interval<C>> V, GenPolynomial<C> f, BigRational eps)	Refine intervals.
List<Interval<C>>	RealRootsAbstract.refineIntervals(List<Interval<C>> V, GenPolynomial<C> f, BigRational eps)	Refine intervals.
Complex<C>	ComplexRoots.rootBound(GenPolynomial<Complex<C>> f)	Root bound.
Complex<C>	ComplexRootsAbstract.rootBound(GenPolynomial<Complex<C>> f)	Root bound.
boolean	RealRoots.signChange(Interval<C> iv, GenPolynomial<C> f)	Sign changes on interval bounds.
boolean	RealRootsAbstract.signChange(Interval<C> iv, GenPolynomial<C> f)	Sign changes on interval bounds.
List<Integer>	RealRootsAbstract.signSequence(GenPolynomial<C> f, Interval<C> v)	Thom sign sequence.
List<GenPolynomial<C>>	ComplexRootsSturm.sturmSequence(GenPolynomial<C> f, GenPolynomial<C> g)	Sturm sequence.
List<GenPolynomial<C>>	RealRootsSturm.sturmSequence(GenPolynomial<C> f)	Sturm sequence.
ComplexAlgebraicNumber<C>	ComplexAlgebraicNumber.sum(GenPolynomial<Complex<C>> c)	ComplexAlgebraicNumber summation.
RealAlgebraicNumber<C>	RealAlgebraicNumber.sum(GenPolynomial<C> c)	RealAlgebraicNumber summation.
long	ComplexRootsSturm.windingNumber(Rectangle<C> rect, GenPolynomial<Complex<C>> A)	Winding number of complex function A on rectangle.

Method parameters in edu.jas.root with type arguments of type GenPolynomial

Modifier and Type	Method	Description
static <C extends GcdRingElem<C> & Rational> GenPolynomial<RealAlgebraicNumber<C>>	PolyUtilRoot.convertRecursiveToAlgebraicCoefficients(GenPolynomialRing<RealAlgebraicNumber<C>> pfac, GenPolynomial<GenPolynomial<C>> A)	Convert to RealAlgebraicNumber coefficients.
Interval<C>	RealRootsSturm.excludeZero(Interval<C> iv, List<GenPolynomial<C>> S)	Exclude zero v2.
Interval<C>	RealRootsSturm.excludeZeroOld(Interval<C> iv, List<GenPolynomial<C>> S)	Exclude zero, old version.
Interval<C>	RealRootsSturm.invariantSignInterval(Interval<C> iv, GenPolynomial<C> f, List<GenPolynomial<C>> Sg)	Invariant interval for algebraic number sign.
long	RealRootsSturm.realRootCount(Interval<C> iv, List<GenPolynomial<C>> S)	Number of real roots in interval.
List<Interval<C>>	RealRootsSturm.realRoots(Interval<C> iv, List<GenPolynomial<C>> S)	Isolating intervals for the real roots.

Constructors in edu.jas.root with parameters of type GenPolynomial

Modifier	Constructor	Description
	AlgebraicRoots(GenPolynomial<C> p, GenPolynomial<Complex<C>> cp, List<RealAlgebraicNumber<C>> r, List<ComplexAlgebraicNumber<C>> c)	Constructor.
	Boundary(Rectangle<C> r, GenPolynomial<Complex<C>> p)	Constructor.
protected	Boundary(Rectangle<C> r, GenPolynomial<Complex<C>> p, GenPolynomial<Complex<C>>[] b)	Constructor.
	ComplexAlgebraicNumber(ComplexAlgebraicRing<C> r, GenPolynomial<Complex<C>> a)	The constructor creates a ComplexAlgebraicNumber object from ComplexAlgebraicRing modul and a GenPolynomial value.
	ComplexAlgebraicRing(GenPolynomial<Complex<C>> m, Rectangle<C> root)	The constructor creates a ComplexAlgebraicNumber factory object from a GenPolynomial objects module.
	ComplexAlgebraicRing(GenPolynomial<Complex<C>> m, Rectangle<C> root, boolean isField)	The constructor creates a ComplexAlgebraicNumber factory object from a GenPolynomial objects module.
	DecimalRoots(GenPolynomial<C> p, GenPolynomial<Complex<C>> cp, List<BigDecimal> r, List<Complex<BigDecimal>> c)	Constructor.
	RealAlgebraicNumber(RealAlgebraicRing<C> r, GenPolynomial<C> a)	The constructor creates a RealAlgebraicNumber object from RealAlgebraicRing modul and a GenPolynomial value.
	RealAlgebraicRing(GenPolynomial<C> m, Interval<C> root)	The constructor creates a RealAlgebraicNumber factory object from a GenPolynomial objects module.
	RealAlgebraicRing(GenPolynomial<C> m, Interval<C> root, boolean isField)	The constructor creates a RealAlgebraicNumber factory object from a GenPolynomial objects module.

Uses of GenPolynomial in edu.jas.ufd

Classes in edu.jas.ufd with type parameters of type GenPolynomial

Modifier and Type	Class	Description
class	FactorFraction<C extends GcdRingElem<C>, D extends GcdRingElem<D> & QuotPair<GenPolynomial<C>>>	Fraction factorization algorithms.

Classes in edu.jas.ufd that implement interfaces with type arguments of type GenPolynomial

Modifier and Type	Class	Description
(package private) class	BackSubstKronecker<C extends GcdRingElem<C>>	Kronecker back substitutuion functor.
(package private) class	BackSubstKronecker<C extends GcdRingElem<C>>	Kronecker back substitutuion functor.
class	Quotient<C extends GcdRingElem<C>>	Quotient, that is a rational function, based on GenPolynomial with RingElem interface.
class	QuotientRing<C extends GcdRingElem<C>>	Quotient ring factory based on GenPolynomial with RingElem interface.
(package private) class	SubstKronecker<C extends GcdRingElem<C>>	Kronecker substitutuion functor.
(package private) class	SubstKronecker<C extends GcdRingElem<C>>	Kronecker substitutuion functor.

Fields in edu.jas.ufd declared as GenPolynomial

Modifier and Type	Field	Description
final GenPolynomial<BigInteger>	HenselApprox.A	Approximated polynomial with integer coefficients.
final GenPolynomial<MOD>	HenselApprox.Am	Modular approximated polynomial with modular coefficients.
final GenPolynomial<AlgebraicNumber<C>>	Factors.apoly	Original polynomial to be factored with coefficients from AlgebraicNumberRing<C>.
final GenPolynomial<BigInteger>	HenselApprox.B	Approximated polynomial with integer coefficients.
final GenPolynomial<MOD>	HenselApprox.Bm	Modular approximated polynomial with modular coefficients.
final GenPolynomial<C>	PartialFraction.den	Original (irreducible) denominator polynomial coefficients from C.
final GenPolynomial<C>	Quotient.den	Denominator part of the element data structure.
final GenPolynomial<C>	PartialFraction.num	Original numerator polynomial coefficients from C and deg(num) < deg(den).
final GenPolynomial<C>	Quotient.num	Numerator part of the element data structure.
final GenPolynomial<C>	EvalPoints.poly	Original multivariate polynomial to be evaluated.
final GenPolynomial<C>	Factors.poly	Original (irreducible) polynomial to be factored with coefficients from C.
final GenPolynomial<C>	FactorsList.poly	Original polynomial to be factored with coefficients from C.
final GenPolynomial<C>	FactorsMap.poly	Original polynomial to be factored with coefficients from C.
final GenPolynomial<BigInteger>	TrialParts.univPoly	univariate polynomial
final GenPolynomial<C>	EvalPoints.upoly	Evaluated univariate polynomial as evaluated.

Fields in edu.jas.ufd with type parameters of type GenPolynomial

Modifier and Type	Field	Description
final List<GenPolynomial<AlgebraicNumber<C>>>	PartialFraction.adenom	List of factors of the denominator with coefficients from an AlgebraicNumberRing<C>.
final List<GenPolynomial<AlgebraicNumber<C>>>	Factors.afactors	List of factors with coefficients from AlgebraicNumberRing<C>.
final List<GenPolynomial<C>>	PartialFraction.cdenom	List of linear factors of the denominator with coefficients from C.
final List<GenPolynomial<C>>	FactorsList.factors	List of factors with coefficients from C.
final SortedMap<GenPolynomial<C>, Long>	FactorsMap.factors	List of factors with coefficients from C.
final List<GenPolynomial<BigInteger>>	TrialParts.ldcfFactors	irreducible factors of leading coefficient
protected final QuotPairFactory<GenPolynomial<C>, D>	FactorFraction.qfac	Quotient pairs ring factory.
final List<GenPolynomial<BigInteger>>	TrialParts.univFactors	irreducible factors of univariate polynomial

Methods in edu.jas.ufd that return GenPolynomial

Modifier and Type	Method	Description
static <C extends GcdRingElem<C>> GenPolynomial<C>[]	PolyUfdUtil.agcd(GenPolynomial<C> R, GenPolynomial<C> S, int n)	GenPolynomial approximate common divisor.
static <C extends GcdRingElem<C>> GenPolynomial<C>	PolyUfdUtil.backSubstituteKronecker(GenPolynomialRing<C> fac, GenPolynomial<C> A, long d)	Kronecker back substitution.
GenPolynomial<C>	GreatestCommonDivisorSubres.baseDiscriminant(GenPolynomial<C> P)	GenPolynomial base coefficient discriminant.
GenPolynomial<C>[]	GreatestCommonDivisorAbstract.baseExtendedGcd(GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial extended greatest common divisor.
GenPolynomial<C>	GCDProxy.baseGcd(GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial greatest common divisor.
abstract GenPolynomial<C>	GreatestCommonDivisorAbstract.baseGcd(GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial greatest common divisor.
GenPolynomial<C>	GreatestCommonDivisorFake.baseGcd(GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial greatest common divisor.
GenPolynomial<BigInteger>	GreatestCommonDivisorHensel.baseGcd(GenPolynomial<BigInteger> P, GenPolynomial<BigInteger> S)	Univariate GenPolynomial greatest common divisor.
GenPolynomial<MOD>	GreatestCommonDivisorModEval.baseGcd(GenPolynomial<MOD> P, GenPolynomial<MOD> S)	Univariate GenPolynomial greatest common divisor.
GenPolynomial<BigInteger>	GreatestCommonDivisorModular.baseGcd(GenPolynomial<BigInteger> P, GenPolynomial<BigInteger> S)	Univariate GenPolynomial greatest common divisor.
GenPolynomial<C>	GreatestCommonDivisorPrimitive.baseGcd(GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial greatest common divisor.
GenPolynomial<C>	GreatestCommonDivisorSimple.baseGcd(GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial greatest common divisor.
GenPolynomial<C>	GreatestCommonDivisorSubres.baseGcd(GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial greatest common divisor.
GenPolynomial<C>[]	GreatestCommonDivisorAbstract.baseGcdDiophant(GenPolynomial<C> P, GenPolynomial<C> S, GenPolynomial<C> c)	Univariate GenPolynomial greatest common divisor diophantine version.
GenPolynomial<C>[]	GreatestCommonDivisorAbstract.baseHalfExtendedGcd(GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial half extended greatest common divisor.
GenPolynomial<C>[]	GreatestCommonDivisorAbstract.basePartialFraction(GenPolynomial<C> A, GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial partial fraction decomposition.
GenPolynomial<C>	GreatestCommonDivisorAbstract.basePartialFractionValue(GenPolynomial<C> P, int e, List<GenPolynomial<C>> F)	Test for Univariate GenPolynomial partial fraction decomposition.
GenPolynomial<C>	FactorAbstract.basePrimitivePart(GenPolynomial<C> P)	GenPolynomial base primitive part.
GenPolynomial<C>	GreatestCommonDivisorAbstract.basePrimitivePart(GenPolynomial<C> P)	GenPolynomial base coefficient primitive part.
GenPolynomial<C>	GreatestCommonDivisorFake.basePrimitivePart(GenPolynomial<C> P)	GenPolynomial base coefficient primitive part.
GenPolynomial<C>	GreatestCommonDivisorSubres.basePseudoRemainder(GenPolynomial<C> P, GenPolynomial<C> S)	Deprecated. (forRemoval=true) Use PolyUtil.baseDensePseudoRemainder(edu.jas.poly.GenPolynomial,edu.jas.poly.GenPolynomial) instead
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.baseRecursivePrimitivePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial base recursive primitive part.
GenPolynomial<C>	GCDProxy.baseResultant(GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial resultant.
GenPolynomial<C>	GreatestCommonDivisorAbstract.baseResultant(GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial resultant.
GenPolynomial<MOD>	GreatestCommonDivisorModEval.baseResultant(GenPolynomial<MOD> P, GenPolynomial<MOD> S)	Univariate GenPolynomial resultant.
GenPolynomial<BigInteger>	GreatestCommonDivisorModular.baseResultant(GenPolynomial<BigInteger> P, GenPolynomial<BigInteger> S)	Univariate GenPolynomial resultant.
GenPolynomial<C>	GreatestCommonDivisorSimple.baseResultant(GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial resultant.
GenPolynomial<C>	GreatestCommonDivisorSubres.baseResultant(GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial resultant.
abstract GenPolynomial<C>	SquarefreeFieldCharP.baseRootCharacteristic(GenPolynomial<C> P)	GenPolynomial char-th root univariate polynomial.
GenPolynomial<C>	SquarefreeFiniteFieldCharP.baseRootCharacteristic(GenPolynomial<C> P)	GenPolynomial char-th root univariate polynomial.
GenPolynomial<AlgebraicNumber<C>>	SquarefreeInfiniteAlgebraicFieldCharP.baseRootCharacteristic(GenPolynomial<AlgebraicNumber<C>> P)	GenPolynomial char-th root univariate polynomial.
GenPolynomial<Quotient<C>>	SquarefreeInfiniteFieldCharP.baseRootCharacteristic(GenPolynomial<Quotient<C>> P)	GenPolynomial char-th root univariate polynomial.
abstract GenPolynomial<C>	SquarefreeAbstract.baseSquarefreePart(GenPolynomial<C> P)	GenPolynomial polynomial greatest squarefree divisor.
GenPolynomial<C>	SquarefreeFieldChar0.baseSquarefreePart(GenPolynomial<C> P)	GenPolynomial polynomial greatest squarefree divisor.
GenPolynomial<C>	SquarefreeFieldCharP.baseSquarefreePart(GenPolynomial<C> P)	GenPolynomial polynomial greatest squarefree divisor.
GenPolynomial<C>	SquarefreeRingChar0.baseSquarefreePart(GenPolynomial<C> P)	GenPolynomial polynomial greatest squarefree divisor.
GenPolynomial<C>	GreatestCommonDivisor.content(GenPolynomial<C> P)	GenPolynomial content.
GenPolynomial<C>	GreatestCommonDivisorAbstract.content(GenPolynomial<C> P)	GenPolynomial content.
GenPolynomial<C>[]	GreatestCommonDivisorAbstract.contentPrimitivePart(GenPolynomial<C> P)	GenPolynomial content and primitive part.
static GenPolynomial<BigInteger>	CycloUtil.cyclotomicPolynomial(GenPolynomialRing<BigInteger> ring, long n)	Compute n-th cyclotomic polynomial.
GenPolynomial<C>	Quotient.denominator()	Denominator.
GenPolynomial<C>	GreatestCommonDivisorAbstract.divide(GenPolynomial<C> a, C b)	GenPolynomial division.
protected GenPolynomial<C>	QuotientRing.divide(GenPolynomial<C> n, GenPolynomial<C> d)	Divide.
GenPolynomial<C>	BackSubstKronecker.eval(GenPolynomial<C> c)
GenPolynomial<C>	SubstKronecker.eval(GenPolynomial<C> c)
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUfdUtil.fromIntegerCoefficients(GenPolynomialRing<GenPolynomial<C>> fac, GenPolynomial<GenPolynomial<BigInteger>> A)	From BigInteger coefficients.
GenPolynomial<C>	GCDProxy.gcd(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial greatest common divisor.
GenPolynomial<C>	GreatestCommonDivisor.gcd(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial greatest common divisor.
GenPolynomial<C>	GreatestCommonDivisorAbstract.gcd(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial greatest common divisor.
GenPolynomial<C>	GreatestCommonDivisorAbstract.gcd(List<GenPolynomial<C>> A)	List of GenPolynomials greatest common divisor.
GenPolynomial<MOD>	GreatestCommonDivisorModEval.gcd(GenPolynomial<MOD> P, GenPolynomial<MOD> S)	GenPolynomial greatest common divisor, modular evaluation algorithm.
GenPolynomial<BigInteger>	GreatestCommonDivisorModular.gcd(GenPolynomial<BigInteger> P, GenPolynomial<BigInteger> S)	GenPolynomial greatest common divisor, modular algorithm.
protected GenPolynomial<C>	QuotientRing.gcd(GenPolynomial<C> n, GenPolynomial<C> d)	Greatest common divisor.
static GenPolynomial<GenPolynomial<BigInteger>>	PolyUfdUtil.integerFromRationalCoefficients(GenPolynomialRing<GenPolynomial<BigInteger>> fac, GenPolynomial<GenPolynomial<BigRational>> A)	BigInteger from BigRational coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUfdUtil.integralFromQuotientCoefficients(GenPolynomialRing<GenPolynomial<C>> fac, GenPolynomial<Quotient<C>> A)	Integral polynomial from rational function coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUfdUtil.introduceLowerVariable(GenPolynomialRing<GenPolynomial<C>> rfac, GenPolynomial<C> A)	Introduce lower variable.
GenPolynomial<C>	GreatestCommonDivisor.lcm(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial least common multiple.
GenPolynomial<C>	GreatestCommonDivisorAbstract.lcm(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial least common multiple.
static <MOD extends GcdRingElem<MOD> & Modular> GenPolynomial<MOD>[]	HenselUtil.liftExtendedEuclidean(GenPolynomial<MOD> A, GenPolynomial<MOD> B, long k)	Constructing and lifting algorithm for extended Euclidean relation.
static <C extends GcdRingElem<C>> GenPolynomial<C>	PolyUfdUtil.norm(GenPolynomial<AlgebraicNumber<C>> A)	Norm of a polynomial with AlgebraicNumber coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<C>	PolyUfdUtil.norm(GenPolynomial<AlgebraicNumber<C>> A, long k)	Norm of a polynomial with AlgebraicNumber coefficients.
GenPolynomial<C>	Quotient.numerator()	Numerator.
GenPolynomial<C>	FactorAbstract.primitivePart(GenPolynomial<C> P)	GenPolynomial primitive part.
GenPolynomial<C>	GreatestCommonDivisor.primitivePart(GenPolynomial<C> P)	GenPolynomial primitive part.
GenPolynomial<C>	GreatestCommonDivisorAbstract.primitivePart(GenPolynomial<C> P)	GenPolynomial primitive part.
static <C extends GcdRingElem<C>> GenPolynomial<Quotient<C>>	PolyUfdUtil.quotientFromIntegralCoefficients(GenPolynomialRing<Quotient<C>> fac, GenPolynomial<GenPolynomial<C>> A)	Rational function from integral polynomial coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<C>	PolyUfdUtil.randomIrreduciblePolynomial(GenPolynomialRing<C> ring, int degree)	Construct a random irreducible univariate polynomial of degree d.
static <C extends GcdRingElem<C>> GenPolynomial<C>	PolyUfdUtil.randomIrreduciblePolynomial(RingFactory<C> cfac, int degree)	Construct a random irreducible univariate polynomial of degree d.
GenPolynomial<C>	GreatestCommonDivisorAbstract.recursiveContent(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive content.
GenPolynomial<C>	GreatestCommonDivisorFake.recursiveContent(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive content.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.recursiveGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.recursivePrimitivePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive primitive part.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorFake.recursivePrimitivePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive primitive part.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorSubres.recursivePseudoRemainder(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Deprecated. (forRemoval=true) Use PolyUtil.recursiveDensePseudoRemainder(edu.jas.poly.GenPolynomial,edu.jas.poly.GenPolynomial) instead
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.recursiveResultant(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	GenPolynomial recursive resultant.
GenPolynomial<GenPolynomial<C>>	SquarefreeAbstract.recursiveSquarefreePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive polynomial greatest squarefree divisor.
GenPolynomial<GenPolynomial<C>>	GCDProxy.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive greatest common divisor.
abstract GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorFake.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<BigInteger>>	GreatestCommonDivisorHensel.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<BigInteger>> P, GenPolynomial<GenPolynomial<BigInteger>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<MOD>>	GreatestCommonDivisorModEval.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<MOD>> P, GenPolynomial<GenPolynomial<MOD>> S)	Recursive univariate GenPolynomial greatest common divisor.
GenPolynomial<GenPolynomial<BigInteger>>	GreatestCommonDivisorModular.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<BigInteger>> P, GenPolynomial<GenPolynomial<BigInteger>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorPrimitive.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorSimple.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorSubres.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<C>>	GCDProxy.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial resultant.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive resultant.
GenPolynomial<GenPolynomial<MOD>>	GreatestCommonDivisorModEval.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<MOD>> P, GenPolynomial<GenPolynomial<MOD>> S)	Univariate GenPolynomial recursive resultant.
GenPolynomial<GenPolynomial<BigInteger>>	GreatestCommonDivisorModular.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<BigInteger>> P, GenPolynomial<GenPolynomial<BigInteger>> S)	Univariate GenPolynomial recursive resultant.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorSimple.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive resultant.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorSubres.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive resultant.
abstract GenPolynomial<GenPolynomial<C>>	SquarefreeFieldCharP.recursiveUnivariateRootCharacteristic(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial char-th root univariate polynomial with polynomial coefficients.
GenPolynomial<GenPolynomial<C>>	SquarefreeFiniteFieldCharP.recursiveUnivariateRootCharacteristic(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial char-th root univariate polynomial with polynomial coefficients.
GenPolynomial<GenPolynomial<AlgebraicNumber<C>>>	SquarefreeInfiniteAlgebraicFieldCharP.recursiveUnivariateRootCharacteristic(GenPolynomial<GenPolynomial<AlgebraicNumber<C>>> P)	GenPolynomial char-th root univariate polynomial with polynomial coefficients.
GenPolynomial<GenPolynomial<Quotient<C>>>	SquarefreeInfiniteFieldCharP.recursiveUnivariateRootCharacteristic(GenPolynomial<GenPolynomial<Quotient<C>>> P)	GenPolynomial char-th root univariate polynomial with polynomial coefficients.
abstract GenPolynomial<GenPolynomial<C>>	SquarefreeAbstract.recursiveUnivariateSquarefreePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive polynomial greatest squarefree divisor.
GenPolynomial<GenPolynomial<C>>	SquarefreeFieldChar0.recursiveUnivariateSquarefreePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial greatest squarefree divisor.
GenPolynomial<GenPolynomial<C>>	SquarefreeFieldCharP.recursiveUnivariateSquarefreePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial greatest squarefree divisor.
GenPolynomial<GenPolynomial<C>>	SquarefreeRingChar0.recursiveUnivariateSquarefreePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial greatest squarefree divisor.
GenPolynomial<C>	GCDProxy.resultant(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial resultant.
GenPolynomial<C>	GreatestCommonDivisor.resultant(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial resultant.
GenPolynomial<C>	GreatestCommonDivisorAbstract.resultant(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial resultant.
GenPolynomial<MOD>	GreatestCommonDivisorModEval.resultant(GenPolynomial<MOD> P, GenPolynomial<MOD> S)	GenPolynomial resultant, modular evaluation algorithm.
GenPolynomial<BigInteger>	GreatestCommonDivisorModular.resultant(GenPolynomial<BigInteger> P, GenPolynomial<BigInteger> S)	GenPolynomial resultant, modular algorithm.
GenPolynomial<AlgebraicNumber<C>>	SquarefreeInfiniteAlgebraicFieldCharP.rootCharacteristic(GenPolynomial<AlgebraicNumber<C>> P)	GenPolynomial char-th root main variable.
GenPolynomial<Quotient<C>>	SquarefreeInfiniteFieldCharP.rootCharacteristic(GenPolynomial<Quotient<C>> P)	GenPolynomial char-th root main variable.
GenPolynomial<C>	FactorAbstract.squarefreePart(GenPolynomial<C> P)	GenPolynomial greatest squarefree divisor.
GenPolynomial<C>	Factorization.squarefreePart(GenPolynomial<C> P)	GenPolynomial greatest squarefree divisor.
GenPolynomial<C>	Squarefree.squarefreePart(GenPolynomial<C> P)	GenPolynomial greatest squarefree divisor.
abstract GenPolynomial<C>	SquarefreeAbstract.squarefreePart(GenPolynomial<C> P)	GenPolynomial greatest squarefree divisor.
GenPolynomial<C>	SquarefreeFieldChar0.squarefreePart(GenPolynomial<C> P)	GenPolynomial greatest squarefree divisor.
GenPolynomial<C>	SquarefreeFieldCharP.squarefreePart(GenPolynomial<C> P)	GenPolynomial greatest squarefree divisor.
GenPolynomial<C>	SquarefreeRingChar0.squarefreePart(GenPolynomial<C> P)	GenPolynomial greatest squarefree divisor.
static <C extends GcdRingElem<C>> GenPolynomial<AlgebraicNumber<C>>	PolyUfdUtil.substituteConvertToAlgebraicCoefficients(GenPolynomialRing<AlgebraicNumber<C>> pfac, GenPolynomial<C> A, long k)	Convert to AlgebraicNumber coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUfdUtil.substituteFromAlgebraicCoefficients(GenPolynomialRing<GenPolynomial<C>> rfac, GenPolynomial<AlgebraicNumber<C>> A, long k)	From AlgebraicNumber coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<C>	PolyUfdUtil.substituteKronecker(GenPolynomial<C> A)	Kronecker substitution.
static <C extends GcdRingElem<C>> GenPolynomial<C>	PolyUfdUtil.substituteKronecker(GenPolynomial<C> A, long d)	Kronecker substitution.

Methods in edu.jas.ufd that return types with arguments of type GenPolynomial

Modifier and Type	Method	Description
static <C extends GcdRingElem<C>> List<GenPolynomial<C>>	PolyUfdUtil.backSubstituteKronecker(GenPolynomialRing<C> fac, List<GenPolynomial<C>> A, long d)	Kronecker back substitution.
SortedMap<Long, GenPolynomial<MOD>>	FactorModular.baseDistinctDegreeFactors(GenPolynomial<MOD> P)	GenPolynomial base distinct degree factorization.
List<GenPolynomial<MOD>>	FactorModular.baseEqualDegreeFactors(GenPolynomial<MOD> P, long deg)	GenPolynomial base equal degree factorization.
SortedMap<GenPolynomial<C>, Long>	FactorAbstract.baseFactors(GenPolynomial<C> P)	Univariate GenPolynomial factorization.
List<GenPolynomial<C>>	FactorAbstract.baseFactorsRadical(GenPolynomial<C> P)	Univariate GenPolynomial factorization ignoring multiplicities.
abstract List<GenPolynomial<C>>	FactorAbstract.baseFactorsSquarefree(GenPolynomial<C> P)	Univariate GenPolynomial factorization of a squarefree polynomial.
List<GenPolynomial<AlgebraicNumber<C>>>	FactorAlgebraic.baseFactorsSquarefree(GenPolynomial<AlgebraicNumber<C>> P)	GenPolynomial base factorization of a squarefree polynomial.
List<GenPolynomial<Complex<C>>>	FactorComplex.baseFactorsSquarefree(GenPolynomial<Complex<C>> P)	GenPolynomial base factorization of a squarefree polynomial.
List<GenPolynomial<BigInteger>>	FactorInteger.baseFactorsSquarefree(GenPolynomial<BigInteger> P)	GenPolynomial base factorization of a squarefree polynomial.
List<GenPolynomial<MOD>>	FactorModular.baseFactorsSquarefree(GenPolynomial<MOD> P)	GenPolynomial base factorization of a squarefree polynomial.
List<GenPolynomial<MOD>>	FactorModularBerlekamp.baseFactorsSquarefree(GenPolynomial<MOD> P)	GenPolynomial base factorization of a squarefree polynomial.
List<GenPolynomial<Quotient<C>>>	FactorQuotient.baseFactorsSquarefree(GenPolynomial<Quotient<C>> P)	GenPolynomial base factorization of a squarefree polynomial.
List<GenPolynomial<BigRational>>	FactorRational.baseFactorsSquarefree(GenPolynomial<BigRational> P)	GenPolynomial base factorization of a squarefree polynomial.
List<GenPolynomial<MOD>>	FactorModularBerlekamp.baseFactorsSquarefreeBigPrime(GenPolynomial<MOD> P)	GenPolynomial base factorization of a squarefree polynomial.
List<GenPolynomial<MOD>>	FactorModularBerlekamp.baseFactorsSquarefreeSmallPrime(GenPolynomial<MOD> P)	GenPolynomial base factorization of a squarefree polynomial.
List<GenPolynomial<C>>	GreatestCommonDivisorAbstract.basePartialFraction(GenPolynomial<C> A, GenPolynomial<C> P, int e)	Univariate GenPolynomial partial fraction decomposition.
List<GenPolynomial<C>>	GreatestCommonDivisorAbstract.basePartialFraction(GenPolynomial<C> A, List<GenPolynomial<C>> D)	Univariate GenPolynomial partial fraction decomposition.
List<List<GenPolynomial<C>>>	SquarefreeAbstract.basePartialFraction(GenPolynomial<C> A, SortedMap<GenPolynomial<C>, Long> D)	Univariate GenPolynomial partial fraction decomposition.
List<GenPolynomial<C>>	GreatestCommonDivisorAbstract.basePrimitivePart(List<GenPolynomial<C>> F)	List of GenPolynomial base coefficient primitive part.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.baseRecursivePrimitivePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial base recursive primitive part.
abstract SortedMap<GenPolynomial<C>, Long>	SquarefreeAbstract.baseSquarefreeFactors(GenPolynomial<C> A)	GenPolynomial polynomial squarefree factorization.
SortedMap<GenPolynomial<C>, Long>	SquarefreeFieldChar0.baseSquarefreeFactors(GenPolynomial<C> A)	GenPolynomial polynomial squarefree factorization.
SortedMap<GenPolynomial<C>, Long>	SquarefreeFieldChar0Yun.baseSquarefreeFactors(GenPolynomial<C> A)	GenPolynomial polynomial squarefree factorization.
SortedMap<GenPolynomial<C>, Long>	SquarefreeFieldCharP.baseSquarefreeFactors(GenPolynomial<C> A)	GenPolynomial polynomial squarefree factorization.
SortedMap<GenPolynomial<C>, Long>	SquarefreeRingChar0.baseSquarefreeFactors(GenPolynomial<C> A)	GenPolynomial polynomial squarefree factorization.
List<GenPolynomial<C>>	GreatestCommonDivisor.coPrime(List<GenPolynomial<C>> A)	GenPolynomial co-prime list.
List<GenPolynomial<C>>	GreatestCommonDivisorAbstract.coPrime(GenPolynomial<C> a, List<GenPolynomial<C>> P)	GenPolynomial co-prime list.
List<GenPolynomial<C>>	GreatestCommonDivisorAbstract.coPrime(List<GenPolynomial<C>> A)	GenPolynomial co-prime list.
List<GenPolynomial<C>>	GreatestCommonDivisorAbstract.coPrimeRec(List<GenPolynomial<C>> A)	GenPolynomial co-prime list.
List<GenPolynomial<C>>	Squarefree.coPrimeSquarefree(GenPolynomial<C> a, List<GenPolynomial<C>> P)	GenPolynomial squarefree and co-prime list.
List<GenPolynomial<C>>	Squarefree.coPrimeSquarefree(List<GenPolynomial<C>> A)	GenPolynomial squarefree and co-prime list.
List<GenPolynomial<C>>	SquarefreeAbstract.coPrimeSquarefree(GenPolynomial<C> a, List<GenPolynomial<C>> P)	GenPolynomial squarefree and co-prime list.
List<GenPolynomial<C>>	SquarefreeAbstract.coPrimeSquarefree(List<GenPolynomial<C>> A)	GenPolynomial squarefree and co-prime list.
static List<GenPolynomial<BigInteger>>	CycloUtil.cyclotomicDecompose(GenPolynomialRing<BigInteger> ring, long n)	Compute the factors of the n-th cyclotomic polynomial.
static List<GenPolynomial<BigInteger>>	CycloUtil.cyclotomicFactors(GenPolynomial<BigInteger> p)	Compute the factors of the cyclotomic polynomial.
SortedMap<GenPolynomial<C>, Long>	FactorAbstract.factors(GenPolynomial<C> P)	GenPolynomial factorization.
SortedMap<GenPolynomial<C>, Long>	Factorization.factors(GenPolynomial<C> P)	GenPolynomial factorization.
SortedMap<GenPolynomial<BigRational>, Long>	FactorRational.factors(GenPolynomial<BigRational> P)	GenPolynomial factorization of a polynomial.
List<GenPolynomial<C>>	FactorAbstract.factorsRadical(GenPolynomial<C> P)	GenPolynomial factorization ignoring multiplicities.
List<GenPolynomial<C>>	FactorAbstract.factorsRadical(List<GenPolynomial<C>> L)	GenPolynomial list factorization ignoring multiplicities.
List<GenPolynomial<C>>	Factorization.factorsRadical(GenPolynomial<C> P)	GenPolynomial factorization ignoring multiplicities.
List<GenPolynomial<C>>	FactorAbstract.factorsSquarefree(GenPolynomial<C> P)	GenPolynomial factorization of a squarefree polynomial, using Kronecker substitution.
List<GenPolynomial<AlgebraicNumber<C>>>	FactorAlgebraic.factorsSquarefree(GenPolynomial<AlgebraicNumber<C>> P)	GenPolynomial factorization of a squarefree polynomial.
List<GenPolynomial<Complex<C>>>	FactorComplex.factorsSquarefree(GenPolynomial<Complex<C>> P)	GenPolynomial factorization of a squarefree polynomial.
List<GenPolynomial<BigInteger>>	FactorInteger.factorsSquarefree(GenPolynomial<BigInteger> P)	GenPolynomial factorization of a multivariate squarefree polynomial, using Hensel lifting if possible.
List<GenPolynomial<C>>	Factorization.factorsSquarefree(GenPolynomial<C> P)	GenPolynomial factorization of a squarefree polynomial.
List<GenPolynomial<Quotient<C>>>	FactorQuotient.factorsSquarefree(GenPolynomial<Quotient<C>> P)	GenPolynomial factorization of a squarefree polynomial.
List<GenPolynomial<BigRational>>	FactorRational.factorsSquarefree(GenPolynomial<BigRational> P)	GenPolynomial factorization of a squarefree polynomial.
List<GenPolynomial<BigInteger>>	FactorInteger.factorsSquarefreeHensel(GenPolynomial<BigInteger> P)	GenPolynomial factorization of a multivariate squarefree polynomial, using Hensel lifting.
List<GenPolynomial<C>>	FactorAbstract.factorsSquarefreeKronecker(GenPolynomial<C> P)	GenPolynomial factorization of a squarefree polynomial, using Kronecker substitution.
List<GenPolynomial<C>>	FactorAbstract.factorsSquarefreeOptimize(GenPolynomial<C> P)	GenPolynomial factorization of a multivariate squarefree polynomial, using Kronecker substitution and variable order optimization.
List<GenPolynomial<BigInteger>>	FactorInteger.factorsSquarefreeOptions(GenPolynomial<BigInteger> P, boolean opti, boolean tlex)	GenPolynomial factorization of a multivariate squarefree polynomial, using Hensel lifting if possible.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUfdUtil.fromIntegerCoefficients(GenPolynomialRing<GenPolynomial<C>> fac, GenPolynomial<GenPolynomial<BigInteger>> A)	From BigInteger coefficients.
static <C extends RingElem<C>> List<GenPolynomial<GenPolynomial<C>>>	PolyUfdUtil.fromIntegerCoefficients(GenPolynomialRing<GenPolynomial<C>> fac, List<GenPolynomial<GenPolynomial<BigInteger>>> L)	From BigInteger coefficients.
static <C extends RingElem<C>> List<GenPolynomial<GenPolynomial<C>>>	PolyUfdUtil.fromIntegerCoefficients(GenPolynomialRing<GenPolynomial<C>> fac, List<GenPolynomial<GenPolynomial<BigInteger>>> L)	From BigInteger coefficients.
List<GenPolynomial<AlgebraicNumber<C>>>	Factors.getFactors()	Get the list of factors at one level.
static GenPolynomial<GenPolynomial<BigInteger>>	PolyUfdUtil.integerFromRationalCoefficients(GenPolynomialRing<GenPolynomial<BigInteger>> fac, GenPolynomial<GenPolynomial<BigRational>> A)	BigInteger from BigRational coefficients.
static List<GenPolynomial<GenPolynomial<BigInteger>>>	PolyUfdUtil.integerFromRationalCoefficients(GenPolynomialRing<GenPolynomial<BigInteger>> fac, List<GenPolynomial<GenPolynomial<BigRational>>> L)	BigInteger from BigRational coefficients.
static List<GenPolynomial<GenPolynomial<BigInteger>>>	PolyUfdUtil.integerFromRationalCoefficients(GenPolynomialRing<GenPolynomial<BigInteger>> fac, List<GenPolynomial<GenPolynomial<BigRational>>> L)	BigInteger from BigRational coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUfdUtil.integralFromQuotientCoefficients(GenPolynomialRing<GenPolynomial<C>> fac, GenPolynomial<Quotient<C>> A)	Integral polynomial from rational function coefficients.
static <C extends GcdRingElem<C>> List<GenPolynomial<GenPolynomial<C>>>	PolyUfdUtil.integralFromQuotientCoefficients(GenPolynomialRing<GenPolynomial<C>> fac, Collection<GenPolynomial<Quotient<C>>> L)	Integral polynomial from rational function coefficients.
static <C extends GcdRingElem<C>> List<GenPolynomial<GenPolynomial<C>>>	PolyUfdUtil.integralFromQuotientCoefficients(GenPolynomialRing<GenPolynomial<C>> fac, Collection<GenPolynomial<Quotient<C>>> L)	Integral polynomial from rational function coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUfdUtil.introduceLowerVariable(GenPolynomialRing<GenPolynomial<C>> rfac, GenPolynomial<C> A)	Introduce lower variable.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselMultUtil.liftDiophant(GenPolynomial<MOD> A, GenPolynomial<MOD> B, GenPolynomial<MOD> C, List<MOD> V, long d, long k)	Modular diophantine equation solution and lifting algorithm.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselMultUtil.liftDiophant(List<GenPolynomial<MOD>> A, GenPolynomial<MOD> C, List<MOD> V, long d, long k)	Modular diophantine equation solution and lifting algorithm.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselUtil.liftDiophant(GenPolynomial<MOD> A, GenPolynomial<MOD> B, long e, long k)	Modular diophantine equation solution and lifting algorithm.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselUtil.liftDiophant(GenPolynomial<MOD> A, GenPolynomial<MOD> B, GenPolynomial<MOD> C, long k)	Modular diophantine equation solution and lifting algorithm.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselUtil.liftDiophant(List<GenPolynomial<MOD>> A, long e, long k)	Modular diophantine equation solution and lifting algorithm.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselUtil.liftDiophant(List<GenPolynomial<MOD>> A, GenPolynomial<MOD> C, long k)	Modular diophantine equation solution and lifting algorithm.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselUtil.liftExtendedEuclidean(List<GenPolynomial<MOD>> A, long k)	Constructing and lifting algorithm for extended Euclidean relation.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselMultUtil.liftHensel(GenPolynomial<BigInteger> C, GenPolynomial<MOD> Cp, List<GenPolynomial<MOD>> F, List<BigInteger> V, long k, List<GenPolynomial<BigInteger>> G)	Modular Hensel lifting algorithm.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselUtil.liftHensel(GenPolynomial<BigInteger> C, List<GenPolynomial<MOD>> F, long k, BigInteger g)	Modular Hensel lifting algorithm on coefficients.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselMultUtil.liftHenselFull(GenPolynomial<BigInteger> C, List<GenPolynomial<MOD>> F, List<BigInteger> V, long k, List<GenPolynomial<BigInteger>> G)	Modular Hensel full lifting algorithm.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselMultUtil.liftHenselMonic(GenPolynomial<BigInteger> C, GenPolynomial<MOD> Cp, List<GenPolynomial<MOD>> F, List<BigInteger> V, long k)	Modular Hensel lifting algorithm, monic case.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselUtil.liftHenselMonic(GenPolynomial<BigInteger> C, List<GenPolynomial<MOD>> F, long k)	Modular Hensel lifting algorithm on coefficients.
List<GenPolynomial<C>>	FactorAbstract.normalizeFactorization(List<GenPolynomial<C>> F)	Normalize factorization.
SortedMap<GenPolynomial<C>, Long>	SquarefreeAbstract.normalizeFactorization(SortedMap<GenPolynomial<C>, Long> F)	Normalize factorization.
static <C extends GcdRingElem<C>> List<GenPolynomial<Quotient<C>>>	PolyUfdUtil.quotientFromIntegralCoefficients(GenPolynomialRing<Quotient<C>> fac, Collection<GenPolynomial<GenPolynomial<C>>> L)	Rational function from integral polynomial coefficients.
SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	FactorAbstract.recursiveFactors(GenPolynomial<GenPolynomial<C>> P)	Recursive GenPolynomial factorization.
SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	FactorAbstract.recursiveFactors(GenPolynomial<GenPolynomial<C>> P)	Recursive GenPolynomial factorization.
List<GenPolynomial<GenPolynomial<C>>>	FactorAbstract.recursiveFactorsSquarefree(GenPolynomial<GenPolynomial<C>> P)	Recursive GenPolynomial factorization of a squarefree polynomial.
List<GenPolynomial<GenPolynomial<C>>>	FactorAbstract.recursiveFactorsSquarefree(GenPolynomial<GenPolynomial<C>> P)	Recursive GenPolynomial factorization of a squarefree polynomial.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.recursiveGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.recursivePrimitivePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive primitive part.
List<GenPolynomial<GenPolynomial<C>>>	GreatestCommonDivisorAbstract.recursivePrimitivePart(List<GenPolynomial<GenPolynomial<C>>> F)	List of recursive GenPolynomial base coefficient primitive part.
List<GenPolynomial<GenPolynomial<C>>>	GreatestCommonDivisorAbstract.recursivePrimitivePart(List<GenPolynomial<GenPolynomial<C>>> F)	List of recursive GenPolynomial base coefficient primitive part.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorFake.recursivePrimitivePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive primitive part.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorSubres.recursivePseudoRemainder(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Deprecated. (forRemoval=true) Use PolyUtil.recursiveDensePseudoRemainder(edu.jas.poly.GenPolynomial,edu.jas.poly.GenPolynomial) instead
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.recursiveResultant(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	GenPolynomial recursive resultant.
SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	SquarefreeAbstract.recursiveSquarefreeFactors(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive polynomial squarefree factorization.
SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	SquarefreeAbstract.recursiveSquarefreeFactors(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive polynomial squarefree factorization.
GenPolynomial<GenPolynomial<C>>	SquarefreeAbstract.recursiveSquarefreePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive polynomial greatest squarefree divisor.
GenPolynomial<GenPolynomial<C>>	GCDProxy.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive greatest common divisor.
abstract GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorFake.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<BigInteger>>	GreatestCommonDivisorHensel.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<BigInteger>> P, GenPolynomial<GenPolynomial<BigInteger>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<MOD>>	GreatestCommonDivisorModEval.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<MOD>> P, GenPolynomial<GenPolynomial<MOD>> S)	Recursive univariate GenPolynomial greatest common divisor.
GenPolynomial<GenPolynomial<BigInteger>>	GreatestCommonDivisorModular.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<BigInteger>> P, GenPolynomial<GenPolynomial<BigInteger>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorPrimitive.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorSimple.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorSubres.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<C>>	GCDProxy.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial resultant.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive resultant.
GenPolynomial<GenPolynomial<MOD>>	GreatestCommonDivisorModEval.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<MOD>> P, GenPolynomial<GenPolynomial<MOD>> S)	Univariate GenPolynomial recursive resultant.
GenPolynomial<GenPolynomial<BigInteger>>	GreatestCommonDivisorModular.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<BigInteger>> P, GenPolynomial<GenPolynomial<BigInteger>> S)	Univariate GenPolynomial recursive resultant.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorSimple.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive resultant.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorSubres.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive resultant.
abstract GenPolynomial<GenPolynomial<C>>	SquarefreeFieldCharP.recursiveUnivariateRootCharacteristic(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial char-th root univariate polynomial with polynomial coefficients.
GenPolynomial<GenPolynomial<C>>	SquarefreeFiniteFieldCharP.recursiveUnivariateRootCharacteristic(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial char-th root univariate polynomial with polynomial coefficients.
GenPolynomial<GenPolynomial<AlgebraicNumber<C>>>	SquarefreeInfiniteAlgebraicFieldCharP.recursiveUnivariateRootCharacteristic(GenPolynomial<GenPolynomial<AlgebraicNumber<C>>> P)	GenPolynomial char-th root univariate polynomial with polynomial coefficients.
GenPolynomial<GenPolynomial<Quotient<C>>>	SquarefreeInfiniteFieldCharP.recursiveUnivariateRootCharacteristic(GenPolynomial<GenPolynomial<Quotient<C>>> P)	GenPolynomial char-th root univariate polynomial with polynomial coefficients.
abstract SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	SquarefreeAbstract.recursiveUnivariateSquarefreeFactors(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial squarefree factorization.
abstract SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	SquarefreeAbstract.recursiveUnivariateSquarefreeFactors(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial squarefree factorization.
SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	SquarefreeFieldChar0.recursiveUnivariateSquarefreeFactors(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial squarefree factorization.
SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	SquarefreeFieldChar0.recursiveUnivariateSquarefreeFactors(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial squarefree factorization.
SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	SquarefreeFieldChar0Yun.recursiveUnivariateSquarefreeFactors(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial squarefree factorization.
SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	SquarefreeFieldChar0Yun.recursiveUnivariateSquarefreeFactors(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial squarefree factorization.
SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	SquarefreeFieldCharP.recursiveUnivariateSquarefreeFactors(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial squarefree factorization.
SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	SquarefreeFieldCharP.recursiveUnivariateSquarefreeFactors(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial squarefree factorization.
SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	SquarefreeRingChar0.recursiveUnivariateSquarefreeFactors(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial squarefree factorization.
SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	SquarefreeRingChar0.recursiveUnivariateSquarefreeFactors(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial squarefree factorization.
abstract GenPolynomial<GenPolynomial<C>>	SquarefreeAbstract.recursiveUnivariateSquarefreePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive polynomial greatest squarefree divisor.
GenPolynomial<GenPolynomial<C>>	SquarefreeFieldChar0.recursiveUnivariateSquarefreePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial greatest squarefree divisor.
GenPolynomial<GenPolynomial<C>>	SquarefreeFieldCharP.recursiveUnivariateSquarefreePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial greatest squarefree divisor.
GenPolynomial<GenPolynomial<C>>	SquarefreeRingChar0.recursiveUnivariateSquarefreePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial greatest squarefree divisor.
List<GenPolynomial<GenPolynomial<C>>>	GreatestCommonDivisorSubres.recursiveUnivariateSubResultantList(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive Subresultant list.
List<GenPolynomial<GenPolynomial<C>>>	GreatestCommonDivisorSubres.recursiveUnivariateSubResultantList(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive Subresultant list.
SortedMap<GenPolynomial<C>, Long>	SquarefreeFiniteFieldCharP.rootCharacteristic(GenPolynomial<C> P)	Characteristics root of a polynomial.
(package private) List<GenPolynomial<BigInteger>>	FactorInteger.searchFactorsMonic(GenPolynomial<BigInteger> C, BigInteger M, List<GenPolynomial<MOD>> F, BitSet D)	Factor search with modular Hensel lifting algorithm.
(package private) List<GenPolynomial<BigInteger>>	FactorInteger.searchFactorsNonMonic(GenPolynomial<BigInteger> C, BigInteger M, List<GenPolynomial<MOD>> F, BitSet D)	Factor search with modular Hensel lifting algorithm.
SortedMap<GenPolynomial<C>, Long>	FactorAbstract.squarefreeFactors(GenPolynomial<C> P)	GenPolynomial squarefree factorization.
SortedMap<GenPolynomial<C>, Long>	Factorization.squarefreeFactors(GenPolynomial<C> P)	GenPolynomial squarefree factorization.
SortedMap<GenPolynomial<C>, Long>	Squarefree.squarefreeFactors(GenPolynomial<C> P)	GenPolynomial squarefree factorization.
abstract SortedMap<GenPolynomial<C>, Long>	SquarefreeAbstract.squarefreeFactors(GenPolynomial<C> P)	GenPolynomial squarefree factorization.
SortedMap<GenPolynomial<C>, Long>	SquarefreeFieldChar0.squarefreeFactors(GenPolynomial<C> P)	GenPolynomial squarefree factorization.
SortedMap<GenPolynomial<C>, Long>	SquarefreeFieldCharP.squarefreeFactors(GenPolynomial<C> P)	GenPolynomial squarefree factorization.
SortedMap<GenPolynomial<C>, Long>	SquarefreeRingChar0.squarefreeFactors(GenPolynomial<C> P)	GenPolynomial squarefree factorization.
static <C extends GcdRingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUfdUtil.substituteFromAlgebraicCoefficients(GenPolynomialRing<GenPolynomial<C>> rfac, GenPolynomial<AlgebraicNumber<C>> A, long k)	From AlgebraicNumber coefficients.
static <C extends GcdRingElem<C>> List<GenPolynomial<C>>	PolyUfdUtil.substituteKronecker(List<GenPolynomial<C>> A, int d)	Kronecker substitution.

Methods in edu.jas.ufd with parameters of type GenPolynomial

Modifier and Type	Method	Description
static <C extends GcdRingElem<C>> GenPolynomial<C>[]	PolyUfdUtil.agcd(GenPolynomial<C> R, GenPolynomial<C> S, int n)	GenPolynomial approximate common divisor.
static <C extends GcdRingElem<C>> GenPolynomial<C>	PolyUfdUtil.backSubstituteKronecker(GenPolynomialRing<C> fac, GenPolynomial<C> A, long d)	Kronecker back substitution.
PartialFraction<C>	FactorAbsolute.baseAlgebraicPartialFraction(GenPolynomial<C> A, GenPolynomial<C> P)	Univariate GenPolynomial algebraic partial fraction decomposition, Absolute factorization for elementary integration algorithm to linear factors.
PartialFraction<C>	FactorAbsolute.baseAlgebraicPartialFractionIrreducibleAbsolute(GenPolynomial<C> A, GenPolynomial<C> P)	Univariate GenPolynomial algebraic partial fraction decomposition, via absolute factorization to linear factors.
C	GreatestCommonDivisorAbstract.baseContent(GenPolynomial<C> P)	GenPolynomial base coefficient content.
C	GreatestCommonDivisorFake.baseContent(GenPolynomial<C> P)	GenPolynomial base coefficient content.
GenPolynomial<C>	GreatestCommonDivisorSubres.baseDiscriminant(GenPolynomial<C> P)	GenPolynomial base coefficient discriminant.
SortedMap<Long, GenPolynomial<MOD>>	FactorModular.baseDistinctDegreeFactors(GenPolynomial<MOD> P)	GenPolynomial base distinct degree factorization.
List<GenPolynomial<MOD>>	FactorModular.baseEqualDegreeFactors(GenPolynomial<MOD> P, long deg)	GenPolynomial base equal degree factorization.
GenPolynomial<C>[]	GreatestCommonDivisorAbstract.baseExtendedGcd(GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial extended greatest common divisor.
SortedMap<GenPolynomial<C>, Long>	FactorAbstract.baseFactors(GenPolynomial<C> P)	Univariate GenPolynomial factorization.
FactorsMap<C>	FactorAbsolute.baseFactorsAbsolute(GenPolynomial<C> P)	GenPolynomial absolute base factorization of a polynomial.
Factors<C>	FactorAbsolute.baseFactorsAbsoluteIrreducible(GenPolynomial<C> P)	GenPolynomial base absolute factorization of a irreducible polynomial.
FactorsList<C>	FactorAbsolute.baseFactorsAbsoluteSquarefree(GenPolynomial<C> P)	GenPolynomial absolute base factorization of a squarefree polynomial.
List<GenPolynomial<C>>	FactorAbstract.baseFactorsRadical(GenPolynomial<C> P)	Univariate GenPolynomial factorization ignoring multiplicities.
abstract List<GenPolynomial<C>>	FactorAbstract.baseFactorsSquarefree(GenPolynomial<C> P)	Univariate GenPolynomial factorization of a squarefree polynomial.
List<GenPolynomial<AlgebraicNumber<C>>>	FactorAlgebraic.baseFactorsSquarefree(GenPolynomial<AlgebraicNumber<C>> P)	GenPolynomial base factorization of a squarefree polynomial.
List<GenPolynomial<Complex<C>>>	FactorComplex.baseFactorsSquarefree(GenPolynomial<Complex<C>> P)	GenPolynomial base factorization of a squarefree polynomial.
List<GenPolynomial<BigInteger>>	FactorInteger.baseFactorsSquarefree(GenPolynomial<BigInteger> P)	GenPolynomial base factorization of a squarefree polynomial.
List<GenPolynomial<MOD>>	FactorModular.baseFactorsSquarefree(GenPolynomial<MOD> P)	GenPolynomial base factorization of a squarefree polynomial.
List<GenPolynomial<MOD>>	FactorModularBerlekamp.baseFactorsSquarefree(GenPolynomial<MOD> P)	GenPolynomial base factorization of a squarefree polynomial.
List<GenPolynomial<Quotient<C>>>	FactorQuotient.baseFactorsSquarefree(GenPolynomial<Quotient<C>> P)	GenPolynomial base factorization of a squarefree polynomial.
List<GenPolynomial<BigRational>>	FactorRational.baseFactorsSquarefree(GenPolynomial<BigRational> P)	GenPolynomial base factorization of a squarefree polynomial.
List<GenPolynomial<MOD>>	FactorModularBerlekamp.baseFactorsSquarefreeBigPrime(GenPolynomial<MOD> P)	GenPolynomial base factorization of a squarefree polynomial.
List<GenPolynomial<MOD>>	FactorModularBerlekamp.baseFactorsSquarefreeSmallPrime(GenPolynomial<MOD> P)	GenPolynomial base factorization of a squarefree polynomial.
GenPolynomial<C>	GCDProxy.baseGcd(GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial greatest common divisor.
abstract GenPolynomial<C>	GreatestCommonDivisorAbstract.baseGcd(GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial greatest common divisor.
GenPolynomial<C>	GreatestCommonDivisorFake.baseGcd(GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial greatest common divisor.
GenPolynomial<BigInteger>	GreatestCommonDivisorHensel.baseGcd(GenPolynomial<BigInteger> P, GenPolynomial<BigInteger> S)	Univariate GenPolynomial greatest common divisor.
GenPolynomial<MOD>	GreatestCommonDivisorModEval.baseGcd(GenPolynomial<MOD> P, GenPolynomial<MOD> S)	Univariate GenPolynomial greatest common divisor.
GenPolynomial<BigInteger>	GreatestCommonDivisorModular.baseGcd(GenPolynomial<BigInteger> P, GenPolynomial<BigInteger> S)	Univariate GenPolynomial greatest common divisor.
GenPolynomial<C>	GreatestCommonDivisorPrimitive.baseGcd(GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial greatest common divisor.
GenPolynomial<C>	GreatestCommonDivisorSimple.baseGcd(GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial greatest common divisor.
GenPolynomial<C>	GreatestCommonDivisorSubres.baseGcd(GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial greatest common divisor.
GenPolynomial<C>[]	GreatestCommonDivisorAbstract.baseGcdDiophant(GenPolynomial<C> P, GenPolynomial<C> S, GenPolynomial<C> c)	Univariate GenPolynomial greatest common divisor diophantine version.
GenPolynomial<C>[]	GreatestCommonDivisorAbstract.baseHalfExtendedGcd(GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial half extended greatest common divisor.
List<GenPolynomial<C>>	GreatestCommonDivisorAbstract.basePartialFraction(GenPolynomial<C> A, GenPolynomial<C> P, int e)	Univariate GenPolynomial partial fraction decomposition.
GenPolynomial<C>[]	GreatestCommonDivisorAbstract.basePartialFraction(GenPolynomial<C> A, GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial partial fraction decomposition.
List<GenPolynomial<C>>	GreatestCommonDivisorAbstract.basePartialFraction(GenPolynomial<C> A, List<GenPolynomial<C>> D)	Univariate GenPolynomial partial fraction decomposition.
List<List<GenPolynomial<C>>>	SquarefreeAbstract.basePartialFraction(GenPolynomial<C> A, SortedMap<GenPolynomial<C>, Long> D)	Univariate GenPolynomial partial fraction decomposition.
GenPolynomial<C>	GreatestCommonDivisorAbstract.basePartialFractionValue(GenPolynomial<C> P, int e, List<GenPolynomial<C>> F)	Test for Univariate GenPolynomial partial fraction decomposition.
GenPolynomial<C>	FactorAbstract.basePrimitivePart(GenPolynomial<C> P)	GenPolynomial base primitive part.
GenPolynomial<C>	GreatestCommonDivisorAbstract.basePrimitivePart(GenPolynomial<C> P)	GenPolynomial base coefficient primitive part.
GenPolynomial<C>	GreatestCommonDivisorFake.basePrimitivePart(GenPolynomial<C> P)	GenPolynomial base coefficient primitive part.
GenPolynomial<C>	GreatestCommonDivisorSubres.basePseudoRemainder(GenPolynomial<C> P, GenPolynomial<C> S)	Deprecated. (forRemoval=true) Use PolyUtil.baseDensePseudoRemainder(edu.jas.poly.GenPolynomial,edu.jas.poly.GenPolynomial) instead
C	GreatestCommonDivisorAbstract.baseRecursiveContent(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial base recursive content.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.baseRecursivePrimitivePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial base recursive primitive part.
GenPolynomial<C>	GCDProxy.baseResultant(GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial resultant.
GenPolynomial<C>	GreatestCommonDivisorAbstract.baseResultant(GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial resultant.
GenPolynomial<MOD>	GreatestCommonDivisorModEval.baseResultant(GenPolynomial<MOD> P, GenPolynomial<MOD> S)	Univariate GenPolynomial resultant.
GenPolynomial<BigInteger>	GreatestCommonDivisorModular.baseResultant(GenPolynomial<BigInteger> P, GenPolynomial<BigInteger> S)	Univariate GenPolynomial resultant.
GenPolynomial<C>	GreatestCommonDivisorSimple.baseResultant(GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial resultant.
GenPolynomial<C>	GreatestCommonDivisorSubres.baseResultant(GenPolynomial<C> P, GenPolynomial<C> S)	Univariate GenPolynomial resultant.
abstract GenPolynomial<C>	SquarefreeFieldCharP.baseRootCharacteristic(GenPolynomial<C> P)	GenPolynomial char-th root univariate polynomial.
GenPolynomial<C>	SquarefreeFiniteFieldCharP.baseRootCharacteristic(GenPolynomial<C> P)	GenPolynomial char-th root univariate polynomial.
GenPolynomial<AlgebraicNumber<C>>	SquarefreeInfiniteAlgebraicFieldCharP.baseRootCharacteristic(GenPolynomial<AlgebraicNumber<C>> P)	GenPolynomial char-th root univariate polynomial.
GenPolynomial<Quotient<C>>	SquarefreeInfiniteFieldCharP.baseRootCharacteristic(GenPolynomial<Quotient<C>> P)	GenPolynomial char-th root univariate polynomial.
abstract SortedMap<GenPolynomial<C>, Long>	SquarefreeAbstract.baseSquarefreeFactors(GenPolynomial<C> A)	GenPolynomial polynomial squarefree factorization.
SortedMap<GenPolynomial<C>, Long>	SquarefreeFieldChar0.baseSquarefreeFactors(GenPolynomial<C> A)	GenPolynomial polynomial squarefree factorization.
SortedMap<GenPolynomial<C>, Long>	SquarefreeFieldChar0Yun.baseSquarefreeFactors(GenPolynomial<C> A)	GenPolynomial polynomial squarefree factorization.
SortedMap<GenPolynomial<C>, Long>	SquarefreeFieldCharP.baseSquarefreeFactors(GenPolynomial<C> A)	GenPolynomial polynomial squarefree factorization.
SortedMap<GenPolynomial<C>, Long>	SquarefreeRingChar0.baseSquarefreeFactors(GenPolynomial<C> A)	GenPolynomial polynomial squarefree factorization.
abstract GenPolynomial<C>	SquarefreeAbstract.baseSquarefreePart(GenPolynomial<C> P)	GenPolynomial polynomial greatest squarefree divisor.
GenPolynomial<C>	SquarefreeFieldChar0.baseSquarefreePart(GenPolynomial<C> P)	GenPolynomial polynomial greatest squarefree divisor.
GenPolynomial<C>	SquarefreeFieldCharP.baseSquarefreePart(GenPolynomial<C> P)	GenPolynomial polynomial greatest squarefree divisor.
GenPolynomial<C>	SquarefreeRingChar0.baseSquarefreePart(GenPolynomial<C> P)	GenPolynomial polynomial greatest squarefree divisor.
static <C extends GcdRingElem<C>> ArrayList<ArrayList<C>>	PolyUfdUtil.constructQmatrix(GenPolynomial<C> A)	Construct Berlekamp Q matrix.
GenPolynomial<C>	GreatestCommonDivisor.content(GenPolynomial<C> P)	GenPolynomial content.
GenPolynomial<C>	GreatestCommonDivisorAbstract.content(GenPolynomial<C> P)	GenPolynomial content.
GenPolynomial<C>[]	GreatestCommonDivisorAbstract.contentPrimitivePart(GenPolynomial<C> P)	GenPolynomial content and primitive part.
List<GenPolynomial<C>>	GreatestCommonDivisorAbstract.coPrime(GenPolynomial<C> a, List<GenPolynomial<C>> P)	GenPolynomial co-prime list.
List<GenPolynomial<C>>	Squarefree.coPrimeSquarefree(GenPolynomial<C> a, List<GenPolynomial<C>> P)	GenPolynomial squarefree and co-prime list.
List<GenPolynomial<C>>	SquarefreeAbstract.coPrimeSquarefree(GenPolynomial<C> a, List<GenPolynomial<C>> P)	GenPolynomial squarefree and co-prime list.
Quotient<C>	QuotientRing.create(GenPolynomial<C> n)	Create from numerator.
Quotient<C>	QuotientRing.create(GenPolynomial<C> n, GenPolynomial<C> d)	Create from numerator, denominator pair.
static List<GenPolynomial<BigInteger>>	CycloUtil.cyclotomicFactors(GenPolynomial<BigInteger> p)	Compute the factors of the cyclotomic polynomial.
GenPolynomial<C>	GreatestCommonDivisorAbstract.divide(GenPolynomial<C> a, C b)	GenPolynomial division.
protected GenPolynomial<C>	QuotientRing.divide(GenPolynomial<C> n, GenPolynomial<C> d)	Divide.
GenPolynomial<C>	BackSubstKronecker.eval(GenPolynomial<C> c)
GenPolynomial<C>	SubstKronecker.eval(GenPolynomial<C> c)
static <C extends GcdRingElem<C>> EvalPoints<C>	PolyUfdUtil.evaluationPoints(GenPolynomial<C> A)	Polynomial suitable evaluation points.
SortedMap<GenPolynomial<C>, Long>	FactorAbstract.factors(GenPolynomial<C> P)	GenPolynomial factorization.
SortedMap<GenPolynomial<C>, Long>	Factorization.factors(GenPolynomial<C> P)	GenPolynomial factorization.
SortedMap<GenPolynomial<BigRational>, Long>	FactorRational.factors(GenPolynomial<BigRational> P)	GenPolynomial factorization of a polynomial.
FactorsMap<C>	FactorAbsolute.factorsAbsolute(GenPolynomial<C> P)	GenPolynomial absolute factorization of a polynomial.
Factors<C>	FactorAbsolute.factorsAbsoluteIrreducible(GenPolynomial<C> P)	GenPolynomial absolute factorization of a irreducible polynomial.
FactorsList<C>	FactorAbsolute.factorsAbsoluteSquarefree(GenPolynomial<C> P)	GenPolynomial absolute factorization of a squarefree polynomial.
List<GenPolynomial<C>>	FactorAbstract.factorsRadical(GenPolynomial<C> P)	GenPolynomial factorization ignoring multiplicities.
List<GenPolynomial<C>>	Factorization.factorsRadical(GenPolynomial<C> P)	GenPolynomial factorization ignoring multiplicities.
List<GenPolynomial<C>>	FactorAbstract.factorsSquarefree(GenPolynomial<C> P)	GenPolynomial factorization of a squarefree polynomial, using Kronecker substitution.
List<GenPolynomial<AlgebraicNumber<C>>>	FactorAlgebraic.factorsSquarefree(GenPolynomial<AlgebraicNumber<C>> P)	GenPolynomial factorization of a squarefree polynomial.
List<GenPolynomial<Complex<C>>>	FactorComplex.factorsSquarefree(GenPolynomial<Complex<C>> P)	GenPolynomial factorization of a squarefree polynomial.
List<GenPolynomial<BigInteger>>	FactorInteger.factorsSquarefree(GenPolynomial<BigInteger> P)	GenPolynomial factorization of a multivariate squarefree polynomial, using Hensel lifting if possible.
List<GenPolynomial<C>>	Factorization.factorsSquarefree(GenPolynomial<C> P)	GenPolynomial factorization of a squarefree polynomial.
List<GenPolynomial<Quotient<C>>>	FactorQuotient.factorsSquarefree(GenPolynomial<Quotient<C>> P)	GenPolynomial factorization of a squarefree polynomial.
List<GenPolynomial<BigRational>>	FactorRational.factorsSquarefree(GenPolynomial<BigRational> P)	GenPolynomial factorization of a squarefree polynomial.
List<GenPolynomial<BigInteger>>	FactorInteger.factorsSquarefreeHensel(GenPolynomial<BigInteger> P)	GenPolynomial factorization of a multivariate squarefree polynomial, using Hensel lifting.
List<GenPolynomial<C>>	FactorAbstract.factorsSquarefreeKronecker(GenPolynomial<C> P)	GenPolynomial factorization of a squarefree polynomial, using Kronecker substitution.
List<GenPolynomial<C>>	FactorAbstract.factorsSquarefreeOptimize(GenPolynomial<C> P)	GenPolynomial factorization of a multivariate squarefree polynomial, using Kronecker substitution and variable order optimization.
List<GenPolynomial<BigInteger>>	FactorInteger.factorsSquarefreeOptions(GenPolynomial<BigInteger> P, boolean opti, boolean tlex)	GenPolynomial factorization of a multivariate squarefree polynomial, using Hensel lifting if possible.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUfdUtil.fromIntegerCoefficients(GenPolynomialRing<GenPolynomial<C>> fac, GenPolynomial<GenPolynomial<BigInteger>> A)	From BigInteger coefficients.
GenPolynomial<C>	GCDProxy.gcd(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial greatest common divisor.
GenPolynomial<C>	GreatestCommonDivisor.gcd(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial greatest common divisor.
GenPolynomial<C>	GreatestCommonDivisorAbstract.gcd(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial greatest common divisor.
GenPolynomial<MOD>	GreatestCommonDivisorModEval.gcd(GenPolynomial<MOD> P, GenPolynomial<MOD> S)	GenPolynomial greatest common divisor, modular evaluation algorithm.
GenPolynomial<BigInteger>	GreatestCommonDivisorModular.gcd(GenPolynomial<BigInteger> P, GenPolynomial<BigInteger> S)	GenPolynomial greatest common divisor, modular algorithm.
protected GenPolynomial<C>	QuotientRing.gcd(GenPolynomial<C> n, GenPolynomial<C> d)	Greatest common divisor.
Factors<AlgebraicNumber<C>>	Factors.getFactor(GenPolynomial<AlgebraicNumber<C>> p)	Get the factor for polynomial.
static GenPolynomial<GenPolynomial<BigInteger>>	PolyUfdUtil.integerFromRationalCoefficients(GenPolynomialRing<GenPolynomial<BigInteger>> fac, GenPolynomial<GenPolynomial<BigRational>> A)	BigInteger from BigRational coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUfdUtil.integralFromQuotientCoefficients(GenPolynomialRing<GenPolynomial<C>> fac, GenPolynomial<Quotient<C>> A)	Integral polynomial from rational function coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUfdUtil.introduceLowerVariable(GenPolynomialRing<GenPolynomial<C>> rfac, GenPolynomial<C> A)	Introduce lower variable.
boolean	FactorAbsolute.isAbsoluteIrreducible(GenPolynomial<C> P)	GenPolynomial test if is absolute irreducible.
boolean	GreatestCommonDivisorAbstract.isBasePartialFraction(GenPolynomial<C> A, GenPolynomial<C> P, int e, List<GenPolynomial<C>> F)	Test for Univariate GenPolynomial partial fraction decomposition.
boolean	GreatestCommonDivisorAbstract.isBasePartialFraction(GenPolynomial<C> A, List<GenPolynomial<C>> D, List<GenPolynomial<C>> F)	Test for Univariate GenPolynomial partial fraction decomposition.
boolean	SquarefreeAbstract.isBasePartialFraction(GenPolynomial<C> A, SortedMap<GenPolynomial<C>, Long> D, List<List<GenPolynomial<C>>> F)	Test for Univariate GenPolynomial partial fraction decomposition.
boolean	SquarefreeFieldChar0.isBaseSquarefree(GenPolynomial<C> P)	GenPolynomial test if is squarefree.
boolean	SquarefreeFieldCharP.isCharRoot(GenPolynomial<C> P, SortedMap<GenPolynomial<C>, Long> F)	Polynomial is char-th root.
static boolean	CycloUtil.isCyclotomicPolynomial(GenPolynomial<BigInteger> p)	Test for cyclotomic polynomial.
static <MOD extends GcdRingElem<MOD> & Modular> boolean	HenselUtil.isDiophantLift(GenPolynomial<MOD> A, GenPolynomial<MOD> B, GenPolynomial<MOD> S1, GenPolynomial<MOD> S2, GenPolynomial<MOD> C)	Modular Diophant relation lifting test.
static <MOD extends GcdRingElem<MOD> & Modular> boolean	HenselUtil.isDiophantLift(List<GenPolynomial<MOD>> A, List<GenPolynomial<MOD>> S, GenPolynomial<MOD> C)	Modular Diophant relation lifting test.
boolean	FactorAbstract.isFactorization(GenPolynomial<C> P, List<GenPolynomial<C>> F)	GenPolynomial is factorization.
boolean	FactorAbstract.isFactorization(GenPolynomial<C> P, SortedMap<GenPolynomial<C>, Long> F)	GenPolynomial is factorization.
boolean	Factorization.isFactorization(GenPolynomial<C> P, List<GenPolynomial<C>> F)	GenPolynomial is factorization.
boolean	Factorization.isFactorization(GenPolynomial<C> P, SortedMap<GenPolynomial<C>, Long> F)	GenPolynomial is factorization.
boolean	Squarefree.isFactorization(GenPolynomial<C> P, List<GenPolynomial<C>> F)	GenPolynomial is (squarefree) factorization.
boolean	Squarefree.isFactorization(GenPolynomial<C> P, SortedMap<GenPolynomial<C>, Long> F)	GenPolynomial is (squarefree) factorization.
boolean	SquarefreeAbstract.isFactorization(GenPolynomial<C> P, List<GenPolynomial<C>> F)	GenPolynomial is (squarefree) factorization.
boolean	SquarefreeAbstract.isFactorization(GenPolynomial<C> P, SortedMap<GenPolynomial<C>, Long> F)	GenPolynomial is (squarefree) factorization.
static <MOD extends GcdRingElem<MOD> & Modular> boolean	HenselMultUtil.isHenselLift(GenPolynomial<BigInteger> C, GenPolynomial<MOD> Cp, List<GenPolynomial<MOD>> F, List<GenPolynomial<MOD>> L)	Modular Hensel lifting algorithm on coefficients test.
static boolean	HenselUtil.isHenselLift(GenPolynomial<BigInteger> C, BigInteger M, BigInteger p, GenPolynomial<BigInteger> A, GenPolynomial<BigInteger> B)	Modular Hensel lifting test.
static <MOD extends GcdRingElem<MOD> & Modular> boolean	HenselUtil.isHenselLift(GenPolynomial<BigInteger> C, BigInteger M, BigInteger p, HenselApprox<MOD> Ha)	Modular Hensel lifting test.
static boolean	HenselUtil.isHenselLift(GenPolynomial<BigInteger> C, BigInteger M, BigInteger p, List<GenPolynomial<BigInteger>> G)	Modular Hensel lifting test.
boolean	FactorAbstract.isIrreducible(GenPolynomial<C> P)	GenPolynomial test if is irreducible.
boolean	FactorInteger.isIrreducible(GenPolynomial<BigInteger> P)	GenPolynomial test if is irreducible.
boolean	Factorization.isIrreducible(GenPolynomial<C> P)	GenPolynomial test if is irreducible.
boolean	FactorInteger.isIrreducibleEisenstein(GenPolynomial<BigInteger> P)	GenPolynomial test if is irreducible with Eisenstein criterion.
(package private) boolean	FactorInteger.isNearlySquarefree(GenPolynomial<BigInteger> P)
boolean	SquarefreeFieldCharP.isRecursiveCharRoot(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> r)	Recursive polynomial is char-th root.
boolean	SquarefreeFieldCharP.isRecursiveCharRoot(GenPolynomial<GenPolynomial<C>> P, SortedMap<GenPolynomial<GenPolynomial<C>>, Long> F)	Recursive polynomial is char-th root.
boolean	FactorAbstract.isRecursiveFactorization(GenPolynomial<GenPolynomial<C>> P, SortedMap<GenPolynomial<GenPolynomial<C>>, Long> F)	GenPolynomial is factorization.
boolean	SquarefreeAbstract.isRecursiveFactorization(GenPolynomial<GenPolynomial<C>> P, SortedMap<GenPolynomial<GenPolynomial<C>>, Long> F)	GenPolynomial is (squarefree) factorization.
boolean	SquarefreeAbstract.isRecursiveSquarefree(GenPolynomial<GenPolynomial<C>> P)	Recursive GenPolynomial test if is squarefree.
boolean	SquarefreeFieldChar0.isRecursiveUnivariateSquarefree(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial test if is squarefree.
boolean	FactorAbstract.isReducible(GenPolynomial<C> P)	GenPolynomial test if a non trivial factorization exists.
boolean	Factorization.isReducible(GenPolynomial<C> P)	GenPolynomial test if a non trivial factorization exists.
boolean	FactorAbstract.isSquarefree(GenPolynomial<C> P)	GenPolynomial test if is squarefree.
boolean	Factorization.isSquarefree(GenPolynomial<C> P)	GenPolynomial test if is squarefree.
boolean	Squarefree.isSquarefree(GenPolynomial<C> P)	GenPolynomial test if is squarefree.
boolean	SquarefreeAbstract.isSquarefree(GenPolynomial<C> P)	GenPolynomial test if is squarefree.
boolean	SquarefreeFieldChar0.isSquarefree(GenPolynomial<C> P)	GenPolynomial test if is squarefree.
(package private) boolean	SquarefreeAbstract.isSquarefreeAlternative(GenPolynomial<C> P)
GenPolynomial<C>	GreatestCommonDivisor.lcm(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial least common multiple.
GenPolynomial<C>	GreatestCommonDivisorAbstract.lcm(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial least common multiple.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselMultUtil.liftDiophant(GenPolynomial<MOD> A, GenPolynomial<MOD> B, GenPolynomial<MOD> C, List<MOD> V, long d, long k)	Modular diophantine equation solution and lifting algorithm.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselMultUtil.liftDiophant(List<GenPolynomial<MOD>> A, GenPolynomial<MOD> C, List<MOD> V, long d, long k)	Modular diophantine equation solution and lifting algorithm.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselUtil.liftDiophant(GenPolynomial<MOD> A, GenPolynomial<MOD> B, long e, long k)	Modular diophantine equation solution and lifting algorithm.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselUtil.liftDiophant(GenPolynomial<MOD> A, GenPolynomial<MOD> B, GenPolynomial<MOD> C, long k)	Modular diophantine equation solution and lifting algorithm.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselUtil.liftDiophant(List<GenPolynomial<MOD>> A, GenPolynomial<MOD> C, long k)	Modular diophantine equation solution and lifting algorithm.
static <MOD extends GcdRingElem<MOD> & Modular> GenPolynomial<MOD>[]	HenselUtil.liftExtendedEuclidean(GenPolynomial<MOD> A, GenPolynomial<MOD> B, long k)	Constructing and lifting algorithm for extended Euclidean relation.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselMultUtil.liftHensel(GenPolynomial<BigInteger> C, GenPolynomial<MOD> Cp, List<GenPolynomial<MOD>> F, List<BigInteger> V, long k, List<GenPolynomial<BigInteger>> G)	Modular Hensel lifting algorithm.
static <MOD extends GcdRingElem<MOD> & Modular> HenselApprox<MOD>	HenselUtil.liftHensel(GenPolynomial<BigInteger> C, BigInteger M, GenPolynomial<MOD> A, GenPolynomial<MOD> B)	Modular Hensel lifting algorithm on coefficients.
static <MOD extends GcdRingElem<MOD> & Modular> HenselApprox<MOD>	HenselUtil.liftHensel(GenPolynomial<BigInteger> C, BigInteger M, GenPolynomial<MOD> A, GenPolynomial<MOD> B, GenPolynomial<MOD> S, GenPolynomial<MOD> T)	Modular Hensel lifting algorithm on coefficients.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselUtil.liftHensel(GenPolynomial<BigInteger> C, List<GenPolynomial<MOD>> F, long k, BigInteger g)	Modular Hensel lifting algorithm on coefficients.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselMultUtil.liftHenselFull(GenPolynomial<BigInteger> C, List<GenPolynomial<MOD>> F, List<BigInteger> V, long k, List<GenPolynomial<BigInteger>> G)	Modular Hensel full lifting algorithm.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselMultUtil.liftHenselMonic(GenPolynomial<BigInteger> C, GenPolynomial<MOD> Cp, List<GenPolynomial<MOD>> F, List<BigInteger> V, long k)	Modular Hensel lifting algorithm, monic case.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselUtil.liftHenselMonic(GenPolynomial<BigInteger> C, List<GenPolynomial<MOD>> F, long k)	Modular Hensel lifting algorithm on coefficients.
static <MOD extends GcdRingElem<MOD> & Modular> HenselApprox<MOD>	HenselUtil.liftHenselQuadratic(GenPolynomial<BigInteger> C, BigInteger M, GenPolynomial<MOD> A, GenPolynomial<MOD> B)	Modular quadratic Hensel lifting algorithm on coefficients.
static <MOD extends GcdRingElem<MOD> & Modular> HenselApprox<MOD>	HenselUtil.liftHenselQuadratic(GenPolynomial<BigInteger> C, BigInteger M, GenPolynomial<MOD> A, GenPolynomial<MOD> B, GenPolynomial<MOD> S, GenPolynomial<MOD> T)	Modular quadratic Hensel lifting algorithm on coefficients.
static <MOD extends GcdRingElem<MOD> & Modular> HenselApprox<MOD>	HenselUtil.liftHenselQuadraticFac(GenPolynomial<BigInteger> C, BigInteger M, GenPolynomial<MOD> A, GenPolynomial<MOD> B)	Modular Hensel lifting algorithm on coefficients.
static <MOD extends GcdRingElem<MOD> & Modular> HenselApprox<MOD>	HenselUtil.liftHenselQuadraticFac(GenPolynomial<BigInteger> C, BigInteger M, GenPolynomial<MOD> A, GenPolynomial<MOD> B, GenPolynomial<MOD> S, GenPolynomial<MOD> T)	Modular Hensel lifting algorithm on coefficients.
Quotient<C>	Quotient.multiply(GenPolynomial<C> b)	Quotient multiplication by GenPolynomial.
static <C extends GcdRingElem<C>> GenPolynomial<C>	PolyUfdUtil.norm(GenPolynomial<AlgebraicNumber<C>> A)	Norm of a polynomial with AlgebraicNumber coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<C>	PolyUfdUtil.norm(GenPolynomial<AlgebraicNumber<C>> A, long k)	Norm of a polynomial with AlgebraicNumber coefficients.
GenPolynomial<C>	FactorAbstract.primitivePart(GenPolynomial<C> P)	GenPolynomial primitive part.
GenPolynomial<C>	GreatestCommonDivisor.primitivePart(GenPolynomial<C> P)	GenPolynomial primitive part.
GenPolynomial<C>	GreatestCommonDivisorAbstract.primitivePart(GenPolynomial<C> P)	GenPolynomial primitive part.
static <C extends GcdRingElem<C>> GenPolynomial<Quotient<C>>	PolyUfdUtil.quotientFromIntegralCoefficients(GenPolynomialRing<Quotient<C>> fac, GenPolynomial<GenPolynomial<C>> A)	Rational function from integral polynomial coefficients.
GenPolynomial<C>	GreatestCommonDivisorAbstract.recursiveContent(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive content.
GenPolynomial<C>	GreatestCommonDivisorFake.recursiveContent(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive content.
SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	FactorAbstract.recursiveFactors(GenPolynomial<GenPolynomial<C>> P)	Recursive GenPolynomial factorization.
List<GenPolynomial<GenPolynomial<C>>>	FactorAbstract.recursiveFactorsSquarefree(GenPolynomial<GenPolynomial<C>> P)	Recursive GenPolynomial factorization of a squarefree polynomial.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.recursiveGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.recursivePrimitivePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive primitive part.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorFake.recursivePrimitivePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive primitive part.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorSubres.recursivePseudoRemainder(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Deprecated. (forRemoval=true) Use PolyUtil.recursiveDensePseudoRemainder(edu.jas.poly.GenPolynomial,edu.jas.poly.GenPolynomial) instead
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.recursiveResultant(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	GenPolynomial recursive resultant.
SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	SquarefreeAbstract.recursiveSquarefreeFactors(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive polynomial squarefree factorization.
GenPolynomial<GenPolynomial<C>>	SquarefreeAbstract.recursiveSquarefreePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive polynomial greatest squarefree divisor.
GenPolynomial<GenPolynomial<C>>	GCDProxy.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive greatest common divisor.
abstract GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorFake.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<BigInteger>>	GreatestCommonDivisorHensel.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<BigInteger>> P, GenPolynomial<GenPolynomial<BigInteger>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<MOD>>	GreatestCommonDivisorModEval.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<MOD>> P, GenPolynomial<GenPolynomial<MOD>> S)	Recursive univariate GenPolynomial greatest common divisor.
GenPolynomial<GenPolynomial<BigInteger>>	GreatestCommonDivisorModular.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<BigInteger>> P, GenPolynomial<GenPolynomial<BigInteger>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorPrimitive.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorSimple.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorSubres.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<C>>	GCDProxy.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial resultant.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive resultant.
GenPolynomial<GenPolynomial<MOD>>	GreatestCommonDivisorModEval.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<MOD>> P, GenPolynomial<GenPolynomial<MOD>> S)	Univariate GenPolynomial recursive resultant.
GenPolynomial<GenPolynomial<BigInteger>>	GreatestCommonDivisorModular.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<BigInteger>> P, GenPolynomial<GenPolynomial<BigInteger>> S)	Univariate GenPolynomial recursive resultant.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorSimple.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive resultant.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorSubres.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive resultant.
abstract GenPolynomial<GenPolynomial<C>>	SquarefreeFieldCharP.recursiveUnivariateRootCharacteristic(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial char-th root univariate polynomial with polynomial coefficients.
GenPolynomial<GenPolynomial<C>>	SquarefreeFiniteFieldCharP.recursiveUnivariateRootCharacteristic(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial char-th root univariate polynomial with polynomial coefficients.
GenPolynomial<GenPolynomial<AlgebraicNumber<C>>>	SquarefreeInfiniteAlgebraicFieldCharP.recursiveUnivariateRootCharacteristic(GenPolynomial<GenPolynomial<AlgebraicNumber<C>>> P)	GenPolynomial char-th root univariate polynomial with polynomial coefficients.
GenPolynomial<GenPolynomial<Quotient<C>>>	SquarefreeInfiniteFieldCharP.recursiveUnivariateRootCharacteristic(GenPolynomial<GenPolynomial<Quotient<C>>> P)	GenPolynomial char-th root univariate polynomial with polynomial coefficients.
abstract SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	SquarefreeAbstract.recursiveUnivariateSquarefreeFactors(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial squarefree factorization.
SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	SquarefreeFieldChar0.recursiveUnivariateSquarefreeFactors(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial squarefree factorization.
SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	SquarefreeFieldChar0Yun.recursiveUnivariateSquarefreeFactors(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial squarefree factorization.
SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	SquarefreeFieldCharP.recursiveUnivariateSquarefreeFactors(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial squarefree factorization.
SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	SquarefreeRingChar0.recursiveUnivariateSquarefreeFactors(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial squarefree factorization.
abstract GenPolynomial<GenPolynomial<C>>	SquarefreeAbstract.recursiveUnivariateSquarefreePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive polynomial greatest squarefree divisor.
GenPolynomial<GenPolynomial<C>>	SquarefreeFieldChar0.recursiveUnivariateSquarefreePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial greatest squarefree divisor.
GenPolynomial<GenPolynomial<C>>	SquarefreeFieldCharP.recursiveUnivariateSquarefreePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial greatest squarefree divisor.
GenPolynomial<GenPolynomial<C>>	SquarefreeRingChar0.recursiveUnivariateSquarefreePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial greatest squarefree divisor.
List<GenPolynomial<GenPolynomial<C>>>	GreatestCommonDivisorSubres.recursiveUnivariateSubResultantList(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive Subresultant list.
GenPolynomial<C>	GCDProxy.resultant(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial resultant.
GenPolynomial<C>	GreatestCommonDivisor.resultant(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial resultant.
GenPolynomial<C>	GreatestCommonDivisorAbstract.resultant(GenPolynomial<C> P, GenPolynomial<C> S)	GenPolynomial resultant.
GenPolynomial<MOD>	GreatestCommonDivisorModEval.resultant(GenPolynomial<MOD> P, GenPolynomial<MOD> S)	GenPolynomial resultant, modular evaluation algorithm.
GenPolynomial<BigInteger>	GreatestCommonDivisorModular.resultant(GenPolynomial<BigInteger> P, GenPolynomial<BigInteger> S)	GenPolynomial resultant, modular algorithm.
SortedMap<GenPolynomial<C>, Long>	SquarefreeFiniteFieldCharP.rootCharacteristic(GenPolynomial<C> P)	Characteristics root of a polynomial.
GenPolynomial<AlgebraicNumber<C>>	SquarefreeInfiniteAlgebraicFieldCharP.rootCharacteristic(GenPolynomial<AlgebraicNumber<C>> P)	GenPolynomial char-th root main variable.
GenPolynomial<Quotient<C>>	SquarefreeInfiniteFieldCharP.rootCharacteristic(GenPolynomial<Quotient<C>> P)	GenPolynomial char-th root main variable.
(package private) List<GenPolynomial<BigInteger>>	FactorInteger.searchFactorsMonic(GenPolynomial<BigInteger> C, BigInteger M, List<GenPolynomial<MOD>> F, BitSet D)	Factor search with modular Hensel lifting algorithm.
(package private) List<GenPolynomial<BigInteger>>	FactorInteger.searchFactorsNonMonic(GenPolynomial<BigInteger> C, BigInteger M, List<GenPolynomial<MOD>> F, BitSet D)	Factor search with modular Hensel lifting algorithm.
SortedMap<GenPolynomial<C>, Long>	FactorAbstract.squarefreeFactors(GenPolynomial<C> P)	GenPolynomial squarefree factorization.
SortedMap<GenPolynomial<C>, Long>	Factorization.squarefreeFactors(GenPolynomial<C> P)	GenPolynomial squarefree factorization.
SortedMap<GenPolynomial<C>, Long>	Squarefree.squarefreeFactors(GenPolynomial<C> P)	GenPolynomial squarefree factorization.
abstract SortedMap<GenPolynomial<C>, Long>	SquarefreeAbstract.squarefreeFactors(GenPolynomial<C> P)	GenPolynomial squarefree factorization.
SortedMap<GenPolynomial<C>, Long>	SquarefreeFieldChar0.squarefreeFactors(GenPolynomial<C> P)	GenPolynomial squarefree factorization.
SortedMap<GenPolynomial<C>, Long>	SquarefreeFieldCharP.squarefreeFactors(GenPolynomial<C> P)	GenPolynomial squarefree factorization.
SortedMap<GenPolynomial<C>, Long>	SquarefreeRingChar0.squarefreeFactors(GenPolynomial<C> P)	GenPolynomial squarefree factorization.
GenPolynomial<C>	FactorAbstract.squarefreePart(GenPolynomial<C> P)	GenPolynomial greatest squarefree divisor.
GenPolynomial<C>	Factorization.squarefreePart(GenPolynomial<C> P)	GenPolynomial greatest squarefree divisor.
GenPolynomial<C>	Squarefree.squarefreePart(GenPolynomial<C> P)	GenPolynomial greatest squarefree divisor.
abstract GenPolynomial<C>	SquarefreeAbstract.squarefreePart(GenPolynomial<C> P)	GenPolynomial greatest squarefree divisor.
GenPolynomial<C>	SquarefreeFieldChar0.squarefreePart(GenPolynomial<C> P)	GenPolynomial greatest squarefree divisor.
GenPolynomial<C>	SquarefreeFieldCharP.squarefreePart(GenPolynomial<C> P)	GenPolynomial greatest squarefree divisor.
GenPolynomial<C>	SquarefreeRingChar0.squarefreePart(GenPolynomial<C> P)	GenPolynomial greatest squarefree divisor.
static <C extends GcdRingElem<C>> GenPolynomial<AlgebraicNumber<C>>	PolyUfdUtil.substituteConvertToAlgebraicCoefficients(GenPolynomialRing<AlgebraicNumber<C>> pfac, GenPolynomial<C> A, long k)	Convert to AlgebraicNumber coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUfdUtil.substituteFromAlgebraicCoefficients(GenPolynomialRing<GenPolynomial<C>> rfac, GenPolynomial<AlgebraicNumber<C>> A, long k)	From AlgebraicNumber coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<C>	PolyUfdUtil.substituteKronecker(GenPolynomial<C> A)	Kronecker substitution.
static <C extends GcdRingElem<C>> GenPolynomial<C>	PolyUfdUtil.substituteKronecker(GenPolynomial<C> A, long d)	Kronecker substitution.

Method parameters in edu.jas.ufd with type arguments of type GenPolynomial

Modifier and Type	Method	Description
static <C extends GcdRingElem<C>> List<GenPolynomial<C>>	PolyUfdUtil.backSubstituteKronecker(GenPolynomialRing<C> fac, List<GenPolynomial<C>> A, long d)	Kronecker back substitution.
List<GenPolynomial<C>>	GreatestCommonDivisorAbstract.basePartialFraction(GenPolynomial<C> A, List<GenPolynomial<C>> D)	Univariate GenPolynomial partial fraction decomposition.
List<List<GenPolynomial<C>>>	SquarefreeAbstract.basePartialFraction(GenPolynomial<C> A, SortedMap<GenPolynomial<C>, Long> D)	Univariate GenPolynomial partial fraction decomposition.
GenPolynomial<C>	GreatestCommonDivisorAbstract.basePartialFractionValue(GenPolynomial<C> P, int e, List<GenPolynomial<C>> F)	Test for Univariate GenPolynomial partial fraction decomposition.
List<GenPolynomial<C>>	GreatestCommonDivisorAbstract.basePrimitivePart(List<GenPolynomial<C>> F)	List of GenPolynomial base coefficient primitive part.
C	GreatestCommonDivisorAbstract.baseRecursiveContent(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial base recursive content.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.baseRecursivePrimitivePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial base recursive primitive part.
List<GenPolynomial<C>>	GreatestCommonDivisor.coPrime(List<GenPolynomial<C>> A)	GenPolynomial co-prime list.
List<GenPolynomial<C>>	GreatestCommonDivisorAbstract.coPrime(GenPolynomial<C> a, List<GenPolynomial<C>> P)	GenPolynomial co-prime list.
List<GenPolynomial<C>>	GreatestCommonDivisorAbstract.coPrime(List<GenPolynomial<C>> A)	GenPolynomial co-prime list.
List<GenPolynomial<C>>	GreatestCommonDivisorAbstract.coPrimeRec(List<GenPolynomial<C>> A)	GenPolynomial co-prime list.
List<GenPolynomial<C>>	Squarefree.coPrimeSquarefree(GenPolynomial<C> a, List<GenPolynomial<C>> P)	GenPolynomial squarefree and co-prime list.
List<GenPolynomial<C>>	Squarefree.coPrimeSquarefree(List<GenPolynomial<C>> A)	GenPolynomial squarefree and co-prime list.
List<GenPolynomial<C>>	SquarefreeAbstract.coPrimeSquarefree(GenPolynomial<C> a, List<GenPolynomial<C>> P)	GenPolynomial squarefree and co-prime list.
List<GenPolynomial<C>>	SquarefreeAbstract.coPrimeSquarefree(List<GenPolynomial<C>> A)	GenPolynomial squarefree and co-prime list.
static <C extends RingElem<C>> long	FactorInteger.degreeSum(List<GenPolynomial<C>> L)	Sum of all degrees.
long	SquarefreeAbstract.factorCount(SortedMap<GenPolynomial<C>, Long> F)	Count number of factors in a (squarefree) factorization.
long	FactorAbstract.factorsDegree(SortedMap<GenPolynomial<C>, Long> F)	Degree of a factorization.
List<GenPolynomial<C>>	FactorAbstract.factorsRadical(List<GenPolynomial<C>> L)	GenPolynomial list factorization ignoring multiplicities.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUfdUtil.fromIntegerCoefficients(GenPolynomialRing<GenPolynomial<C>> fac, GenPolynomial<GenPolynomial<BigInteger>> A)	From BigInteger coefficients.
static <C extends RingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUfdUtil.fromIntegerCoefficients(GenPolynomialRing<GenPolynomial<C>> fac, GenPolynomial<GenPolynomial<BigInteger>> A)	From BigInteger coefficients.
static <C extends RingElem<C>> List<GenPolynomial<GenPolynomial<C>>>	PolyUfdUtil.fromIntegerCoefficients(GenPolynomialRing<GenPolynomial<C>> fac, List<GenPolynomial<GenPolynomial<BigInteger>>> L)	From BigInteger coefficients.
static <C extends RingElem<C>> List<GenPolynomial<GenPolynomial<C>>>	PolyUfdUtil.fromIntegerCoefficients(GenPolynomialRing<GenPolynomial<C>> fac, List<GenPolynomial<GenPolynomial<BigInteger>>> L)	From BigInteger coefficients.
static <C extends RingElem<C>> List<GenPolynomial<GenPolynomial<C>>>	PolyUfdUtil.fromIntegerCoefficients(GenPolynomialRing<GenPolynomial<C>> fac, List<GenPolynomial<GenPolynomial<BigInteger>>> L)	From BigInteger coefficients.
GenPolynomial<C>	GreatestCommonDivisorAbstract.gcd(List<GenPolynomial<C>> A)	List of GenPolynomials greatest common divisor.
static GenPolynomial<GenPolynomial<BigInteger>>	PolyUfdUtil.integerFromRationalCoefficients(GenPolynomialRing<GenPolynomial<BigInteger>> fac, GenPolynomial<GenPolynomial<BigRational>> A)	BigInteger from BigRational coefficients.
static GenPolynomial<GenPolynomial<BigInteger>>	PolyUfdUtil.integerFromRationalCoefficients(GenPolynomialRing<GenPolynomial<BigInteger>> fac, GenPolynomial<GenPolynomial<BigRational>> A)	BigInteger from BigRational coefficients.
static List<GenPolynomial<GenPolynomial<BigInteger>>>	PolyUfdUtil.integerFromRationalCoefficients(GenPolynomialRing<GenPolynomial<BigInteger>> fac, List<GenPolynomial<GenPolynomial<BigRational>>> L)	BigInteger from BigRational coefficients.
static List<GenPolynomial<GenPolynomial<BigInteger>>>	PolyUfdUtil.integerFromRationalCoefficients(GenPolynomialRing<GenPolynomial<BigInteger>> fac, List<GenPolynomial<GenPolynomial<BigRational>>> L)	BigInteger from BigRational coefficients.
static List<GenPolynomial<GenPolynomial<BigInteger>>>	PolyUfdUtil.integerFromRationalCoefficients(GenPolynomialRing<GenPolynomial<BigInteger>> fac, List<GenPolynomial<GenPolynomial<BigRational>>> L)	BigInteger from BigRational coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUfdUtil.integralFromQuotientCoefficients(GenPolynomialRing<GenPolynomial<C>> fac, GenPolynomial<Quotient<C>> A)	Integral polynomial from rational function coefficients.
static <C extends GcdRingElem<C>> List<GenPolynomial<GenPolynomial<C>>>	PolyUfdUtil.integralFromQuotientCoefficients(GenPolynomialRing<GenPolynomial<C>> fac, Collection<GenPolynomial<Quotient<C>>> L)	Integral polynomial from rational function coefficients.
static <C extends GcdRingElem<C>> List<GenPolynomial<GenPolynomial<C>>>	PolyUfdUtil.integralFromQuotientCoefficients(GenPolynomialRing<GenPolynomial<C>> fac, Collection<GenPolynomial<Quotient<C>>> L)	Integral polynomial from rational function coefficients.
static <C extends GcdRingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUfdUtil.introduceLowerVariable(GenPolynomialRing<GenPolynomial<C>> rfac, GenPolynomial<C> A)	Introduce lower variable.
boolean	GreatestCommonDivisorAbstract.isBasePartialFraction(GenPolynomial<C> A, GenPolynomial<C> P, int e, List<GenPolynomial<C>> F)	Test for Univariate GenPolynomial partial fraction decomposition.
boolean	GreatestCommonDivisorAbstract.isBasePartialFraction(GenPolynomial<C> A, List<GenPolynomial<C>> D, List<GenPolynomial<C>> F)	Test for Univariate GenPolynomial partial fraction decomposition.
boolean	SquarefreeAbstract.isBasePartialFraction(GenPolynomial<C> A, SortedMap<GenPolynomial<C>, Long> D, List<List<GenPolynomial<C>>> F)	Test for Univariate GenPolynomial partial fraction decomposition.
boolean	SquarefreeAbstract.isBasePartialFraction(GenPolynomial<C> A, SortedMap<GenPolynomial<C>, Long> D, List<List<GenPolynomial<C>>> F)	Test for Univariate GenPolynomial partial fraction decomposition.
boolean	SquarefreeFieldCharP.isCharRoot(GenPolynomial<C> P, SortedMap<GenPolynomial<C>, Long> F)	Polynomial is char-th root.
boolean	GreatestCommonDivisor.isCoPrime(List<GenPolynomial<C>> A)	GenPolynomial test for co-prime list.
boolean	GreatestCommonDivisorAbstract.isCoPrime(List<GenPolynomial<C>> A)	GenPolynomial test for co-prime list.
boolean	GreatestCommonDivisorAbstract.isCoPrime(List<GenPolynomial<C>> P, List<GenPolynomial<C>> A)	GenPolynomial test for co-prime list of given list.
boolean	Squarefree.isCoPrimeSquarefree(List<GenPolynomial<C>> B)	Test if list of GenPolynomials is squarefree and co-prime.
boolean	SquarefreeAbstract.isCoPrimeSquarefree(List<GenPolynomial<C>> B)	Test if list of GenPolynomials is squarefree and co-prime.
static <MOD extends GcdRingElem<MOD> & Modular> boolean	HenselUtil.isDiophantLift(List<GenPolynomial<MOD>> A, List<GenPolynomial<MOD>> S, GenPolynomial<MOD> C)	Modular Diophant relation lifting test.
static <MOD extends GcdRingElem<MOD> & Modular> boolean	HenselUtil.isExtendedEuclideanLift(List<GenPolynomial<MOD>> A, List<GenPolynomial<MOD>> S)	Modular extended Euclidean relation lifting test.
boolean	FactorAbstract.isFactorization(GenPolynomial<C> P, List<GenPolynomial<C>> F)	GenPolynomial is factorization.
boolean	FactorAbstract.isFactorization(GenPolynomial<C> P, SortedMap<GenPolynomial<C>, Long> F)	GenPolynomial is factorization.
boolean	Factorization.isFactorization(GenPolynomial<C> P, List<GenPolynomial<C>> F)	GenPolynomial is factorization.
boolean	Factorization.isFactorization(GenPolynomial<C> P, SortedMap<GenPolynomial<C>, Long> F)	GenPolynomial is factorization.
boolean	Squarefree.isFactorization(GenPolynomial<C> P, List<GenPolynomial<C>> F)	GenPolynomial is (squarefree) factorization.
boolean	Squarefree.isFactorization(GenPolynomial<C> P, SortedMap<GenPolynomial<C>, Long> F)	GenPolynomial is (squarefree) factorization.
boolean	SquarefreeAbstract.isFactorization(GenPolynomial<C> P, List<GenPolynomial<C>> F)	GenPolynomial is (squarefree) factorization.
boolean	SquarefreeAbstract.isFactorization(GenPolynomial<C> P, SortedMap<GenPolynomial<C>, Long> F)	GenPolynomial is (squarefree) factorization.
static <MOD extends GcdRingElem<MOD> & Modular> boolean	HenselMultUtil.isHenselLift(GenPolynomial<BigInteger> C, GenPolynomial<MOD> Cp, List<GenPolynomial<MOD>> F, List<GenPolynomial<MOD>> L)	Modular Hensel lifting algorithm on coefficients test.
static boolean	HenselUtil.isHenselLift(GenPolynomial<BigInteger> C, BigInteger M, BigInteger p, List<GenPolynomial<BigInteger>> G)	Modular Hensel lifting test.
boolean	SquarefreeFieldCharP.isRecursiveCharRoot(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> r)	Recursive polynomial is char-th root.
boolean	SquarefreeFieldCharP.isRecursiveCharRoot(GenPolynomial<GenPolynomial<C>> P, SortedMap<GenPolynomial<GenPolynomial<C>>, Long> F)	Recursive polynomial is char-th root.
boolean	SquarefreeFieldCharP.isRecursiveCharRoot(GenPolynomial<GenPolynomial<C>> P, SortedMap<GenPolynomial<GenPolynomial<C>>, Long> F)	Recursive polynomial is char-th root.
boolean	SquarefreeFieldCharP.isRecursiveCharRoot(GenPolynomial<GenPolynomial<C>> P, SortedMap<GenPolynomial<GenPolynomial<C>>, Long> F)	Recursive polynomial is char-th root.
boolean	FactorAbstract.isRecursiveFactorization(GenPolynomial<GenPolynomial<C>> P, SortedMap<GenPolynomial<GenPolynomial<C>>, Long> F)	GenPolynomial is factorization.
boolean	FactorAbstract.isRecursiveFactorization(GenPolynomial<GenPolynomial<C>> P, SortedMap<GenPolynomial<GenPolynomial<C>>, Long> F)	GenPolynomial is factorization.
boolean	FactorAbstract.isRecursiveFactorization(GenPolynomial<GenPolynomial<C>> P, SortedMap<GenPolynomial<GenPolynomial<C>>, Long> F)	GenPolynomial is factorization.
boolean	SquarefreeAbstract.isRecursiveFactorization(GenPolynomial<GenPolynomial<C>> P, SortedMap<GenPolynomial<GenPolynomial<C>>, Long> F)	GenPolynomial is (squarefree) factorization.
boolean	SquarefreeAbstract.isRecursiveFactorization(GenPolynomial<GenPolynomial<C>> P, SortedMap<GenPolynomial<GenPolynomial<C>>, Long> F)	GenPolynomial is (squarefree) factorization.
boolean	SquarefreeAbstract.isRecursiveFactorization(GenPolynomial<GenPolynomial<C>> P, SortedMap<GenPolynomial<GenPolynomial<C>>, Long> F)	GenPolynomial is (squarefree) factorization.
boolean	SquarefreeAbstract.isRecursiveSquarefree(GenPolynomial<GenPolynomial<C>> P)	Recursive GenPolynomial test if is squarefree.
boolean	SquarefreeFieldChar0.isRecursiveUnivariateSquarefree(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial test if is squarefree.
boolean	Squarefree.isSquarefree(List<GenPolynomial<C>> L)	GenPolynomial list test if squarefree.
boolean	SquarefreeAbstract.isSquarefree(List<GenPolynomial<C>> L)	GenPolynomial list test if squarefree.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselMultUtil.liftDiophant(List<GenPolynomial<MOD>> A, GenPolynomial<MOD> C, List<MOD> V, long d, long k)	Modular diophantine equation solution and lifting algorithm.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselUtil.liftDiophant(List<GenPolynomial<MOD>> A, long e, long k)	Modular diophantine equation solution and lifting algorithm.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselUtil.liftDiophant(List<GenPolynomial<MOD>> A, GenPolynomial<MOD> C, long k)	Modular diophantine equation solution and lifting algorithm.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselUtil.liftExtendedEuclidean(List<GenPolynomial<MOD>> A, long k)	Constructing and lifting algorithm for extended Euclidean relation.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselMultUtil.liftHensel(GenPolynomial<BigInteger> C, GenPolynomial<MOD> Cp, List<GenPolynomial<MOD>> F, List<BigInteger> V, long k, List<GenPolynomial<BigInteger>> G)	Modular Hensel lifting algorithm.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselUtil.liftHensel(GenPolynomial<BigInteger> C, List<GenPolynomial<MOD>> F, long k, BigInteger g)	Modular Hensel lifting algorithm on coefficients.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselMultUtil.liftHenselFull(GenPolynomial<BigInteger> C, List<GenPolynomial<MOD>> F, List<BigInteger> V, long k, List<GenPolynomial<BigInteger>> G)	Modular Hensel full lifting algorithm.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselMultUtil.liftHenselMonic(GenPolynomial<BigInteger> C, GenPolynomial<MOD> Cp, List<GenPolynomial<MOD>> F, List<BigInteger> V, long k)	Modular Hensel lifting algorithm, monic case.
static <MOD extends GcdRingElem<MOD> & Modular> List<GenPolynomial<MOD>>	HenselUtil.liftHenselMonic(GenPolynomial<BigInteger> C, List<GenPolynomial<MOD>> F, long k)	Modular Hensel lifting algorithm on coefficients.
List<GenPolynomial<C>>	FactorAbstract.normalizeFactorization(List<GenPolynomial<C>> F)	Normalize factorization.
SortedMap<GenPolynomial<C>, Long>	SquarefreeAbstract.normalizeFactorization(SortedMap<GenPolynomial<C>, Long> F)	Normalize factorization.
static <C extends GcdRingElem<C>> GenPolynomial<Quotient<C>>	PolyUfdUtil.quotientFromIntegralCoefficients(GenPolynomialRing<Quotient<C>> fac, GenPolynomial<GenPolynomial<C>> A)	Rational function from integral polynomial coefficients.
static <C extends GcdRingElem<C>> List<GenPolynomial<Quotient<C>>>	PolyUfdUtil.quotientFromIntegralCoefficients(GenPolynomialRing<Quotient<C>> fac, Collection<GenPolynomial<GenPolynomial<C>>> L)	Rational function from integral polynomial coefficients.
static <C extends GcdRingElem<C>> List<GenPolynomial<Quotient<C>>>	PolyUfdUtil.quotientFromIntegralCoefficients(GenPolynomialRing<Quotient<C>> fac, Collection<GenPolynomial<GenPolynomial<C>>> L)	Rational function from integral polynomial coefficients.
GenPolynomial<C>	GreatestCommonDivisorAbstract.recursiveContent(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive content.
GenPolynomial<C>	GreatestCommonDivisorFake.recursiveContent(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive content.
SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	FactorAbstract.recursiveFactors(GenPolynomial<GenPolynomial<C>> P)	Recursive GenPolynomial factorization.
List<GenPolynomial<GenPolynomial<C>>>	FactorAbstract.recursiveFactorsSquarefree(GenPolynomial<GenPolynomial<C>> P)	Recursive GenPolynomial factorization of a squarefree polynomial.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.recursiveGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.recursivePrimitivePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive primitive part.
List<GenPolynomial<GenPolynomial<C>>>	GreatestCommonDivisorAbstract.recursivePrimitivePart(List<GenPolynomial<GenPolynomial<C>>> F)	List of recursive GenPolynomial base coefficient primitive part.
List<GenPolynomial<GenPolynomial<C>>>	GreatestCommonDivisorAbstract.recursivePrimitivePart(List<GenPolynomial<GenPolynomial<C>>> F)	List of recursive GenPolynomial base coefficient primitive part.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorFake.recursivePrimitivePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive primitive part.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorSubres.recursivePseudoRemainder(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Deprecated. (forRemoval=true) Use PolyUtil.recursiveDensePseudoRemainder(edu.jas.poly.GenPolynomial,edu.jas.poly.GenPolynomial) instead
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.recursiveResultant(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	GenPolynomial recursive resultant.
SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	SquarefreeAbstract.recursiveSquarefreeFactors(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive polynomial squarefree factorization.
GenPolynomial<GenPolynomial<C>>	SquarefreeAbstract.recursiveSquarefreePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive polynomial greatest squarefree divisor.
GenPolynomial<GenPolynomial<C>>	GCDProxy.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive greatest common divisor.
abstract GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorFake.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<BigInteger>>	GreatestCommonDivisorHensel.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<BigInteger>> P, GenPolynomial<GenPolynomial<BigInteger>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<MOD>>	GreatestCommonDivisorModEval.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<MOD>> P, GenPolynomial<GenPolynomial<MOD>> S)	Recursive univariate GenPolynomial greatest common divisor.
GenPolynomial<GenPolynomial<BigInteger>>	GreatestCommonDivisorModular.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<BigInteger>> P, GenPolynomial<GenPolynomial<BigInteger>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorPrimitive.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorSimple.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorSubres.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<C>>	GCDProxy.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial resultant.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorAbstract.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive resultant.
GenPolynomial<GenPolynomial<MOD>>	GreatestCommonDivisorModEval.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<MOD>> P, GenPolynomial<GenPolynomial<MOD>> S)	Univariate GenPolynomial recursive resultant.
GenPolynomial<GenPolynomial<BigInteger>>	GreatestCommonDivisorModular.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<BigInteger>> P, GenPolynomial<GenPolynomial<BigInteger>> S)	Univariate GenPolynomial recursive resultant.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorSimple.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive resultant.
GenPolynomial<GenPolynomial<C>>	GreatestCommonDivisorSubres.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive resultant.
abstract GenPolynomial<GenPolynomial<C>>	SquarefreeFieldCharP.recursiveUnivariateRootCharacteristic(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial char-th root univariate polynomial with polynomial coefficients.
GenPolynomial<GenPolynomial<C>>	SquarefreeFiniteFieldCharP.recursiveUnivariateRootCharacteristic(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial char-th root univariate polynomial with polynomial coefficients.
GenPolynomial<GenPolynomial<AlgebraicNumber<C>>>	SquarefreeInfiniteAlgebraicFieldCharP.recursiveUnivariateRootCharacteristic(GenPolynomial<GenPolynomial<AlgebraicNumber<C>>> P)	GenPolynomial char-th root univariate polynomial with polynomial coefficients.
GenPolynomial<GenPolynomial<Quotient<C>>>	SquarefreeInfiniteFieldCharP.recursiveUnivariateRootCharacteristic(GenPolynomial<GenPolynomial<Quotient<C>>> P)	GenPolynomial char-th root univariate polynomial with polynomial coefficients.
abstract SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	SquarefreeAbstract.recursiveUnivariateSquarefreeFactors(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial squarefree factorization.
SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	SquarefreeFieldChar0.recursiveUnivariateSquarefreeFactors(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial squarefree factorization.
SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	SquarefreeFieldChar0Yun.recursiveUnivariateSquarefreeFactors(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial squarefree factorization.
SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	SquarefreeFieldCharP.recursiveUnivariateSquarefreeFactors(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial squarefree factorization.
SortedMap<GenPolynomial<GenPolynomial<C>>, Long>	SquarefreeRingChar0.recursiveUnivariateSquarefreeFactors(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial squarefree factorization.
abstract GenPolynomial<GenPolynomial<C>>	SquarefreeAbstract.recursiveUnivariateSquarefreePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive polynomial greatest squarefree divisor.
GenPolynomial<GenPolynomial<C>>	SquarefreeFieldChar0.recursiveUnivariateSquarefreePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial greatest squarefree divisor.
GenPolynomial<GenPolynomial<C>>	SquarefreeFieldCharP.recursiveUnivariateSquarefreePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial greatest squarefree divisor.
GenPolynomial<GenPolynomial<C>>	SquarefreeRingChar0.recursiveUnivariateSquarefreePart(GenPolynomial<GenPolynomial<C>> P)	GenPolynomial recursive univariate polynomial greatest squarefree divisor.
List<GenPolynomial<GenPolynomial<C>>>	GreatestCommonDivisorSubres.recursiveUnivariateSubResultantList(GenPolynomial<GenPolynomial<C>> P, GenPolynomial<GenPolynomial<C>> S)	Univariate GenPolynomial recursive Subresultant list.
(package private) List<GenPolynomial<BigInteger>>	FactorInteger.searchFactorsMonic(GenPolynomial<BigInteger> C, BigInteger M, List<GenPolynomial<MOD>> F, BitSet D)	Factor search with modular Hensel lifting algorithm.
(package private) List<GenPolynomial<BigInteger>>	FactorInteger.searchFactorsNonMonic(GenPolynomial<BigInteger> C, BigInteger M, List<GenPolynomial<MOD>> F, BitSet D)	Factor search with modular Hensel lifting algorithm.
static <C extends GcdRingElem<C>> GenPolynomial<GenPolynomial<C>>	PolyUfdUtil.substituteFromAlgebraicCoefficients(GenPolynomialRing<GenPolynomial<C>> rfac, GenPolynomial<AlgebraicNumber<C>> A, long k)	From AlgebraicNumber coefficients.
static <C extends GcdRingElem<C>> List<GenPolynomial<C>>	PolyUfdUtil.substituteKronecker(List<GenPolynomial<C>> A, int d)	Kronecker substitution.

Constructors in edu.jas.ufd with parameters of type GenPolynomial

Modifier	Constructor	Description
	EvalPoints(GenPolynomial<C> p, GenPolynomial<C> u, List<C> ep)	Constructor.
	Factors(GenPolynomial<C> p)	Constructor.
	Factors(GenPolynomial<C> p, AlgebraicNumberRing<C> af, GenPolynomial<AlgebraicNumber<C>> ap, List<GenPolynomial<AlgebraicNumber<C>>> afact)	Constructor.
	Factors(GenPolynomial<C> p, AlgebraicNumberRing<C> af, GenPolynomial<AlgebraicNumber<C>> ap, List<GenPolynomial<AlgebraicNumber<C>>> afact, List<Factors<AlgebraicNumber<C>>> arfact)	Constructor.
	FactorsList(GenPolynomial<C> p, List<GenPolynomial<C>> list)	Constructor.
	FactorsList(GenPolynomial<C> p, List<GenPolynomial<C>> list, List<Factors<C>> alist)	Constructor.
	FactorsMap(GenPolynomial<C> p, SortedMap<GenPolynomial<C>, Long> map)	Constructor.
	FactorsMap(GenPolynomial<C> p, SortedMap<GenPolynomial<C>, Long> map, SortedMap<Factors<C>, Long> amap)	Constructor.
	HenselApprox(GenPolynomial<BigInteger> A, GenPolynomial<BigInteger> B, GenPolynomial<MOD> Am, GenPolynomial<MOD> Bm)	Constructor.
	PartialFraction(GenPolynomial<C> n, GenPolynomial<C> d, List<C> cf, List<GenPolynomial<C>> cd, List<AlgebraicNumber<C>> af, List<GenPolynomial<AlgebraicNumber<C>>> ad)	Constructor.
	Quotient(QuotientRing<C> r, GenPolynomial<C> n)	The constructor creates a Quotient object from a ring factory and a numerator polynomial.
	Quotient(QuotientRing<C> r, GenPolynomial<C> n, GenPolynomial<C> d)	The constructor creates a Quotient object from a ring factory and a numerator and denominator polynomial.
protected	Quotient(QuotientRing<C> r, GenPolynomial<C> n, GenPolynomial<C> d, boolean isred)	The constructor creates a Quotient object from a ring factory and a numerator and denominator polynomial.
	TrialParts(List<BigInteger> ev, GenPolynomial<BigInteger> up, List<GenPolynomial<BigInteger>> uf, List<BigInteger> le, List<GenPolynomial<BigInteger>> lf)	Constructor.

Constructor parameters in edu.jas.ufd with type arguments of type GenPolynomial

Modifier	Constructor	Description
	FactorFraction(QuotPairFactory<GenPolynomial<C>, D> fac)	Constructor.
	FactorFraction(QuotPairFactory<GenPolynomial<C>, D> fac, FactorAbstract<C> nengine)	Constructor.
	Factors(GenPolynomial<C> p, AlgebraicNumberRing<C> af, GenPolynomial<AlgebraicNumber<C>> ap, List<GenPolynomial<AlgebraicNumber<C>>> afact)	Constructor.
	Factors(GenPolynomial<C> p, AlgebraicNumberRing<C> af, GenPolynomial<AlgebraicNumber<C>> ap, List<GenPolynomial<AlgebraicNumber<C>>> afact, List<Factors<AlgebraicNumber<C>>> arfact)	Constructor.
	FactorsList(GenPolynomial<C> p, List<GenPolynomial<C>> list)	Constructor.
	FactorsList(GenPolynomial<C> p, List<GenPolynomial<C>> list, List<Factors<C>> alist)	Constructor.
	FactorsMap(GenPolynomial<C> p, SortedMap<GenPolynomial<C>, Long> map)	Constructor.
	FactorsMap(GenPolynomial<C> p, SortedMap<GenPolynomial<C>, Long> map, SortedMap<Factors<C>, Long> amap)	Constructor.

Uses of GenPolynomial in edu.jas.ufdroot

Methods in edu.jas.ufdroot that return types with arguments of type GenPolynomial

Modifier and Type	Method	Description
List<GenPolynomial<RealAlgebraicNumber<C>>>	FactorRealAlgebraic.baseFactorsSquarefree(GenPolynomial<RealAlgebraicNumber<C>> P)	GenPolynomial base factorization of a squarefree polynomial.

Methods in edu.jas.ufdroot with parameters of type GenPolynomial

Modifier and Type	Method	Description
List<GenPolynomial<RealAlgebraicNumber<C>>>	FactorRealAlgebraic.baseFactorsSquarefree(GenPolynomial<RealAlgebraicNumber<C>> P)	GenPolynomial base factorization of a squarefree polynomial.