PolynomialTraits_d::PrincipalSubresultants

Navigation: Up Table of Contents Package Overview Bibliography Index Title Acknowledging CGAL

PolynomialTraits_d::PrincipalSubresultants

Note: This functor is optional!

Definition

Computes the principal subresultant of two polynomials p and q of type PolynomialTraits_d::Coefficient_type with respect to the outermost variable. The i-th principal subresultant, sres_i(p,q), is defined as the coefficient at tⁱ of the i-th polynomial subresultant Sres_i(p,q). Thus, it is either the leading coefficient of Sres_i, or zero in the case where its degree is below i.

The result is written in an output range, starting with the 0-th principal subresultant sres₀(p,q) ,aka as the resultant of p and q. (Note that sres₀(p,q)=Sres₀(p,q) by definition)

Refines

AdaptableBinaryFunction
CopyConstructible
DefaultConstructible

Operations

template<typename OutputIterator>
OutputIterator	fo ( Polynomial_d p , Polynomial_d q , OutputIterator out )
		computes the principal subresultants of p and q, with respect to the outermost variable. Each element is of type PolynomialTraits_d::Coefficient_type.

template<typename OutputIterator>
OutputIterator	fo ( Polynomial_d p , Polynomial_d q , OutputIterator out , int i )
		computes the principal subresultants of p and q, with respect to the variable x_i.