Uses of Class
edu.jas.poly.GenPolynomialRing
Packages that use GenPolynomialRing
Package
Description
Groebner base application package.
Factorization domain package for solvable polynomial rings.
Groebner bases package.
Groebner bases using unique factorization package.
Generic coefficients polynomial package.
Generic coefficients power series package.
Real and Complex Root Computation package.
Unique factorization domain package.
-
Uses of GenPolynomialRing in edu.jas.application
Subclasses of GenPolynomialRing in edu.jas.applicationModifier and TypeClassDescriptionclass
LocalSolvablePolynomialRing<C extends GcdRingElem<C>>
LocalSolvablePolynomialRing generic recursive solvable polynomial factory implementing RingFactory and extending GenSolvablePolynomialRing factory.class
ResidueSolvablePolynomialRing<C extends GcdRingElem<C>>
ResidueSolvablePolynomialRing generic solvable polynomial with residue coefficients factory implementing RingFactory and extending GenSolvablePolynomialRing factory.class
ResidueSolvableWordPolynomialRing<C extends GcdRingElem<C>>
ResidueSolvableWordPolynomialRing solvable polynomial with word residue coefficients factory.Fields in edu.jas.application declared as GenPolynomialRingModifier and TypeFieldDescription(package private) final GenPolynomialRing
<C> CoeffToComplexReal.pfac
protected final GenPolynomialRing
<Complex<RealAlgebraicNumber<C>>> EvaluateToComplexReal.pfac
private GenPolynomialRing
RingFactoryTokenizer.pfac
final GenPolynomialRing
<C> GBAlgorithmBuilder.ring
The current polynomial ring.final GenPolynomialRing
<C> LocalRing.ring
Polynomial ring of the factory.protected final GenPolynomialRing
<GenPolynomial<C>> OrderedCPairlist.ring
final GenPolynomialRing
<C> ResidueRing.ring
Polynomial ring of the factory.Methods in edu.jas.application that return GenPolynomialRingModifier and TypeMethodDescriptionIdeal.getRing()
Get the GenPolynomialRing.RingFactoryTokenizer.nextPolynomialRing()
Parsing method for polynomial ring.RingFactoryTokenizer.nextSubModuleRing()
Parsing method for module ring.LocalRing.pairFactory()
Factory for base elements.Methods in edu.jas.application with parameters of type GenPolynomialRingModifier and TypeMethodDescription(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.Ideal.eliminate
(GenPolynomialRing<C> R) Eliminate.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.Ideal.extension
(GenPolynomialRing<C> efac) Ideal extension.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.(package private) static GroebnerBaseAbstract
RunGB.getGBalgo
(String[] args, String bstr, GenPolynomialRing ring) static <C extends GcdRingElem<C>>
FactorAbstract<C> FactorFactory.getImplementation
(GenPolynomialRing<C> fac) Determine suitable implementation of factorization algorithms, case recursive GenPolynomial<C>.Ideal.intersect
(GenPolynomialRing<C> R) Intersection.static <C extends GcdRingElem<C>>
IdealWithUniv<C> Ideal.permutation
(GenPolynomialRing<C> oring, IdealWithUniv<C> Cont) Ideal permutation.static <C extends GcdRingElem<C>>
GBAlgorithmBuilder<C> GBAlgorithmBuilder.polynomialRing
(GenPolynomialRing<C> fac) Define polynomial ring.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>>
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.Constructors in edu.jas.application with parameters of type GenPolynomialRingModifierConstructorDescriptionCondition
(GenPolynomialRing<C> ring) Condition constructor.EvaluateToComplexReal
(GenPolynomialRing<Complex<RealAlgebraicNumber<C>>> fac, Complex<RealAlgebraicNumber<C>> r) GBAlgorithmBuilder
(GenPolynomialRing<C> ring) Constructor.GBAlgorithmBuilder
(GenPolynomialRing<C> ring, GroebnerBaseAbstract<C> algo) Constructor.GBAlgorithmBuilder
(GenPolynomialRing<C> ring, GroebnerBaseAbstract<C> algo, PairList<C> strategy) Constructor.Ideal
(GenPolynomialRing<C> ring) Constructor.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.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.Constructor for OrderedPairlist.Constructor with Ring and Reader. -
Uses of GenPolynomialRing in edu.jas.fd
Subclasses of GenPolynomialRing in edu.jas.fdModifier and TypeClassDescriptionclass
QuotSolvablePolynomialRing<C extends GcdRingElem<C>>
QuotSolvablePolynomialRing generic recursive solvable polynomial factory implementing RingFactory and extending GenSolvablePolynomialRing factory. -
Uses of GenPolynomialRing in edu.jas.gb
Fields in edu.jas.gb declared as GenPolynomialRingModifier and TypeFieldDescriptionfinal GenPolynomialRing
<BigInteger> Cyclic.ring
final GenPolynomialRing
<C> ExtendedGB.ring
protected final GenPolynomialRing
<C> OrderedPairlist.ring
Methods in edu.jas.gb that return GenPolynomialRingModifier and TypeMethodDescriptionOrderedPairlist.getRing()
Get polynomial ring.PairList.getRing()
Get polynomial ring.Methods in edu.jas.gb with parameters of type GenPolynomialRingModifier and TypeMethodDescriptionCriticalPairList.create
(int m, GenPolynomialRing<C> r) Create a new PairList.CriticalPairList.create
(GenPolynomialRing<C> r) Create a new PairList.OrderedDPairlist.create
(int m, GenPolynomialRing<C> r) Create a new PairList.OrderedDPairlist.create
(GenPolynomialRing<C> r) Create a new PairList.OrderedMinPairlist.create
(int m, GenPolynomialRing<C> r) Create a new PairList.OrderedMinPairlist.create
(GenPolynomialRing<C> r) Create a new PairList.OrderedPairlist.create
(int m, GenPolynomialRing<C> r) Create a new PairList.OrderedPairlist.create
(GenPolynomialRing<C> r) Create a new PairList.OrderedSyzPairlist.create
(int m, GenPolynomialRing<C> r) Create a new PairList.OrderedSyzPairlist.create
(GenPolynomialRing<C> r) Create a new PairList.PairList.create
(int m, GenPolynomialRing<C> r) Create a new PairList.PairList.create
(GenPolynomialRing<C> r) Create a new PairList.(package private) GenPolynomial
<BigInteger> Cyclic.cyclicPoly
(GenPolynomialRing<BigInteger> ring, int n, int i) (package private) List
<GenPolynomial<BigInteger>> Cyclic.cyclicPolys
(GenPolynomialRing<BigInteger> ring) Compute list of polynomials.Constructors in edu.jas.gb with parameters of type GenPolynomialRingModifierConstructorDescriptionCriticalPairList
(int m, GenPolynomialRing<C> r) Constructor for CriticalPairList.Constructor for CriticalPairList.OrderedDPairlist
(int m, GenPolynomialRing<C> r) Constructor for OrderedDPairlist.Constructor for OrderedDPairlist.OrderedMinPairlist
(int m, GenPolynomialRing<C> r) Constructor.Constructor.OrderedPairlist
(int m, GenPolynomialRing<C> r) Constructor.Constructor.OrderedSyzPairlist
(int m, GenPolynomialRing<C> r) Constructor.Constructor. -
Uses of GenPolynomialRing in edu.jas.gbufd
Fields in edu.jas.gbufd declared as GenPolynomialRingModifier and TypeFieldDescriptionprotected final GenPolynomialRing
<C> SolvableGroebnerBasePseudoRecSeq.cofac
Coefficient ring factory.protected final GenPolynomialRing
<C> WordGroebnerBasePseudoRecSeq.cofac
Coefficient ring factory.final GenPolynomialRing
<C> MultiplicativeSet.ring
Polynomial ring factory.Methods in edu.jas.gbufd that return GenPolynomialRingModifier and TypeMethodDescription(package private) GenPolynomialRing
<C> GroebnerBaseFGLM.addIndeterminate
(GenPolynomialRing<C> ring) Internal method to add new indeterminates.(package private) GenPolynomialRing
<C> GroebnerBaseFGLM.createRingOfIndeterminates
(GenPolynomialRing<C> ring, int i) Internal method to create a polynomial ring in i indeterminates.Methods in edu.jas.gbufd with parameters of type GenPolynomialRingModifier and TypeMethodDescription(package private) GenPolynomialRing
<C> GroebnerBaseFGLM.addIndeterminate
(GenPolynomialRing<C> ring) Internal method to add new indeterminates.(package private) GenPolynomialRing
<C> GroebnerBaseFGLM.createRingOfIndeterminates
(GenPolynomialRing<C> ring, int i) Internal method to create a polynomial ring in i indeterminates.static <C extends GcdRingElem<C>>
GenPolynomial<C> PolyGBUtil.CRTInterpolation
(GenPolynomialRing<C> fac, List<List<C>> E, List<C> V) Chinese remainder theorem, interpolation.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.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.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.GroebnerBaseWalk.walkGroebnerToTarget
(int modv, List<GenPolynomial<C>> Gl, GenPolynomialRing<C> ufac) Converts Groebner bases w.r.t.Constructors in edu.jas.gbufd with parameters of type GenPolynomialRingModifierConstructorDescriptionMultiplicativeSet
(GenPolynomialRing<C> ring) MultiplicativeSet constructor.protected
MultiplicativeSet
(GenPolynomialRing<C> ring, List<GenPolynomial<C>> ms) MultiplicativeSet constructor.MultiplicativeSet constructor.protected
MultiplicativeSetCoPrime
(GenPolynomialRing<C> ring, List<GenPolynomial<C>> ms, GreatestCommonDivisorAbstract<C> eng) MultiplicativeSet constructor.MultiplicativeSet constructor.protected
MultiplicativeSetFactors
(GenPolynomialRing<C> ring, List<GenPolynomial<C>> ms, FactorAbstract<C> eng) MultiplicativeSet constructor.MultiplicativeSet constructor.protected
MultiplicativeSetSquarefree
(GenPolynomialRing<C> ring, List<GenPolynomial<C>> ms, SquarefreeAbstract<C> eng) MultiplicativeSet constructor.OrderedRPairlist
(int m, GenPolynomialRing<C> r) Constructor for OrderedRPairlist.Constructor for OrderedRPairlist. -
Uses of GenPolynomialRing in edu.jas.poly
Subclasses of GenPolynomialRing in edu.jas.polyModifier and TypeClassDescriptionclass
GenSolvablePolynomialRing<C extends RingElem<C>>
GenSolvablePolynomialRing generic solvable polynomial factory implementing RingFactory and extending GenPolynomialRing factory.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.class
RecSolvablePolynomialRing<C extends RingElem<C>>
RecSolvablePolynomialRing generic recursive solvable polynomial factory implementing RingFactory and extending GenSolvablePolynomialRing factory.class
RecSolvableWordPolynomialRing<C extends RingElem<C>>
RecSolvableWordPolynomialRing generic recursive solvable polynomial factory implementing RingFactory and extending GenSolvablePolynomialRing factory.Fields in edu.jas.poly declared as GenPolynomialRingModifier and TypeFieldDescription(package private) final GenPolynomialRing
<C> EvalMainPol.cfac
(package private) GenPolynomialRing
<GenPolynomial<C>> DistToRec.fac
(package private) GenPolynomialRing
<C> RecToDist.fac
private GenPolynomialRing
GenPolynomialTokenizer.pfac
final GenPolynomialRing
<C> AlgebraicNumberRing.ring
Ring part of the factory data structure.(package private) GenPolynomialRing
<D> FromIntegerPoly.ring
final GenPolynomialRing
<C> GenPolynomial.ring
The factory for the polynomial ring.(package private) final GenPolynomialRing
<C> GenPolynomialIterator.ring
data structure.(package private) final GenPolynomialRing
<C> GenPolynomialMonomialIterator.ring
data structure.final GenPolynomialRing
<C> ModuleList.ring
The factory for the solvable polynomial ring.final GenPolynomialRing
<C> PolynomialList.ring
The factory for the solvable polynomial ring.(package private) GenPolynomialRing
<BigInteger> RatToIntPoly.ring
Methods in edu.jas.poly that return GenPolynomialRingModifier and TypeMethodDescriptionGenPolynomialRing.contract
(int i) Contract variables.GenPolynomialRing.copy()
Copy this factory.GenPolynomialRing.distribute()
Distributive representation as polynomial with all main variables.GenPolynomialRing.extend
(int i) Extend variables.GenPolynomialRing.extend
(int i, boolean top) Extend variables.Extend variables.Extend variables.GenPolynomialRing.extendLower
(int i) Extend lower variables.GenPolynomialRing.extendLower
(String[] vn) Extend lower variables.GenPolynomialRing.extendLower
(String[] vn, boolean top) Extend lower variables.GenPolynomial.factory()
Get the corresponding element factory.GenPolynomialRing.permutation
(List<Integer> P) Permutation of polynomial ring variables.GenSolvablePolynomialRing.permutation
(List<Integer> P) Permutation of polynomial ring variables.static <C extends RingElem<C>>
GenPolynomialRing<C> TermOrderOptimization.permutation
(List<Integer> P, GenPolynomialRing<C> R) Permutation of polynomial ring variables.GenPolynomialRing.recursive
(int i) Recursive representation as polynomial with i main variables.GenPolynomialRing.reverse()
Reverse variables.GenPolynomialRing.reverse
(boolean partial) Reverse variables.Methods in edu.jas.poly with parameters of type GenPolynomialRingModifier and TypeMethodDescriptionstatic <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> & 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> & 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.GenPolynomial.contract
(GenPolynomialRing<C> pfac) Contract variables.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.static <C extends RingElem<C> & Rational>
GenPolynomial<BigDecimal> PolyUtil.decimalFromRational
(GenPolynomialRing<BigDecimal> fac, GenPolynomial<C> A) Convert to decimal coefficients.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.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>>
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>>
List<GenPolynomial<C>> PolyUtil.evaluateMain
(GenPolynomialRing<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.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.extendLower
(GenPolynomialRing<C> pfac, int j, long k) Extend lower variables.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.static <C extends RingElem<C>>
GenPolynomial<C> PolyUtil.fromIntegerCoefficients
(GenPolynomialRing<C> fac, GenPolynomial<BigInteger> A) From BigInteger coefficients.static <C extends RingElem<C>>
List<GenPolynomial<C>> PolyUtil.fromIntegerCoefficients
(GenPolynomialRing<C> fac, List<GenPolynomial<BigInteger>> L) From BigInteger coefficients.ModuleList.getPolynomialList
(GenPolynomialRing<C> pfac) Get PolynomialList.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.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>
List<GenPolynomial<BigInteger>> PolyUtil.integerFromModularCoefficients
(GenPolynomialRing<BigInteger> fac, List<GenPolynomial<C>> L) 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 List
<GenPolynomial<BigInteger>> PolyUtil.integerFromRationalCoefficients
(GenPolynomialRing<BigInteger> fac, List<GenPolynomial<BigRational>> L) 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>>
List<GenPolynomial<C>> PolyUtil.intersect
(GenPolynomialRing<C> R, List<GenPolynomial<C>> F) Intersection.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.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>>
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>>
GenPolynomialRing<C> TermOrderOptimization.permutation
(List<Integer> P, GenPolynomialRing<C> R) Permutation of polynomial ring variables.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>>
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 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<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.GenPolynomial.reverse
(GenPolynomialRing<C> oring) Reverse variables.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>>
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 List
<GenPolynomial<Product<ModInteger>>> PolyUtil.toProduct
(GenPolynomialRing<Product<ModInteger>> pfac, List<GenPolynomial<BigInteger>> L) Product representation.static <C extends GcdRingElem<C>>
GenPolynomial<Product<C>> PolyUtil.toProductGen
(GenPolynomialRing<Product<C>> pfac, GenPolynomial<C> A) 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.Constructors in edu.jas.poly with parameters of type GenPolynomialRingModifierConstructorDescriptionDistToRec
(GenPolynomialRing<GenPolynomial<C>> fac) EvalMainPol
(GenPolynomialRing<C> cfac, C a) FromIntegerPoly
(GenPolynomialRing<D> ring) The constructor creates a polynomial factory object.Constructor for zero GenPolynomial.GenPolynomial
(GenPolynomialRing<C> r, C c) Constructor for GenPolynomial c * x0.GenPolynomial
(GenPolynomialRing<C> r, C c, ExpVector e) Constructor for GenPolynomial c * xe.GenPolynomial
(GenPolynomialRing<C> r, ExpVector e) Constructor for GenPolynomial xe.protected
GenPolynomial
(GenPolynomialRing<C> r, Map<ExpVector, C> v) Constructor for GenPolynomial.protected
GenPolynomial
(GenPolynomialRing<C> r, SortedMap<ExpVector, C> v) Constructor for GenPolynomial.private
GenPolynomial
(GenPolynomialRing<C> r, TreeMap<ExpVector, C> t) Private constructor for GenPolynomial.Polynomial iterator constructor.Polynomial iterator constructor.GenPolynomialRing
(GenPolynomialRing<C> o, TermOrder to) The constructor creates a polynomial factory object with the the same coefficient factory, number of variables and variable names as the given polynomial factory, only the term order differs.The constructor creates a 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.Constructor with Ring and Reader.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.The constructor creates a polynomial factory object.ModuleList
(GenPolynomialRing<C> r, List<List<GenPolynomial<C>>> l) Constructor.OptimizedModuleList
(List<Integer> P, GenPolynomialRing<C> R, List<List<GenPolynomial<C>>> L) Constructor.OptimizedPolynomialList
(List<Integer> P, GenPolynomialRing<C> R, List<GenPolynomial<C>> L) Constructor.OrderedModuleList
(GenPolynomialRing<C> r, List<List<GenPolynomial<C>>> l) Constructor.Constructor.PolynomialList
(GenPolynomialRing<C> r, List<GenPolynomial<C>> l) Constructor.RecToDist
(GenPolynomialRing<C> fac) -
Uses of GenPolynomialRing in edu.jas.ps
Fields in edu.jas.ps declared as GenPolynomialRingModifier and TypeFieldDescriptionfinal GenPolynomialRing
<C> MultiVarCoefficients.pfac
Ring factory for polynomials.Methods in edu.jas.ps that return GenPolynomialRingModifier and TypeMethodDescriptionMultiVarPowerSeriesRing.polyRing()
Get the corresponding GenPolynomialRing<C>.UnivPowerSeriesRing.polyRing()
Get the corresponding GenPolynomialRing<C>.Constructors in edu.jas.ps with parameters of type GenPolynomialRingModifierConstructorDescriptionPublic constructor.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.Constructor.Constructor. -
Uses of GenPolynomialRing in edu.jas.root
Fields in edu.jas.root declared as GenPolynomialRingModifier and TypeFieldDescription(package private) GenPolynomialRing
<C> Boundary.rfac
Factory for real polynomials.Methods in edu.jas.root with parameters of type GenPolynomialRingModifier and TypeMethodDescriptionstatic <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<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>
GenPolynomial<RealAlgebraicNumber<C>> PolyUtilRoot.realFromAlgebraicCoefficients
(GenPolynomialRing<RealAlgebraicNumber<C>> rfac, GenPolynomial<AlgebraicNumber<C>> A) Convert to RealAlgebraicNumber coefficients. -
Uses of GenPolynomialRing in edu.jas.ufd
Fields in edu.jas.ufd declared as GenPolynomialRingModifier and TypeFieldDescription(package private) final GenPolynomialRing
<C> BackSubstKronecker.fac
final GenPolynomialRing
<C> QuotientRing.ring
Polynomial ring of the factory.Methods in edu.jas.ufd that return GenPolynomialRingMethods in edu.jas.ufd with parameters of type GenPolynomialRingModifier and TypeMethodDescriptionstatic <C extends GcdRingElem<C>>
AlgebraicNumberRing<C> PolyUfdUtil.algebraicNumberField
(GenPolynomialRing<C> ring, int degree) Construct an algebraic number field of degree d.static <C extends GcdRingElem<C>>
GenPolynomial<C> PolyUfdUtil.backSubstituteKronecker
(GenPolynomialRing<C> fac, GenPolynomial<C> A, long d) Kronecker back substitution.static <C extends GcdRingElem<C>>
List<GenPolynomial<C>> PolyUfdUtil.backSubstituteKronecker
(GenPolynomialRing<C> fac, List<GenPolynomial<C>> A, long d) Kronecker back substitution.static List
<GenPolynomial<BigInteger>> CycloUtil.cyclotomicDecompose
(GenPolynomialRing<BigInteger> ring, long n) Compute the factors of the n-th cyclotomic polynomial.static GenPolynomial
<BigInteger> CycloUtil.cyclotomicPolynomial
(GenPolynomialRing<BigInteger> ring, long n) Compute n-th cyclotomic polynomial.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 GcdRingElem<C>>
FactorAbstract<C> FactorFactory.getImplementation
(GenPolynomialRing<C> fac) Determine suitable implementation of factorization algorithms, case recursive GenPolynomial<C>.static <C extends GcdRingElem<C>>
SquarefreeAbstract<C> SquarefreeFactory.getImplementation
(GenPolynomialRing<C> fac) Determine suitable implementation of squarefree factorization algorithms, case GenPolynomial<C>.protected static <C extends GcdRingElem<C>>
SquarefreeAbstract<C> SquarefreeFactory.getImplementationPoly
(GenPolynomialRing<C> fac) 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 <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>>
GenPolynomial<GenPolynomial<C>> PolyUfdUtil.introduceLowerVariable
(GenPolynomialRing<GenPolynomial<C>> rfac, GenPolynomial<C> A) Introduce lower variable.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>>
GenPolynomial<C> PolyUfdUtil.randomIrreduciblePolynomial
(GenPolynomialRing<C> ring, int degree) Construct a random irreducible univariate polynomial of degree d.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.Constructors in edu.jas.ufd with parameters of type GenPolynomialRingModifierConstructorDescriptionBackSubstKronecker
(GenPolynomialRing<C> fac, long d) The constructor creates a QuotientRing object from a GenPolynomialRing.QuotientRing
(GenPolynomialRing<C> r, boolean ufdGCD) The constructor creates a QuotientRing object from a GenPolynomialRing.