All Classes
| Class | Description |
|---|---|
| AlgebraicNumberField<E extends IUnivariatePolynomial<E>> |
Algebraic number field
F(α) represented as a simple field extension, for details see SimpleFieldExtension. |
| AMonomial<Term extends AMonomial<Term>> |
Abstract monomial (degree vector + coefficient).
|
| AMultivariatePolynomial<Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
Parent class for multivariate polynomials.
|
| AMultivariatePolynomial.PolynomialCollector<Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
Collector which collects stream of element to a UnivariatePolynomial
|
| ARing<E> |
Abstract ring which holds perfect power decomposition of its cardinality.
|
| ArraysUtil |
This class contains additional methods for manipulating arrays (such as sorting and searching).
|
| BigDecimal |
Immutable, arbitrary-precision signed decimal numbers.
|
| BigInteger |
Immutable arbitrary-precision integers.
|
| BigIntegerUtil | |
| BigPrimes |
Prime factorization of BigIntegers
|
| ChineseRemainders | |
| ChineseRemainders.ChineseRemaindersMagic<E> |
Magic data to make CRT faster via precomputing Bezout coefficients
|
| ChineseRemainders.ChineseRemaindersMagicZp64 | |
| Coder<Element,Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
High-level parser and stringifier of ring elements.
|
| DegreeVector |
Degree vector.
|
| DiophantineEquations | |
| DiophantineEquations.DiophantineSolver<Poly extends IUnivariatePolynomial<Poly>> |
Solves a1 * x1 + a2 * x2 + ...
|
| DistinctDegreeFactorization |
Distinct-degree factorization of univariate polynomials over finite fields.
|
| EqualDegreeFactorization |
Equal-degree factorization of univariate polynomials over finite fields.
|
| FactorDecomposition<E> |
Factor decomposition of element.
|
| FiniteField<E extends IUnivariatePolynomial<E>> |
Galois field
GF(p, q). |
| GroebnerBases |
Groebner bases.
|
| GroebnerBases.HilbertSeries |
Hilbert-Poincare series HPS(t) = P(t) / (1 - t)^m
|
| GroebnerBases.MinimizationStrategy |
Strategy used to reduce and minimize basis in the intermediate steps of Buchberger algorithm
|
| GroebnerBases.SyzygyPair<Term extends AMonomial<Term>,Poly extends cc.redberry.rings.poly.multivar.MonomialSetView<Term>> |
Abstract critical pair: used with different Poly type for Buchberger and F4 algorithms
|
| GroebnerBasesData |
Collection of special ideals
|
| GroebnerMethods |
Utility methods based on Groebner bases
|
| HenselLifting |
Hensel lifting.
|
| HenselLifting |
Methods for univariate Hensel lifting.
|
| HenselLifting.bLinearLift |
Linear Hensel lift for BigIntegers arithmetics.
|
| HenselLifting.bQuadraticLift |
Quadratic Hensel lift for BigIntegers arithmetics.
|
| HenselLifting.LiftableQuintet<PolyZp extends IUnivariatePolynomial<PolyZp>> |
Liftable quintet.
|
| HenselLifting.lLinearLift |
Linear Hensel lift for machine word arithmetics.
|
| HenselLifting.lQuadraticLift |
Quadratic Hensel lift for machine word arithmetics.
|
| Ideal<Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
Ideal represented by its Groebner basis.
|
| ImageRing<F,I> |
A ring obtained via isomorphism specified by
ImageRing.image(Object) and ImageRing.inverse(Object) functions. |
| IMonomialAlgebra<Term extends AMonomial<Term>> |
Algebraic operations (multiplication, division) and utility methods for monomials.
|
| IMonomialAlgebra.MonomialAlgebra<E> |
Generic term algebra
|
| IMonomialAlgebra.MonomialAlgebraZp64 |
Term algebra for terms over Zp
|
| IntComparator | |
| Integers |
The ring of integers (Z).
|
| IntegersZp |
Ring of integers modulo some
modulus. |
| IntegersZp64 |
Zp ring over machine numbers which provides fast modular arithmetic.
|
| IParser<Element> |
Defines
IParser.parse(String) method |
| IPolynomial<Poly extends IPolynomial<Poly>> |
Parent interface for all polynomials.
|
| IPolynomialRing<Poly extends IPolynomial<Poly>> |
Polynomial ring.
|
| IrreduciblePolynomials |
Irreducibility tests and generators for random irreducible polynomials.
|
| IStringifier<Element> |
Defines #stringify(Stringifiable) method
|
| IStringifier.SimpleStringifier<E> |
Simple map-based stringifier
|
| IUnivariatePolynomial<Poly extends IUnivariatePolynomial<Poly>> |
Parent interface for univariate polynomials.
|
| LinearSolver |
Solver for quadratic linear system
|
| LinearSolver.SystemInfo |
Info about linear system
|
| ListWrapper<Poly> |
A simple list wrapper
|
| MachineArithmetic |
Helper methods for arithmetic with machine numbers.
|
| MathContext |
Immutable objects which encapsulate the context settings which
describe certain rules for numerical operators, such as those
implemented by the
BigDecimal class. |
| ModularComposition |
Univariate polynomial modular composition.
|
| Monomial<E> |
Monomial with coefficient from generic ring
|
| MonomialOrder |
Common monomial orderings.
|
| MonomialOrder.EliminationOrder | |
| MonomialOrder.GrevLexWithPermutation | |
| MonomialSet<Term extends AMonomial<Term>> |
Sorted set of monomials -- basic underlying data structure of multivariate polynomials.
|
| MonomialZp64 |
Monomial with coefficient from Zp with p < 2^64
|
| MultipleFieldExtension<Term extends AMonomial<Term>,mPoly extends AMultivariatePolynomial<Term,mPoly>,sPoly extends IUnivariatePolynomial<sPoly>> |
Multiple field extension
F(α_1, α_2, ..., α_N). |
| MultivariateConversions | |
| MultivariateDivision |
Division with remainder of multivariate polynomials (multivariate reduction).
|
| MultivariateFactorization |
Factorization of multivariate polynomials.
|
| MultivariateGCD |
Multivariate polynomial GCD
|
| MultivariateInterpolation |
Multivariate interpolation
|
| MultivariateInterpolation.Interpolation<E> |
Updatable Newton interpolation
|
| MultivariateInterpolation.InterpolationZp64 |
Updatable Newton interpolation
|
| MultivariatePolynomial<E> | |
| MultivariatePolynomial.HornerForm<E> |
A representation of multivariate polynomial specifically optimized for fast evaluation of given variables
|
| MultivariatePolynomial.PrecomputedPowersHolder<E> |
holds an array of precomputed powers
|
| MultivariatePolynomialZp64 |
Multivariate polynomial over Zp ring with the modulus in the range (0, 2^62) (see
MachineArithmetic.MAX_SUPPORTED_MODULUS). |
| MultivariatePolynomialZp64.HornerFormZp64 |
A representation of multivariate polynomial specifically optimized for fast evaluation of given variables
|
| MultivariatePolynomialZp64.lPrecomputedPowers |
cached powers used to save some time
|
| MultivariatePolynomialZp64.lPrecomputedPowersHolder |
holds an array of precomputed powers
|
| MultivariateResultants |
Polynomial resultants.
|
| MultivariateRing<Poly extends AMultivariatePolynomial<?,Poly>> |
Ring of multivariate polynomials.
|
| MultivariateSquareFreeFactorization | |
| PairedIterator<Term1 extends AMonomial<Term1>,Poly1 extends AMultivariatePolynomial<Term1,Poly1>,Term2 extends AMonomial<Term2>,Poly2 extends AMultivariatePolynomial<Term2,Poly2>> |
Iterator over a pair of polynomials
|
| PolynomialFactorDecomposition<Poly extends IPolynomial<Poly>> |
Factor decomposition of element.
|
| PolynomialMethods |
High-level methods for polynomials.
|
| PrimesIterator |
Iterator over prime numbers.
|
| QuotientRing<Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> |
Multivariate quotient ring
|
| RandomDataGenerator | |
| RandomMultivariatePolynomials |
Methods to generate random multivariate polynomials.
|
| RandomUnivariatePolynomials |
Methods to generate random polynomials.
|
| RandomUtil | |
| Rational<E> | |
| RationalReconstruction | |
| Rationals<E> |
The ring of rationals (Q).
|
| Ring<E> |
Ring of elements.
|
| Rings |
Common rings.
|
| RoundingMode |
Specifies a rounding behavior for numerical operations
capable of discarding precision.
|
| SerializableFunction<T,R> | |
| SieveOfAtkin |
Plain sieve of Atkin implementation based on this stackoverflow
answer
|
| SimpleFieldExtension<E extends IUnivariatePolynomial<E>> |
A simple field extension
F(α) represented as a univariate quotient ring F[x]/<m(x)> where
m(x) is the minimal polynomial of α. |
| SmallPrimes |
Prime factorization of 32-bit integers.
|
| StringBindings<E> | |
| Stringifiable<E> |
Elements that could be stringified with the help of IStringifier
|
| TimeConstrained | |
| TimeUnits | |
| Tokenizer |
Simple math expression tokenizer
|
| Tokenizer.CharacterStream |
Stream of chars.
|
| Tokenizer.Token |
Simple token
|
| Tokenizer.TokenType |
token type
|
| UnivariateDivision |
Division with remainder of univariate polynomials.
|
| UnivariateDivision.InverseModMonomial<Poly extends IUnivariatePolynomial<Poly>> |
Holds
poly^(-1) mod x^i |
| UnivariateFactorization |
Factorization of univariate polynomials.
|
| UnivariateGCD |
Univariate polynomial GCD.
|
| UnivariateInterpolation |
Univariate polynomial interpolation.
|
| UnivariateInterpolation.Interpolation<E> |
Updatable Newton interpolation
|
| UnivariateInterpolation.InterpolationZp64 |
Updatable Newton interpolation
|
| UnivariatePolynomial<E> |
Univariate polynomial over generic ring.
|
| UnivariatePolynomial.PolynomialCollector<E> |
Collector which collects stream of element to a UnivariatePolynomial
|
| UnivariatePolynomialArithmetic |
Helper methods for univariate polynomial arithmetic.
|
| UnivariatePolynomialZ64 |
Univariate polynomial over machine integers in range [-2^63, 2^63].
|
| UnivariatePolynomialZp64 |
Univariate polynomial over Zp ring with modulus in the range of
[2, 2^62) (the last value is specified by
MachineArithmetic.MAX_SUPPORTED_MODULUS_BITS. |
| UnivariateResultants |
Various algorithms to compute (sub)resultants via Euclidean algorithm.
|
| UnivariateResultants.APolynomialRemainderSequence<Poly extends IUnivariatePolynomial<Poly>> |
Polynomial remainder sequence (PRS).
|
| UnivariateResultants.PolynomialRemainderSequence<E> |
Polynomial remainder sequence (PRS).
|
| UnivariateResultants.PolynomialRemainderSequenceZp64 |
Classical division rule for polynomials over Zp
|
| UnivariateRing<Poly extends IUnivariatePolynomial<Poly>> |
Ring of univariate polynomials.
|
| UnivariateSquareFreeFactorization |
Square-free factorization of univariate polynomials over Z and Zp.
|
| Util | |
| Util.Tuple2<A,B> | |
| ZipUtil |