| Package | Description |
|---|---|
| cc.redberry.rings | |
| cc.redberry.rings.io | |
| cc.redberry.rings.poly | |
| cc.redberry.rings.poly.multivar | |
| cc.redberry.rings.poly.univar |
| Modifier and Type | Method and Description |
|---|---|
static <Poly extends IPolynomial<Poly>> |
Rings.PolynomialRing(Poly factory)
Generic factory for polynomial ring
|
| Modifier and Type | Method and Description |
|---|---|
static <Poly extends IPolynomial<Poly>> |
Coder.mkPolynomialCoder(IPolynomialRing<Poly> ring,
String... variables)
Create coder for generic polynomial rings
|
static <Poly extends IPolynomial<Poly>> |
IStringifier.mkPolyStringifier(IPolynomialRing<Poly> ring,
String... variables)
Create simple stringifier for polynomials with given variables
|
static <Poly extends IPolynomial<Poly>> |
IStringifier.mkPolyStringifier(Poly factory,
String... variables)
Create simple stringifier for polynomials with given variables
|
| Modifier and Type | Interface and Description |
|---|---|
interface |
IPolynomial<Poly extends IPolynomial<Poly>>
Parent interface for all polynomials.
|
interface |
IPolynomialRing<Poly extends IPolynomial<Poly>>
Polynomial ring.
|
class |
PolynomialFactorDecomposition<Poly extends IPolynomial<Poly>>
Factor decomposition of element.
|
| Modifier and Type | Method and Description |
|---|---|
static <Poly extends IPolynomial<Poly>> |
PolynomialMethods.coprimeQ(Iterable<Poly> polynomials)
Returns whether specified polynomials are coprime.
|
static <Poly extends IPolynomial<Poly>> |
PolynomialMethods.coprimeQ(Poly... polynomials)
Returns whether specified polynomials are coprime.
|
static <Poly extends IPolynomial<Poly>> |
PolynomialMethods.divideAndRemainder(Poly a,
Poly b)
Returns quotient and remainder of a and b.
|
static <Poly extends IPolynomial<Poly>> |
PolynomialMethods.divideExact(Poly a,
Poly b)
Returns the quotient of a and b or throws
ArithmeticException if exact division is not possible |
static <Poly extends IPolynomial<Poly>> |
PolynomialMethods.divideOrNull(Poly a,
Poly b)
Returns the quotient of a and b or throws
ArithmeticException if exact division is not possible |
static <Poly extends IPolynomial<Poly>> |
PolynomialFactorDecomposition.empty(Poly factory)
Empty factorization
|
static <Poly extends IPolynomial<Poly>> |
PolynomialMethods.Factor(Poly poly)
Factor polynomial.
|
static <Poly extends IPolynomial<Poly>> |
PolynomialMethods.FactorSquareFree(Poly poly)
Square-free factorization of polynomial.
|
static <Poly extends IPolynomial<Poly>> |
PolynomialMethods.irreducibleQ(Poly poly)
Returns whether specified polynomial is irreducible
|
static <T extends IPolynomial<T>> |
Util.isOverMultipleFieldExtension(T poly)
Whether coefficient domain is F(alpha1, alpha2, ...)
|
static <T extends IPolynomial<T>> |
Util.isOverQ(T poly)
Whether coefficient domain is Q
|
static <T extends IPolynomial<T>> |
Util.isOverRationals(T poly)
Whether coefficient domain is rationals
|
static <T extends IPolynomial<T>> |
Util.isOverRingOfIntegersOfSimpleNumberField(T poly)
Whether coefficient domain is Q(alpha)
|
static <T extends IPolynomial<T>> |
Util.isOverSimpleFieldExtension(T poly)
Whether coefficient domain is F(alpha)
|
static <T extends IPolynomial<T>> |
Util.isOverSimpleNumberField(T poly)
Whether coefficient domain is Q(alpha)
|
static <T extends IPolynomial<T>> |
Util.isOverZ(T poly)
Whether coefficient domain is Z
|
<OthPoly extends IPolynomial<OthPoly>> |
PolynomialFactorDecomposition.mapTo(Function<Poly,OthPoly> mapper) |
static <Poly extends IPolynomial<Poly>> |
PolynomialFactorDecomposition.of(Collection<Poly> factors)
Factor decomposition with specified factors and exponents
|
static <Poly extends IPolynomial<Poly>> |
PolynomialFactorDecomposition.of(Poly... factors)
Factor decomposition with specified factors and exponents
|
static <Poly extends IPolynomial<Poly>> |
PolynomialFactorDecomposition.of(Poly a) |
static <Poly extends IPolynomial<Poly>> |
PolynomialFactorDecomposition.of(Poly unit,
List<Poly> factors,
gnu.trove.list.array.TIntArrayList exponents)
Factor decomposition with specified factors and exponents
|
static <Poly extends IPolynomial<Poly>> |
PolynomialFactorDecomposition.of(Poly a,
Poly b) |
static <Poly extends IPolynomial<Poly>> |
PolynomialFactorDecomposition.of(Poly a,
Poly b,
Poly c) |
static <Poly extends IPolynomial<Poly>> |
PolynomialMethods.PolynomialGCD(Iterable<Poly> array)
Compute GCD of collection of polynomials.
|
static <Poly extends IPolynomial<Poly>> |
PolynomialMethods.PolynomialGCD(Poly... array)
Compute GCD of array of polynomials.
|
static <Poly extends IPolynomial<Poly>> |
PolynomialMethods.PolynomialGCD(Poly a,
Poly b)
Compute GCD of two polynomials.
|
static <T extends IPolynomial<T>> |
PolynomialMethods.polyPow(T base,
BigInteger exponent)
Returns
base in a power of non-negative exponent |
static <T extends IPolynomial<T>> |
PolynomialMethods.polyPow(T base,
BigInteger exponent,
boolean copy)
Returns
base in a power of non-negative exponent. |
static <T extends IPolynomial<T>> |
PolynomialMethods.polyPow(T base,
int exponent,
boolean copy,
gnu.trove.map.hash.TIntObjectHashMap<T> cache)
Returns
base in a power of non-negative exponent |
static <T extends IPolynomial<T>> |
PolynomialMethods.polyPow(T base,
long exponent)
Returns
base in a power of non-negative exponent |
static <T extends IPolynomial<T>> |
PolynomialMethods.polyPow(T base,
long exponent,
boolean copy)
Returns
base in a power of non-negative exponent |
static <Poly extends IPolynomial<Poly>> |
PolynomialMethods.remainder(Poly a,
Poly b)
Returns quotient and remainder of a and b.
|
static <Poly extends IPolynomial<Poly>> |
PolynomialFactorDecomposition.unit(Poly unit)
Unit factorization
|
| Modifier and Type | Method and Description |
|---|---|
Poly[] |
IPolynomial.createArray(int length)
overcome Java generics...
|
default Poly[] |
IPolynomial.createArray(Poly a)
overcome Java generics...
|
default Poly[] |
IPolynomial.createArray(Poly a,
Poly b)
overcome Java generics...
|
default Poly[] |
IPolynomial.createArray(Poly a,
Poly b,
Poly c)
overcome Java generics...
|
Poly[][] |
IPolynomial.createArray2d(int length)
overcome Java generics...
|
Poly[][] |
IPolynomial.createArray2d(int length1,
int length2)
overcome Java generics...
|
static <Poly extends IPolynomial<Poly>> |
PolynomialMethods.divideAndRemainder(Poly a,
Poly b)
Returns quotient and remainder of a and b.
|
| Modifier and Type | Method and Description |
|---|---|
default Poly |
IPolynomial.add(Poly... oth)
Adds
oth to this. |
static boolean |
Util.canConvertToZp64(IPolynomial poly)
Test whether poly is over Zp with modulus less then 2^63
|
static <Poly extends IPolynomial<Poly>> |
PolynomialMethods.coprimeQ(Poly... polynomials)
Returns whether specified polynomials are coprime.
|
static void |
Util.ensureOverField(IPolynomial... polys) |
static void |
Util.ensureOverFiniteField(IPolynomial... polys) |
static void |
Util.ensureOverZ(IPolynomial... polys) |
default Poly |
IPolynomial.multiply(Poly... oth)
Multiplies this by
oth |
static <Poly extends IPolynomial<Poly>> |
PolynomialFactorDecomposition.of(Poly... factors)
Factor decomposition with specified factors and exponents
|
static <Poly extends IPolynomial<Poly>> |
PolynomialMethods.PolynomialGCD(Poly... array)
Compute GCD of array of polynomials.
|
default Poly |
IPolynomial.subtract(Poly... oth)
Subtracts
oth from this. |
| Modifier and Type | Class and Description |
|---|---|
class |
AMultivariatePolynomial<Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>>
Parent class for multivariate polynomials.
|
class |
MultivariatePolynomial<E> |
class |
MultivariatePolynomialZp64
Multivariate polynomial over Zp ring with the modulus in the range (0, 2^62) (see
MachineArithmetic.MAX_SUPPORTED_MODULUS). |
| Modifier and Type | Interface and Description |
|---|---|
interface |
IUnivariatePolynomial<Poly extends IUnivariatePolynomial<Poly>>
Parent interface for univariate polynomials.
|
| Modifier and Type | Class and Description |
|---|---|
class |
UnivariatePolynomial<E>
Univariate polynomial over generic ring.
|
class |
UnivariatePolynomialZ64
Univariate polynomial over machine integers in range [-2^63, 2^63].
|
class |
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. |
Copyright © 2022. All rights reserved.