|
| template<typename Coeff > |
| std::list< UnivariatePolynomial< Coeff > > | carl::subresultants (const UnivariatePolynomial< Coeff > &pol1, const UnivariatePolynomial< Coeff > &pol2, SubresultantStrategy strategy) |
| | Implements a subresultants algorithm with optimizations described in [2] . More...
|
| |
| template<typename Coeff > |
| std::vector< UnivariatePolynomial< Coeff > > | carl::principalSubresultantsCoefficients (const UnivariatePolynomial< Coeff > &, const UnivariatePolynomial< Coeff > &, SubresultantStrategy=SubresultantStrategy::Default) |
| |
| template<typename Coeff > |
| UnivariatePolynomial< Coeff > | carl::resultant (const UnivariatePolynomial< Coeff > &, const UnivariatePolynomial< Coeff > &, SubresultantStrategy=SubresultantStrategy::Default) |
| |
| template<typename Coeff > |
| UnivariatePolynomial< Coeff > | carl::discriminant (const UnivariatePolynomial< Coeff > &, SubresultantStrategy=SubresultantStrategy::Default) |
| |
| template<typename Coeff > |
| UnivariatePolynomial< Coeff > | carl::resultant_debug::resultant_z3 (const UnivariatePolynomial< Coeff > &p, const UnivariatePolynomial< Coeff > &q) |
| | A reimplementation of the resultant algorithm from z3. More...
|
| |
| template<typename Coeff > |
| UnivariatePolynomial< Coeff > | carl::resultant_debug::eliminate (const UnivariatePolynomial< Coeff > &p, const UnivariatePolynomial< Coeff > &q) |
| | Eliminates the leading factor of p with q. More...
|
| |
| template<typename Coeff > |
| UnivariatePolynomial< Coeff > | carl::resultant_debug::resultant_det (const UnivariatePolynomial< Coeff > &p, const UnivariatePolynomial< Coeff > &q) |
| | An implementation of the naive resultant algorithm based on the silvester matrix. More...
|
| |