PolynomialTraits_d::PolynomialSubresultants

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

PolynomialTraits_d::PolynomialSubresultants

Note: This functor is optional!

Definition

Computes the polynomial subresultant of two polynomials p and q of type PolynomialTraits_d::Polynomial_d with respect to outermost variable. Let p= ∑_{i=0, … ,n}p _i xⁱ and q= ∑_{i=0, … ,m}q _i xⁱ, where x is the outermost variable. The i-th subresultant (with i=0, … ,min {n,m}) is defined by

where p_i and q_i are set to zero if i<0. In the case that n=m, Sres_n is set to q.

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

Refines

AdaptableBinaryFunction
CopyConstructible
DefaultConstructible

Operations

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

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