carl  24.04
Computer ARithmetic Library
Resultant.h File Reference
#include "Content.h"
#include "Degree.h"
#include "Derivative.h"
#include "Division.h"
#include "Power.h"
#include "PrimitivePart.h"
#include "Remainder.h"
#include "to_univariate_polynomial.h"
#include <list>
#include <vector>
#include "../UnivariatePolynomial.h"
Include dependency graph for Resultant.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces

 carl
 carl is the main namespace for the library.
 
 carl::resultant_debug
 

Enumerations

enum class  carl::SubresultantStrategy { carl::Generic , carl::Lazard , carl::Ducos , carl::Default = Lazard }
 

Functions

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...