Uses of Interface
edu.jas.arith.Rational
Packages that use Rational
Package
Description
Groebner base application package.
Basic arithmetic package.
Generic coefficients polynomial package.
Real and Complex Root Computation package.
Unique Factorization Domain and Roots package.
-
Uses of Rational in edu.jas.application
Classes in edu.jas.application with type parameters of type RationalModifier and TypeClassDescriptionclassAlgebraicRootsPrimElem<C extends GcdRingElem<C> & Rational>Container for the real and complex algebraic roots of a univariate polynomial together with primitive element.(package private) classCoeffToComplexReal<C extends GcdRingElem<C> & Rational>Coefficient to complex real algebriac functor.(package private) classEvaluateToComplexReal<C extends GcdRingElem<C> & Rational>Polynomial coefficient to complex real algebriac evaluation functor.classFactorRealReal<C extends GcdRingElem<C> & Rational>Real algebraic number coefficients factorization algorithms.classIdealWithComplexAlgebraicRoots<D extends GcdRingElem<D> & Rational>Container for Ideals together with univariate polynomials and complex algebraic roots.classIdealWithRealAlgebraicRoots<D extends GcdRingElem<D> & Rational>Container for Ideals together with univariate polynomials and real algebraic roots.classRealAlgebraicNumber<C extends GcdRingElem<C> & Rational>Complex algebraic number class based on bi-variate real algebraic numbers.classRealAlgebraicRing<C extends GcdRingElem<C> & Rational>Real algebraic number factory class based on bi-variate real algebraic numbers.(package private) classRealFromReAlgCoeff<C extends GcdRingElem<C> & Rational>Coefficient to real algebriac from algebraic functor.(package private) classReAlgFromRealCoeff<C extends GcdRingElem<C> & Rational>Coefficient to real algebriac from real algebraic functor.Classes in edu.jas.application that implement RationalModifier and TypeClassDescriptionclassRealAlgebraicNumber<C extends GcdRingElem<C> & Rational>Complex algebraic number class based on bi-variate real algebraic numbers.Methods in edu.jas.application with type parameters of type RationalModifier and TypeMethodDescriptionstatic <C extends GcdRingElem<C> & Rational>
List<Complex<RealAlgebraicNumber<C>>> RootFactoryApp.complexAlgebraicNumbersComplex(GenPolynomial<Complex<C>> f) Complex algebraic number roots.static <C extends GcdRingElem<C> & Rational>
List<Complex<RealAlgebraicNumber<C>>> RootFactoryApp.complexAlgebraicNumbersSquarefree(GenPolynomial<Complex<C>> f) Complex algebraic number roots.static <D extends GcdRingElem<D> & Rational>
List<IdealWithComplexAlgebraicRoots<D>> PolyUtilApp.complexAlgebraicRoots(Ideal<D> I) Construct exact set of complex roots for zero dimensional ideal(G).static <D extends GcdRingElem<D> & Rational>
IdealWithComplexAlgebraicRoots<D> PolyUtilApp.complexAlgebraicRoots(IdealWithUniv<D> I) Construct complex roots for zero dimensional ideal(G).static <D extends GcdRingElem<D> & Rational>
List<IdealWithComplexAlgebraicRoots<D>> PolyUtilApp.complexAlgebraicRoots(List<IdealWithUniv<D>> I) Construct complex roots for zero dimensional ideal(G).static <D extends GcdRingElem<D> & Rational>
List<IdealWithComplexRoots<D>> PolyUtilApp.complexRoots(Ideal<D> G, BigRational eps) Construct superset of complex roots for zero dimensional ideal(G).static <D extends GcdRingElem<D> & Rational>
List<List<Complex<BigDecimal>>> PolyUtilApp.complexRoots(Ideal<D> I, List<GenPolynomial<D>> univs, BigRational eps) Construct superset of complex roots for zero dimensional ideal(G).static <D extends GcdRingElem<D> & Rational>
List<IdealWithComplexRoots<D>> PolyUtilApp.complexRoots(List<IdealWithUniv<D>> Il, BigRational eps) Construct superset of complex roots for zero dimensional ideal(G).static <D extends GcdRingElem<D> & Rational>
List<List<Complex<BigDecimal>>> PolyUtilApp.complexRootTuples(Ideal<D> I, BigRational eps) Construct superset of complex roots for zero dimensional ideal(G).static <D extends GcdRingElem<D> & Rational>
List<List<Complex<BigDecimal>>> PolyUtilApp.complexRootTuples(List<IdealWithUniv<D>> Il, BigRational eps) Construct superset of complex roots for zero dimensional ideal(G).static <C extends GcdRingElem<C> & Rational>
GenPolynomial<Complex<RealAlgebraicNumber<C>>> PolyUtilApp.convertToComplexRealCoefficients(GenPolynomialRing<Complex<RealAlgebraicNumber<C>>> pfac, GenPolynomial<Complex<C>> A) Convert to Complex<RealAlgebraicNumber> coefficients.static <C extends GcdRingElem<C> & Rational>
GenPolynomial<Complex<RealAlgebraicNumber<C>>> PolyUtilApp.evaluateToComplexRealCoefficients(GenPolynomialRing<Complex<RealAlgebraicNumber<C>>> pfac, GenPolynomial<GenPolynomial<Complex<C>>> A, Complex<RealAlgebraicNumber<C>> r) Evaluate to Complex<RealAlgebraicNumber> coefficients.static <C extends GcdRingElem<C> & Rational>
FactorAbstract<RealAlgebraicNumber<C>> FactorFactory.getImplementation(RealAlgebraicRing<C> fac) Determine suitable implementation of factorization algorithms, case RealAlgebraicNumber<C>.static <C extends GcdRingElem<C> & Rational>
FactorAbstract<RealAlgebraicNumber<C>> FactorFactory.getImplementation(RealAlgebraicRing<C> fac) Determine suitable implementation of factorization algorithms, case RealAlgebraicNumber<C>.static <C extends GcdRingElem<C> & Rational>
booleanRootFactoryApp.isRoot(GenPolynomial<Complex<C>> f, Complex<RealAlgebraicNumber<C>> r) Is complex algebraic number a root of a polynomial.static <C extends GcdRingElem<C> & Rational>
booleanRootFactoryApp.isRoot(GenPolynomial<Complex<C>> f, List<Complex<RealAlgebraicNumber<C>>> R) Is complex algebraic number a root of a polynomial.static <C extends GcdRingElem<C> & Rational>
booleanRootFactoryApp.isRootRealCoeff(GenPolynomial<C> f, Complex<RealAlgebraicNumber<C>> r) Is complex algebraic number a root of a polynomial.static <D extends GcdRingElem<D> & Rational>
List<IdealWithRealAlgebraicRoots<D>> PolyUtilApp.realAlgebraicRoots(Ideal<D> I) Construct exact set of real roots for zero dimensional ideal(G).static <D extends GcdRingElem<D> & Rational>
IdealWithRealAlgebraicRoots<D> PolyUtilApp.realAlgebraicRoots(IdealWithUniv<D> I) Construct real roots for zero dimensional ideal(G).static <D extends GcdRingElem<D> & Rational>
List<IdealWithRealAlgebraicRoots<D>> PolyUtilApp.realAlgebraicRoots(List<IdealWithUniv<D>> I) Construct real roots for zero dimensional ideal(G).static <C extends GcdRingElem<C> & Rational>
GenPolynomial<RealAlgebraicNumber<C>> PolyUtilApp.realAlgFromRealCoefficients(GenPolynomialRing<RealAlgebraicNumber<C>> afac, GenPolynomial<RealAlgebraicNumber<C>> A) Convert to RealAlgebraicNumber coefficients.static <C extends GcdRingElem<C> & Rational>
GenPolynomial<RealAlgebraicNumber<C>> PolyUtilApp.realFromRealAlgCoefficients(GenPolynomialRing<RealAlgebraicNumber<C>> rfac, GenPolynomial<RealAlgebraicNumber<C>> A) Convert to RealAlgebraicNumber coefficients.static <D extends GcdRingElem<D> & Rational>
List<IdealWithRealRoots<D>> PolyUtilApp.realRoots(Ideal<D> G, BigRational eps) Construct superset of real roots for zero dimensional ideal(G).static <D extends GcdRingElem<D> & Rational>
List<List<BigDecimal>> PolyUtilApp.realRoots(Ideal<D> I, List<GenPolynomial<D>> univs, BigRational eps) Construct superset of real roots for zero dimensional ideal(G).static <D extends GcdRingElem<D> & Rational>
List<IdealWithRealRoots<D>> PolyUtilApp.realRoots(List<IdealWithUniv<D>> Il, BigRational eps) Construct superset of real roots for zero dimensional ideal(G).static <D extends GcdRingElem<D> & Rational>
List<List<BigDecimal>> PolyUtilApp.realRootTuples(Ideal<D> I, BigRational eps) Construct superset of real roots for zero dimensional ideal(G).static <D extends GcdRingElem<D> & Rational>
List<List<BigDecimal>> PolyUtilApp.realRootTuples(List<IdealWithUniv<D>> Il, BigRational eps) Construct superset of real roots for zero dimensional ideal(G).static <C extends GcdRingElem<C> & Rational>
AlgebraicRootsPrimElem<C> RootFactoryApp.rootReduce(AlgebraicNumberRing<C> a, AlgebraicNumberRing<C> b) Root reduce of real and complex algebraic numbers.static <C extends GcdRingElem<C> & Rational>
AlgebraicRootsPrimElem<C> RootFactoryApp.rootReduce(GenPolynomial<C> a, GenPolynomial<C> b) Root reduce of real and complex algebraic numbers.static <C extends GcdRingElem<C> & Rational>
AlgebraicRootsPrimElem<C> RootFactoryApp.rootReduce(AlgebraicRoots<C> a, AlgebraicRoots<C> b) Root reduce of real and complex algebraic numbers.static <C extends GcdRingElem<C> & Rational>
AlgebraicRootsPrimElem<C> RootFactoryApp.rootsOfUnity(AlgebraicRootsPrimElem<C> ar) Roots of unity of real and complex algebraic numbers.static <D extends GcdRingElem<D> & Rational>
StringPolyUtilApp.toString(Complex<RealAlgebraicNumber<D>> c) String representation of a deximal approximation of a complex number.static <D extends GcdRingElem<D> & Rational>
StringString representation of a deximal approximation of a complex number. -
Uses of Rational in edu.jas.arith
Classes in edu.jas.arith that implement RationalModifier and TypeClassDescriptionfinal classBigDecimal class to make java.math.BigDecimal available with RingElem interface.final classBigInteger class to make java.math.BigInteger available with RingElem respectively the GcdRingElem interface.final classImmutable arbitrary-precision rational numbers. -
Uses of Rational in edu.jas.poly
Classes in edu.jas.poly with type parameters of type RationalModifier and TypeClassDescription(package private) classCompRatToDec<C extends RingElem<C> & Rational>Conversion of Complex Rational to Complex BigDecimal.(package private) classConversion of Rational to BigDecimal.Methods in edu.jas.poly with type parameters of type RationalModifier and TypeMethodDescriptionstatic <C extends RingElem<C> & Rational>
GenPolynomial<Complex<BigDecimal>> PolyUtil.complexDecimalFromRational(GenPolynomialRing<Complex<BigDecimal>> fac, GenPolynomial<Complex<C>> A) Convert to complex decimal coefficients.static <C extends RingElem<C> & Rational>
GenPolynomial<BigDecimal> PolyUtil.decimalFromRational(GenPolynomialRing<BigDecimal> fac, GenPolynomial<C> A) Convert to decimal coefficients. -
Uses of Rational in edu.jas.root
Classes in edu.jas.root with type parameters of type RationalModifier and TypeClassDescriptionclassAlgebraicRoots<C extends GcdRingElem<C> & Rational>Container for the real and complex algebraic roots of a univariate polynomial.(package private) classAlgFromRealCoeff<C extends GcdRingElem<C> & Rational>Coefficient to algebraic from real algebraic functor.classBoundary determined by a rectangle and a polynomial.(package private) classCoeffToComplex<C extends GcdRingElem<C> & Rational>Coefficient to complex algebraic functor.(package private) classCoeffToComplexFromComplex<C extends GcdRingElem<C> & Rational>Coefficient to complex algebraic from complex functor.(package private) classCoeffToReal<C extends GcdRingElem<C> & Rational>Coefficient to real algebraic functor.(package private) classCoeffToReAlg<C extends GcdRingElem<C> & Rational>Coefficient to algebraic functor.(package private) classCoeffToRecReAlg<C extends GcdRingElem<C> & Rational>Coefficient to recursive algebraic functor.classComplexAlgebraicNumber<C extends GcdRingElem<C> & Rational>Complex algebraic number class based on AlgebraicNumber.classComplexAlgebraicRing<C extends GcdRingElem<C> & Rational>Complex algebraic number factory class based on AlgebraicNumberRing with RingFactory interface.interfaceComplexRoots<C extends RingElem<C> & Rational>Complex roots interface.classComplexRootsAbstract<C extends RingElem<C> & Rational>Complex roots abstract class.classComplexRootsSturm<C extends RingElem<C> & Rational>Complex roots implemented by Sturm sequences.classDecimalRoots<C extends GcdRingElem<C> & Rational>Container for the real and complex algebraic roots of a univariate polynomial.classInterval.(package private) classPolyToReAlg<C extends GcdRingElem<C> & Rational>Polynomial to algebraic functor.classRealAlgebraicNumber<C extends GcdRingElem<C> & Rational>Real algebraic number class based on AlgebraicNumber.classRealAlgebraicRing<C extends GcdRingElem<C> & Rational>Real algebraic number factory class based on AlgebraicNumberRing with RingFactory interface.(package private) classRealFromAlgCoeff<C extends GcdRingElem<C> & Rational>Coefficient to real algebriac from algebraic functor.interfaceReal roots interface.classRealRootsAbstract<C extends RingElem<C> & Rational>Real roots abstract class.classRealRootsSturm<C extends RingElem<C> & Rational>Real root isolation using Sturm sequences.classRealRootTuple<C extends GcdRingElem<C> & Rational>RealAlgebraicNumber root tuple.classRectangle.Classes in edu.jas.root that implement RationalModifier and TypeClassDescriptionclassRealAlgebraicNumber<C extends GcdRingElem<C> & Rational>Real algebraic number class based on AlgebraicNumber.Methods in edu.jas.root with type parameters of type RationalModifier and TypeMethodDescriptionstatic <C extends GcdRingElem<C> & Rational>
GenPolynomial<AlgebraicNumber<C>> PolyUtilRoot.algebraicFromRealCoefficients(GenPolynomialRing<AlgebraicNumber<C>> afac, GenPolynomial<RealAlgebraicNumber<C>> A) Convert to AlgebraicNumber coefficients.static <C extends GcdRingElem<C> & Rational>
AlgebraicRoots<C> RootFactory.algebraicRoots(GenPolynomial<C> f) Roots as real and complex algebraic numbers.static <C extends GcdRingElem<C> & Rational>
List<ComplexAlgebraicNumber<C>> RootFactory.complexAlgebraicNumbers(GenPolynomial<C> f) Complex algebraic numbers.static <C extends GcdRingElem<C> & Rational>
List<ComplexAlgebraicNumber<C>> RootFactory.complexAlgebraicNumbers(GenPolynomial<C> f, BigRational eps) Complex algebraic numbers.static <C extends GcdRingElem<C> & Rational>
List<ComplexAlgebraicNumber<C>> RootFactory.complexAlgebraicNumbersComplex(GenPolynomial<Complex<C>> f) Complex algebraic numbers.static <C extends GcdRingElem<C> & Rational>
List<ComplexAlgebraicNumber<C>> RootFactory.complexAlgebraicNumbersComplex(GenPolynomial<Complex<C>> f, BigRational eps) Complex algebraic numbers.static <C extends GcdRingElem<C> & Rational>
GenPolynomial<Complex<C>> PolyUtilRoot.complexFromAny(GenPolynomial<C> f) Convert to Complex coefficients.static <C extends GcdRingElem<C> & Rational>
GenPolynomial<RealAlgebraicNumber<C>> PolyUtilRoot.convertRecursiveToAlgebraicCoefficients(GenPolynomialRing<RealAlgebraicNumber<C>> pfac, GenPolynomial<GenPolynomial<C>> A) Convert to RealAlgebraicNumber coefficients.static <C extends GcdRingElem<C> & Rational>
GenPolynomial<RealAlgebraicNumber<C>> PolyUtilRoot.convertToAlgebraicCoefficients(GenPolynomialRing<RealAlgebraicNumber<C>> pfac, GenPolynomial<C> A) Convert to RealAlgebraicNumber coefficients.static <C extends GcdRingElem<C> & Rational>
GenPolynomial<ComplexAlgebraicNumber<C>> PolyUtilRoot.convertToComplexCoefficients(GenPolynomialRing<ComplexAlgebraicNumber<C>> pfac, GenPolynomial<C> A) Convert to ComplexAlgebraicNumber coefficients.static <C extends GcdRingElem<C> & Rational>
GenPolynomial<ComplexAlgebraicNumber<C>> PolyUtilRoot.convertToComplexCoefficientsFromComplex(GenPolynomialRing<ComplexAlgebraicNumber<C>> pfac, GenPolynomial<Complex<C>> A) Convert to ComplexAlgebraicNumber coefficients.static <C extends GcdRingElem<C> & Rational>
GenPolynomial<RealAlgebraicNumber<C>> PolyUtilRoot.convertToRealCoefficients(GenPolynomialRing<RealAlgebraicNumber<C>> pfac, GenPolynomial<C> A) Convert to RealAlgebraicNumber coefficients.static <C extends GcdRingElem<C> & Rational>
GenPolynomial<RealAlgebraicNumber<C>> PolyUtilRoot.convertToRecAlgebraicCoefficients(int depth, GenPolynomialRing<RealAlgebraicNumber<C>> pfac, GenPolynomial<C> A) Convert to recursive RealAlgebraicNumber coefficients.static <C extends GcdRingElem<C> & Rational>
DecimalRoots<C> RootFactory.decimalRoots(GenPolynomial<C> f, BigRational eps) Roots as real and complex decimal numbers.static <C extends GcdRingElem<C> & Rational>
DecimalRoots<C> RootFactory.decimalRoots(AlgebraicRoots<C> ar, BigRational eps) Roots as real and complex decimal numbers.static <C extends GcdRingElem<C> & Rational>
List<Complex<BigDecimal>> RootFactory.filterOutRealRoots(GenPolynomial<C> f, List<Complex<BigDecimal>> c, List<BigDecimal> r, BigRational eps) Filter real roots from complex roots.static <C extends GcdRingElem<C> & Rational>
List<ComplexAlgebraicNumber<C>> RootFactory.filterOutRealRoots(GenPolynomial<C> f, List<ComplexAlgebraicNumber<C>> c, List<RealAlgebraicNumber<C>> r) Filter real roots from complex roots.static <C extends GcdRingElem<C> & Rational>
booleanRootFactory.isRealRoot(GenPolynomial<C> f, Complex<BigDecimal> c, BigDecimal r, BigRational eps) Is complex decimal number a real root of a polynomial.static <C extends GcdRingElem<C> & Rational>
booleanRootFactory.isRealRoot(GenPolynomial<C> f, ComplexAlgebraicNumber<C> c, RealAlgebraicNumber<C> r) Is complex algebraic number a real root of a polynomial.static <C extends GcdRingElem<C> & Rational>
booleanRootFactory.isRoot(GenPolynomial<C> f, ComplexAlgebraicNumber<C> r) Is complex algebraic number a root of a polynomial.static <C extends GcdRingElem<C> & Rational>
booleanRootFactory.isRoot(GenPolynomial<C> f, RealAlgebraicNumber<C> r) Is real algebraic number a root of a polynomial.static <C extends GcdRingElem<C> & Rational>
booleanRootFactory.isRootComplex(GenPolynomial<Complex<C>> f, ComplexAlgebraicNumber<C> r) Is complex algebraic number a root of a complex polynomial.RootUtil.parseInterval(RingFactory<C> fac, String s) Parse interval for a real root from String.RootUtil.parseRectangle(RingFactory<Complex<C>> fac, String s) Parse rectangle for a complex root from String.static <C extends GcdRingElem<C> & Rational>
List<RealAlgebraicNumber<C>> RootFactory.realAlgebraicNumbers(GenPolynomial<C> f) Real algebraic numbers.static <C extends GcdRingElem<C> & Rational>
List<RealAlgebraicNumber<C>> RootFactory.realAlgebraicNumbers(GenPolynomial<C> f, BigRational eps) Real algebraic numbers.static <C extends GcdRingElem<C> & Rational>
List<RealAlgebraicNumber<C>> RootFactory.realAlgebraicNumbersField(GenPolynomial<C> f) Real algebraic numbers from a field.static <C extends GcdRingElem<C> & Rational>
List<RealAlgebraicNumber<C>> RootFactory.realAlgebraicNumbersField(GenPolynomial<C> f, BigRational eps) Real algebraic numbers from a field.static <C extends GcdRingElem<C> & Rational>
List<RealAlgebraicNumber<C>> RootFactory.realAlgebraicNumbersIrred(GenPolynomial<C> f) Real algebraic numbers from a irreducible polynomial.static <C extends GcdRingElem<C> & Rational>
List<RealAlgebraicNumber<C>> RootFactory.realAlgebraicNumbersIrred(GenPolynomial<C> f, BigRational eps) Real algebraic numbers from a irreducible polynomial.static <C extends GcdRingElem<C> & Rational>
GenPolynomial<RealAlgebraicNumber<C>> PolyUtilRoot.realFromAlgebraicCoefficients(GenPolynomialRing<RealAlgebraicNumber<C>> rfac, GenPolynomial<AlgebraicNumber<C>> A) Convert to RealAlgebraicNumber coefficients.static <C extends GcdRingElem<C> & Rational>
voidRootFactory.rootRefine(AlgebraicRoots<C> a, BigRational eps) Root refinement of real and complex algebraic numbers.static <C extends GcdRingElem<C> & Rational>
AlgebraicRoots<C> RootFactory.rootsOfUnity(AlgebraicRoots<C> ar) Roots of unity of real and complex algebraic numbers. -
Uses of Rational in edu.jas.ufdroot
Classes in edu.jas.ufdroot with type parameters of type RationalModifier and TypeClassDescriptionclassFactorRealAlgebraic<C extends GcdRingElem<C> & Rational>Real algebraic number coefficients factorization algorithms.