Package cc.redberry.rings.poly.univar
Class UnivariateResultants.PolynomialRemainderSequence<E>
- java.lang.Object
-
- cc.redberry.rings.poly.univar.UnivariateResultants.APolynomialRemainderSequence<UnivariatePolynomial<E>>
-
- cc.redberry.rings.poly.univar.UnivariateResultants.PolynomialRemainderSequence<E>
-
- Enclosing class:
- UnivariateResultants
public abstract static class UnivariateResultants.PolynomialRemainderSequence<E> extends UnivariateResultants.APolynomialRemainderSequence<UnivariatePolynomial<E>>
Polynomial remainder sequence (PRS). It also implements abstract division rule, used to build PRS. At each step of Euclidean algorithm the polynomialsqout, rem
and coefficientsalpha, beta
are computed so thatalpha_i r_(i - 2) = quot_(i - 1) * r_(i - 1) + beta_i * r_i
where{r_i}
is PRS.
-
-
Method Summary
Modifier and Type Method Description List<E>
getSubresultants()
Gives a list of scalar subresultant where i-th list element is i-th subresultant.E
resultant()
Resultant of initial polynomials-
Methods inherited from class cc.redberry.rings.poly.univar.UnivariateResultants.APolynomialRemainderSequence
gcd, lastRemainder, size
-
-