| Package | Description |
|---|---|
| cc.redberry.rings | |
| cc.redberry.rings.io | |
| cc.redberry.rings.poly | |
| cc.redberry.rings.poly.multivar |
| 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 IUnivariatePolynomial<Poly>> |
Coder.mkUnivariateCoder(IPolynomialRing<Poly> ring,
Map<String,Poly> variables)
Create coder for univariate polynomial rings
|
static <Poly extends IUnivariatePolynomial<Poly>> |
Coder.mkUnivariateCoder(IPolynomialRing<Poly> ring,
String variable)
Create coder for univariate polynomial rings
|
static <E> Coder<UnivariatePolynomial<E>,?,?> |
Coder.mkUnivariateCoder(IPolynomialRing<UnivariatePolynomial<E>> ring,
Coder<E,?,?> cfCoder,
Map<String,UnivariatePolynomial<E>> variables)
Create coder for univariate polynomial rings
|
static <E> Coder<UnivariatePolynomial<E>,?,?> |
Coder.mkUnivariateCoder(IPolynomialRing<UnivariatePolynomial<E>> ring,
Coder<E,?,?> cfCoder,
String variable)
Create coder for univariate polynomial rings
|
| Modifier and Type | Class and Description |
|---|---|
class |
AlgebraicNumberField<E extends IUnivariatePolynomial<E>>
Algebraic number field
F(α) represented as a simple field extension, for details see SimpleFieldExtension. |
class |
FiniteField<E extends IUnivariatePolynomial<E>>
Galois field
GF(p, q). |
class |
MultipleFieldExtension<Term extends AMonomial<Term>,mPoly extends AMultivariatePolynomial<Term,mPoly>,sPoly extends IUnivariatePolynomial<sPoly>>
Multiple field extension
F(α_1, α_2, ..., α_N). |
class |
MultivariateRing<Poly extends AMultivariatePolynomial<?,Poly>>
Ring of multivariate polynomials.
|
class |
QuotientRing<Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>>
Multivariate quotient ring
|
class |
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 α. |
class |
UnivariateRing<Poly extends IUnivariatePolynomial<Poly>>
Ring of univariate polynomials.
|
| Modifier and Type | Method and Description |
|---|---|
static <Poly extends AMultivariatePolynomial<?,Poly>> |
MultivariateConversions.fromUnivariate(IPolynomialRing<UnivariatePolynomial<Poly>> ring,
int variable)
Given poly in R[variables][other_variables] converts it to poly in R[x1,x2,...,xN]
|
| Modifier and Type | Method and Description |
|---|---|
static <Poly extends AMultivariatePolynomial<?,Poly>> |
MultivariateConversions.asUnivariate(IPolynomialRing<Poly> ring,
int variable)
Given poly in R[x1,x2,...,xN] converts to poly in R[other_variables][variable]
|
static <Poly extends AMultivariatePolynomial<?,Poly>> |
MultivariateConversions.fromUnivariate(IPolynomialRing<UnivariatePolynomial<Poly>> ring,
int variable)
Given poly in R[variables][other_variables] converts it to poly in R[x1,x2,...,xN]
|
static <Poly extends AMultivariatePolynomial<?,Poly>> |
MultivariateConversions.merge(IPolynomialRing<MultivariatePolynomial<Poly>> ring,
int... variables)
Given poly in R[x1,x2,...,xN] converts to poly in R[variables][other_variables]
|
static <Poly extends AMultivariatePolynomial<?,Poly>> |
MultivariateConversions.split(IPolynomialRing<Poly> ring,
int... variables)
Given poly in R[x1,x2,...,xN] converts to poly in R[variables][other_variables]
|
| Constructor and Description |
|---|
Interpolation(int variable,
IPolynomialRing<MultivariatePolynomial<E>> factory)
Start new interpolation
|
InterpolationZp64(int variable,
IPolynomialRing<MultivariatePolynomialZp64> factory)
Start new interpolation
|
Copyright © 2022. All rights reserved.