| CycloUtil |
Cyclotomic polynomial utilities.
|
| EvalPoints<C extends RingElem<C>> |
Container for the evaluation points of a polynomial.
|
| Examples |
Examples for ufd and elementaty integration usage.
|
| ExamplesPartialFraction |
Examples related to partial fraction decomposition.
|
| FactorAbsolute<C extends GcdRingElem<C>> |
Absolute factorization algorithms class.
|
| FactorAbstract<C extends GcdRingElem<C>> |
Abstract factorization algorithms class.
|
| FactorAlgebraic<C extends GcdRingElem<C>> |
Algebraic number coefficients factorization algorithms.
|
| FactorAlgebraicTest |
Factor algebraic tests with JUnit.
|
| FactorComplex<C extends GcdRingElem<C>> |
Complex coefficients factorization algorithms.
|
| FactorComplexTest |
Factor complex via algebraic tests with JUnit.
|
| FactorFactory |
Factorization algorithms factory.
|
| FactorFraction<C extends GcdRingElem<C>,D extends GcdRingElem<D> & QuotPair<GenPolynomial<C>>> |
Fraction factorization algorithms.
|
| FactorFractionTest |
Factor fractions (of polynomial quotients) tests with JUnit.
|
| FactorGenericTest |
Factor rational tests with JUnit.
|
| FactorInteger<MOD extends GcdRingElem<MOD> & Modular> |
Integer coefficients factorization algorithms.
|
| FactorIntegerTest |
Factor tests with JUnit.
|
| FactorModular<MOD extends GcdRingElem<MOD> & Modular> |
Modular coefficients factorization algorithms.
|
| FactorModularBerlekamp<MOD extends GcdRingElem<MOD>> |
Modular coefficients Berlekamp factorization algorithms.
|
| FactorModularTest |
Factor modular tests with JUnit.
|
| FactorMoreTest |
Factor tests with JUnit.
|
| FactorQuotient<C extends GcdRingElem<C>> |
Rational function coefficients factorization algorithms.
|
| FactorQuotientTest |
Factor quotient tests with JUnit.
|
| FactorRational |
Rational number coefficients factorization algorithms.
|
| FactorRationalTest |
Factor rational tests with JUnit.
|
| Factors<C extends GcdRingElem<C>> |
Container for the factors of absolute factorization.
|
| FactorsList<C extends GcdRingElem<C>> |
Container for the factors of a squarefree factorization.
|
| FactorsMap<C extends GcdRingElem<C>> |
Container for the factors of a eventually non-squarefree factorization.
|
| FactorTest |
Factor tests with JUnit.
|
| GCDFactory |
Greatest common divisor algorithms factory.
|
| GCDFactoryTest |
GreatestCommonDivisor factory tests with JUnit.
|
| GCDHenselTest |
GCD Hensel algorithm tests with JUnit.
|
| GCDModEvalTest |
GCD Modular Evaluation algorithm tests with JUnit.
|
| GCDModLongEvalTest |
GCD Modular Evaluation algorithm tests with JUnit.
|
| GCDModLongTest |
GCD Modular algorithm tests with JUnit.
|
| GCDModularTest |
GCD Modular algorithm tests with JUnit.
|
| GCDPartFracRatTest |
GCD partial fraction with rational coefficients algorithm tests with JUnit.
|
| GCDPrimitiveTest |
GCD Primitive PRS algorithm tests with JUnit.
|
| GCDProxy<C extends GcdRingElem<C>> |
Greatest common divisor parallel proxy.
|
| GCDProxyTest |
GreatestCommonDivisor proxy tests with JUnit.
|
| GCDSimpleTest |
GCD Simple PRS algorithm tests with JUnit.
|
| GCDSubresRatTest |
GCD Subres with rational coefficients algorithm tests with JUnit.
|
| GCDSubresTest |
GCD Subresultant PRS algorithm tests with JUnit.
|
| GCDTimingTest |
GreatestCommonDivisor timing tests with JUnit.
|
| GenMatrixFFTest |
GenMatrix tests with JUnit
|
| GreatestCommonDivisorAbstract<C extends GcdRingElem<C>> |
Greatest common divisor algorithms.
|
| GreatestCommonDivisorFake<C extends GcdRingElem<C>> |
Greatest common divisor algorithms with gcd always 1.
|
| GreatestCommonDivisorHensel<MOD extends GcdRingElem<MOD> & Modular> |
Greatest common divisor algorithms with subresultant polynomial remainder
sequence and univariate Hensel lifting.
|
| GreatestCommonDivisorModEval<MOD extends GcdRingElem<MOD> & Modular> |
Greatest common divisor algorithms with modular evaluation algorithm for
recursion.
|
| GreatestCommonDivisorModular<MOD extends GcdRingElem<MOD> & Modular> |
Greatest common divisor algorithms with modular computation and Chinese
remainder algorithm.
|
| GreatestCommonDivisorPrimitive<C extends GcdRingElem<C>> |
Greatest common divisor algorithms with primitive polynomial remainder
sequence.
|
| GreatestCommonDivisorSimple<C extends GcdRingElem<C>> |
Greatest common divisor algorithms with monic polynomial remainder sequence.
|
| GreatestCommonDivisorSubres<C extends GcdRingElem<C>> |
Greatest common divisor algorithms with subresultant polynomial remainder
sequence.
|
| HenselApprox<MOD extends GcdRingElem<MOD> & Modular> |
Container for the approximation result from a Hensel algorithm.
|
| HenselMultUtil |
Hensel multivariate lifting utilities.
|
| HenselMultUtilTest |
HenselMultUtil tests with JUnit.
|
| HenselUtil |
Hensel utilities for ufd.
|
| HenselUtilTest |
HenselUtil tests with JUnit.
|
| PartialFraction<C extends GcdRingElem<C>> |
Container for the partial fraction decomposition of a squarefree denominator.
|
| PolyUfdUtil |
Polynomial ufd utilities.
|
| PolyUfdUtilTest |
PolyUfdUtil tests with JUnit.
|
| Quotient<C extends GcdRingElem<C>> |
Quotient, that is a rational function, based on GenPolynomial with RingElem
interface.
|
| QuotientIntTest |
Quotient over BigInteger GenPolynomial tests with JUnit.
|
| QuotientRatTest |
Quotient over BigRational GenPolynomial tests with JUnit.
|
| QuotientRing<C extends GcdRingElem<C>> |
Quotient ring factory based on GenPolynomial with RingElem interface.
|
| QuotientTaylorFunction<C extends GcdRingElem<C>> |
Polynomial quotient functions capable for Taylor series expansion.
|
| QuotIntPolynomialTest |
Quotient BigInteger coefficient GenPolynomial tests with JUnit.
|
| SquarefreeAbstract<C extends GcdRingElem<C>> |
Abstract squarefree decomposition class.
|
| SquarefreeAlgModTest |
Squarefree factorization AlgebraicNumber:ModInteger coefficients tests with
JUnit.
|
| SquarefreeAlgQuotModTest |
Squarefree factorization AlgebraicNumber:Quotient:ModInteger coefficients
tests with JUnit.
|
| SquarefreeFactory |
Squarefree factorization algorithms factory.
|
| SquarefreeFieldChar0<C extends GcdRingElem<C>> |
Squarefree decomposition for coefficient fields of characteristic 0.
|
| SquarefreeFieldChar0Yun<C extends GcdRingElem<C>> |
Squarefree decomposition for coefficient fields of characteristic 0,
algorithm of Yun.
|
| SquarefreeFieldCharP<C extends GcdRingElem<C>> |
Squarefree decomposition for coefficient fields of characteristic p.
|
| SquarefreeFiniteFieldCharP<C extends GcdRingElem<C>> |
Squarefree decomposition for finite coefficient fields of characteristic p.
|
| SquarefreeInfiniteAlgebraicFieldCharP<C extends GcdRingElem<C>> |
Squarefree decomposition for algebraic extensions of infinite coefficient
fields of characteristic p > 0.
|
| SquarefreeInfiniteFieldCharP<C extends GcdRingElem<C>> |
Squarefree decomposition for infinite coefficient fields of characteristic p.
|
| SquarefreeIntTest |
Squarefree factorization BigInteger coefficients tests with JUnit.
|
| SquarefreeModLongTest |
Squarefree factorization ModLong coefficients tests with JUnit.
|
| SquarefreeModTest |
Squarefree factorization ModInteger coefficients tests with JUnit.
|
| SquarefreeQuotModTest |
Squarefree factorization Quotient:ModInteger coefficients tests with JUnit.
|
| SquarefreeRatTest |
Squarefree factorization BigRational coefficients tests with JUnit.
|
| SquarefreeRingChar0<C extends GcdRingElem<C>> |
Squarefree decomposition for coefficient rings of characteristic 0.
|
| SquarefreeTest |
Squarefree Factory tests with JUnit.
|
| UnivPowerSeriesTaylorTest |
Univariate power series tests with JUnit.
|