Uses of Interface
cc.redberry.rings.poly.IPolynomial
-
Packages that use IPolynomial Package Description cc.redberry.rings cc.redberry.rings.io cc.redberry.rings.poly cc.redberry.rings.poly.multivar cc.redberry.rings.poly.univar -
-
Uses of IPolynomial in cc.redberry.rings
Methods in cc.redberry.rings with type parameters of type IPolynomial Modifier and Type Method Description static <Poly extends IPolynomial<Poly>>
IPolynomialRing<Poly>Rings. PolynomialRing(Poly factory)
Generic factory for polynomial ring -
Uses of IPolynomial in cc.redberry.rings.io
Methods in cc.redberry.rings.io with type parameters of type IPolynomial Modifier and Type Method Description static <Poly extends IPolynomial<Poly>>
Coder<Poly,?,?>Coder. mkPolynomialCoder(IPolynomialRing<Poly> ring, String... variables)
Create coder for generic polynomial ringsstatic <Poly extends IPolynomial<Poly>>
IStringifier<Poly>IStringifier. mkPolyStringifier(IPolynomialRing<Poly> ring, String... variables)
Create simple stringifier for polynomials with given variablesstatic <Poly extends IPolynomial<Poly>>
IStringifier<Poly>IStringifier. mkPolyStringifier(Poly factory, String... variables)
Create simple stringifier for polynomials with given variables -
Uses of IPolynomial in cc.redberry.rings.poly
Classes in cc.redberry.rings.poly with type parameters of type IPolynomial Modifier and Type Interface 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.Methods in cc.redberry.rings.poly with type parameters of type IPolynomial Modifier and Type Method Description static <Poly extends IPolynomial<Poly>>
booleanPolynomialMethods. coprimeQ(Iterable<Poly> polynomials)
Returns whether specified polynomials are coprime.static <Poly extends IPolynomial<Poly>>
booleanPolynomialMethods. coprimeQ(Poly... polynomials)
Returns whether specified polynomials are coprime.static <Poly extends IPolynomial<Poly>>
Poly[]PolynomialMethods. divideAndRemainder(Poly a, Poly b)
Returns quotient and remainder of a and b.static <Poly extends IPolynomial<Poly>>
PolyPolynomialMethods. divideExact(Poly a, Poly b)
Returns the quotient of a and b or throwsArithmeticException
if exact division is not possiblestatic <Poly extends IPolynomial<Poly>>
PolyPolynomialMethods. divideOrNull(Poly a, Poly b)
Returns the quotient of a and b or throwsArithmeticException
if exact division is not possiblestatic <Poly extends IPolynomial<Poly>>
PolynomialFactorDecomposition<Poly>PolynomialFactorDecomposition. empty(Poly factory)
Empty factorizationstatic <Poly extends IPolynomial<Poly>>
PolynomialFactorDecomposition<Poly>PolynomialMethods. Factor(Poly poly)
Factor polynomial.static <Poly extends IPolynomial<Poly>>
PolynomialFactorDecomposition<Poly>PolynomialMethods. FactorSquareFree(Poly poly)
Square-free factorization of polynomial.static <Poly extends IPolynomial<Poly>>
booleanPolynomialMethods. irreducibleQ(Poly poly)
Returns whether specified polynomial is irreduciblestatic <T extends IPolynomial<T>>
booleanUtil. isOverMultipleFieldExtension(T poly)
Whether coefficient domain is F(alpha1, alpha2, ...)static <T extends IPolynomial<T>>
booleanUtil. isOverQ(T poly)
Whether coefficient domain is Qstatic <T extends IPolynomial<T>>
booleanUtil. isOverRationals(T poly)
Whether coefficient domain is rationalsstatic <T extends IPolynomial<T>>
booleanUtil. isOverRingOfIntegersOfSimpleNumberField(T poly)
Whether coefficient domain is Q(alpha)static <T extends IPolynomial<T>>
booleanUtil. isOverSimpleFieldExtension(T poly)
Whether coefficient domain is F(alpha)static <T extends IPolynomial<T>>
booleanUtil. isOverSimpleNumberField(T poly)
Whether coefficient domain is Q(alpha)static <T extends IPolynomial<T>>
booleanUtil. isOverZ(T poly)
Whether coefficient domain is Z<OthPoly extends IPolynomial<OthPoly>>
PolynomialFactorDecomposition<OthPoly>PolynomialFactorDecomposition. mapTo(Function<Poly,OthPoly> mapper)
static <Poly extends IPolynomial<Poly>>
PolynomialFactorDecomposition<Poly>PolynomialFactorDecomposition. of(Collection<Poly> factors)
Factor decomposition with specified factors and exponentsstatic <Poly extends IPolynomial<Poly>>
PolynomialFactorDecomposition<Poly>PolynomialFactorDecomposition. of(Poly a)
static <Poly extends IPolynomial<Poly>>
PolynomialFactorDecomposition<Poly>PolynomialFactorDecomposition. of(Poly... factors)
Factor decomposition with specified factors and exponentsstatic <Poly extends IPolynomial<Poly>>
PolynomialFactorDecomposition<Poly>PolynomialFactorDecomposition. of(Poly unit, List<Poly> factors, gnu.trove.list.array.TIntArrayList exponents)
Factor decomposition with specified factors and exponentsstatic <Poly extends IPolynomial<Poly>>
PolynomialFactorDecomposition<Poly>PolynomialFactorDecomposition. of(Poly a, Poly b)
static <Poly extends IPolynomial<Poly>>
PolynomialFactorDecomposition<Poly>PolynomialFactorDecomposition. of(Poly a, Poly b, Poly c)
static <Poly extends IPolynomial<Poly>>
PolyPolynomialMethods. PolynomialGCD(Iterable<Poly> array)
Compute GCD of collection of polynomials.static <Poly extends IPolynomial<Poly>>
PolyPolynomialMethods. PolynomialGCD(Poly... array)
Compute GCD of array of polynomials.static <Poly extends IPolynomial<Poly>>
PolyPolynomialMethods. PolynomialGCD(Poly a, Poly b)
Compute GCD of two polynomials.static <T extends IPolynomial<T>>
TPolynomialMethods. polyPow(T base, int exponent, boolean copy, gnu.trove.map.hash.TIntObjectHashMap<T> cache)
Returnsbase
in a power of non-negativeexponent
static <T extends IPolynomial<T>>
TPolynomialMethods. polyPow(T base, long exponent)
Returnsbase
in a power of non-negativeexponent
static <T extends IPolynomial<T>>
TPolynomialMethods. polyPow(T base, long exponent, boolean copy)
Returnsbase
in a power of non-negativeexponent
static <T extends IPolynomial<T>>
TPolynomialMethods. polyPow(T base, BigInteger exponent)
Returnsbase
in a power of non-negativeexponent
static <T extends IPolynomial<T>>
TPolynomialMethods. polyPow(T base, BigInteger exponent, boolean copy)
Returnsbase
in a power of non-negativeexponent
.static <Poly extends IPolynomial<Poly>>
PolyPolynomialMethods. remainder(Poly a, Poly b)
Returns quotient and remainder of a and b.static <Poly extends IPolynomial<Poly>>
PolynomialFactorDecomposition<Poly>PolynomialFactorDecomposition. unit(Poly unit)
Unit factorizationMethods in cc.redberry.rings.poly that return IPolynomial Modifier and Type Method 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>>
Poly[]PolynomialMethods. divideAndRemainder(Poly a, Poly b)
Returns quotient and remainder of a and b.Methods in cc.redberry.rings.poly with parameters of type IPolynomial Modifier and Type Method Description default Poly
IPolynomial. add(Poly... oth)
Addsoth
tothis
.static boolean
Util. canConvertToZp64(IPolynomial poly)
Test whether poly is over Zp with modulus less then 2^63static <Poly extends IPolynomial<Poly>>
booleanPolynomialMethods. 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 byoth
static <Poly extends IPolynomial<Poly>>
PolynomialFactorDecomposition<Poly>PolynomialFactorDecomposition. of(Poly... factors)
Factor decomposition with specified factors and exponentsstatic <Poly extends IPolynomial<Poly>>
PolyPolynomialMethods. PolynomialGCD(Poly... array)
Compute GCD of array of polynomials.default Poly
IPolynomial. subtract(Poly... oth)
Subtractsoth
fromthis
. -
Uses of IPolynomial in cc.redberry.rings.poly.multivar
Classes in cc.redberry.rings.poly.multivar that implement IPolynomial Modifier and Type Class 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) (seeMachineArithmetic.MAX_SUPPORTED_MODULUS
). -
Uses of IPolynomial in cc.redberry.rings.poly.univar
Subinterfaces of IPolynomial in cc.redberry.rings.poly.univar Modifier and Type Interface Description interface
IUnivariatePolynomial<Poly extends IUnivariatePolynomial<Poly>>
Parent interface for univariate polynomials.Classes in cc.redberry.rings.poly.univar that implement IPolynomial Modifier and Type Class 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 byMachineArithmetic.MAX_SUPPORTED_MODULUS_BITS
.
-