| Class | Description |
|---|---|
| AlgebraicRootsPrimElem<C extends GcdRingElem<C> & Rational> |
Container for the real and complex algebraic roots of a univariate
polynomial together with primitive element.
|
| CGBSeqTest |
Comprehenssive Groebner base sequential tests with JUnit.
|
| ColoredSystem<C extends GcdRingElem<C>> |
Container for a condition, a corresponding colored polynomial list and a
Groebner base pair list.
|
| ColorPolynomial<C extends RingElem<C>> |
Colored Polynomials with green, red and white coefficients.
|
| ComplexRootTest |
RootUtil tests with JUnit.
|
| ComprehensiveGroebnerBaseSeq<C extends GcdRingElem<C>> |
Comprehensive Groebner Base sequential algorithm.
|
| Condition<C extends GcdRingElem<C>> |
Condition.
|
| CPair<C extends RingElem<C>> |
Serializable subclass to hold pairs of colored polynomials.
|
| CReductionSeq<C extends GcdRingElem<C>> |
Polynomial parametric ring reduction sequential use algorithm.
|
| Dimension |
Container for dimension parameters.
|
| Examples |
Examples for application usage.
|
| ExamplesGeoTheorems |
ExamplesGeoTheorems for Groebner base usage.
|
| ExtensionFieldBuilder |
Builder for extension field towers.
|
| ExtensionFieldBuilderTest |
ExtensionFieldBuilder tests with JUnit.
|
| FactorAlgebraicPrim<C extends GcdRingElem<C>> |
Algebraic number coefficients factorization algorithms.
|
| FactorAlgebraicPrimTest |
Factor algebraic tests with JUnit.
|
| FactorFactory |
Factorization algorithms factory.
|
| FactorRealReal<C extends GcdRingElem<C> & Rational> |
Real algebraic number coefficients factorization algorithms.
|
| FactorRealRealTest |
Factor real algebraic tests with JUnit.
|
| FactorTest |
Factor tests with JUnit.
|
| GBAlgorithmBuilder<C extends GcdRingElem<C>> |
Builder for commutative Gröbner bases algorithm implementations.
|
| GBAlgorithmBuilderTest |
GBAlgorithmBuilder tests with JUnit.
|
| GroebnerSystem<C extends GcdRingElem<C>> |
Container for a Groebner system.
|
| HenselMultUtilTest |
HenselMultUtil tests with JUnit.
|
| Ideal<C extends GcdRingElem<C>> |
Ideal implements some methods for ideal arithmetic, for example intersection,
quotient and zero and positive dimensional ideal decomposition.
|
| IdealTest |
Ideal tests with JUnit.
|
| IdealWithComplexAlgebraicRoots<D extends GcdRingElem<D> & Rational> |
Container for Ideals together with univariate polynomials and complex
algebraic roots.
|
| IdealWithRealAlgebraicRoots<D extends GcdRingElem<D> & Rational> |
Container for Ideals together with univariate polynomials and real algebraic
roots.
|
| IdealWithRealRoots<C extends GcdRingElem<C>> |
Container for Ideals together with univariate polynomials and real roots.
|
| IdealWithUniv<C extends GcdRingElem<C>> |
Container for Ideals together with univariate polynomials.
|
| IntegerProgram |
Solution of Integer Programming problems using Groebner bases.
|
| IntegerProgramExamples |
Examples for Integer Programming.
|
| Local<C extends GcdRingElem<C>> |
Local ring element based on GenPolynomial with RingElem interface.
|
| LocalResidueSolvablePolynomialQLRTest |
BigRational coefficients LocalResidueSolvablePolynomial QLR representation
tests with JUnit.
|
| LocalRing<C extends GcdRingElem<C>> |
Local ring class based on GenPolynomial with RingElem interface.
|
| LocalSolvablePolynomial<C extends GcdRingElem<C>> |
LocalSolvablePolynomial generic recursive solvable polynomials implementing
RingElem. n-variate ordered solvable polynomials over solvable polynomial
coefficients.
|
| LocalSolvablePolynomialQLRTest |
BigRational coefficients LocalSolvablePolynomial QLR representation tests
with JUnit.
|
| LocalSolvablePolynomialRing<C extends GcdRingElem<C>> |
LocalSolvablePolynomialRing generic recursive solvable polynomial factory
implementing RingFactory and extending GenSolvablePolynomialRing factory.
|
| LocalSolvablePolynomialTest |
BigRational coefficients LocalSolvablePolynomial tests with JUnit.
|
| LocalTest |
Local tests with JUnit.
|
| OrderedCPairlist<C extends GcdRingElem<C>> |
Pair list management.
|
| PolyUtilApp<C extends RingElem<C>> |
Polynomial utilities for applications, for example conversion ExpVector to
Product or zero dimensional ideal root computation.
|
| PolyUtilAppTest |
PolyUtilApp tests with JUnit.
|
| PrimaryComponent<C extends GcdRingElem<C>> |
Container for primary components of ideals.
|
| PrimitiveElement<C extends GcdRingElem<C>> |
Container for primitive elements.
|
| QuotientSolvablePolynomialQLRTest |
BigRational coefficients QuotientSolvablePolynomial QLR representation tests
with JUnit.
|
| RealAlgebraicNumber<C extends GcdRingElem<C> & Rational> |
Complex algebraic number class based on bi-variate real algebraic numbers.
|
| RealAlgebraicRing<C extends GcdRingElem<C> & Rational> |
Real algebraic number factory class based on bi-variate real algebraic
numbers.
|
| RealAlgebraicTest |
RealAlgebraicNumber Test using JUnit.
|
| ReductionTest |
Reduction tests with JUnit.
|
| Residue<C extends GcdRingElem<C>> |
Residue ring element based on GenPolynomial with RingElem interface.
|
| ResidueRing<C extends GcdRingElem<C>> |
Residue ring factory based on GenPolynomial with RingFactory interface.
|
| ResidueSolvablePolynomial<C extends GcdRingElem<C>> |
ResidueSolvablePolynomial generic solvable polynomials with solvable residue
coefficients implementing RingElem. n-variate ordered solvable polynomials
over solvable residue coefficients.
|
| ResidueSolvablePolynomialQLRTest |
BigRational coefficients ResidueSolvablePolynomial QLR representation tests
with JUnit.
|
| ResidueSolvablePolynomialRing<C extends GcdRingElem<C>> |
ResidueSolvablePolynomialRing generic solvable polynomial with residue
coefficients factory implementing RingFactory and extending
GenSolvablePolynomialRing factory.
|
| ResidueSolvablePolynomialTest |
BigRational coefficients ResidueSolvablePolynomial tests with JUnit.
|
| ResidueSolvableWordPolynomial<C extends GcdRingElem<C>> |
ResidueSolvableWordPolynomial solvable polynomials with WordResidue
coefficients implementing RingElem. n-variate ordered solvable polynomials
over non-commutative word residue coefficients.
|
| ResidueSolvableWordPolynomialRing<C extends GcdRingElem<C>> |
ResidueSolvableWordPolynomialRing solvable polynomial with word residue
coefficients factory.
|
| ResidueSolvableWordPolynomialTest |
BigRational coefficients ResidueSolvableWordPolynomial tests with JUnit.
|
| ResidueTest |
Residue tests with JUnit.
|
| RingFactoryTokenizer |
RingFactory Tokenizer.
|
| RootFactoryApp |
Roots factory.
|
| RunGB |
Simple setup to run a GB example.
|
| RunSGB |
Simple setup to run a solvable GB example.
|
| SolvableIdeal<C extends GcdRingElem<C>> |
Solvable Ideal implements some methods for ideal arithmetic, for example sum,
intersection, quotient.
|
| SolvableIdealTest |
SolvableIdeal tests with JUnit.
|
| SolvableLocal<C extends GcdRingElem<C>> |
SolvableLocal ring element based on pairs of GenSolvablePolynomial with
GcdRingElem interface.
|
| SolvableLocalResidue<C extends GcdRingElem<C>> |
SolvableLocalResidue, that is a (left) rational function, based on pairs of
GenSolvablePolynomial with GcdRingElem interface.
|
| SolvableLocalResidueRing<C extends GcdRingElem<C>> |
SolvableLocalResidue ring factory for SolvableLocalResidue based on
GenSolvablePolynomial with GcdRingElem interface.
|
| SolvableLocalResidueTest |
SolvableLocalResidue over BigRational GenSolvablePolynomial tests with JUnit.
|
| SolvableLocalRing<C extends GcdRingElem<C>> |
SolvableLocal ring factory for SolvableLocal with GcdRingElem interface.
|
| SolvableLocalTest |
SolvableLocal over BigRational GenSolvablePolynomial tests with JUnit.
|
| SolvableResidue<C extends GcdRingElem<C>> |
SolvableResidue ring element based on GenSolvablePolynomial with GcdRingElem
interface.
|
| SolvableResidueRing<C extends GcdRingElem<C>> |
SolvableResidue ring factory based on GenSolvablePolynomialRing with
GcdRingFactory interface.
|
| SolvableResidueTest |
SolvableResidue tests with JUnit.
|
| WordIdeal<C extends GcdRingElem<C>> |
Word Ideal implements some methods for ideal arithmetic, for example
containment, sum or product.
|
| WordIdealTest |
WordIdeal tests with JUnit.
|
| WordResidue<C extends GcdRingElem<C>> |
WordResidue ring element based on GenWordPolynomial with GcdRingElem
interface.
|
| WordResidueRing<C extends GcdRingElem<C>> |
WordResidue ring factory based on GenWordPolynomialRing with GcdRingFactory
interface.
|
| WordResidueTest |
WordResidue tests with JUnit.
|
| Enum | Description |
|---|---|
| Condition.Color |
Colors.
|
| SolvableIdeal.Side |
Side variant of ideal.
|
This package contains classes with applications of Groebner bases
such as ideal intersections, ideal quotients or ideal dimension are
implemented in Ideal and SolvableIdeal.
Class Residue provides polynomials residues modulo an
ideal defined in ResidueRing. Comprehensive Groebner
bases for polynomial rings over parameter rings are implemented in
ComprehensiveGroebnerBaseSeq.
Method rootReduce() from class RootFactoryApp
computes a primitive element of two algebraic roots.
Last modified: Wed Aug 17 23:35:02 CEST 2016
$Id: package.html 5590 2016-08-17 21:36:43Z kredel $