#include "../common/RealRoots.h"
#include "Ran.h"
#include "helper/internal.h"
#include <carl-arith/interval/Interval.h>
#include <carl-logging/carl-logging.h>
#include <carl-arith/core/Sign.h>
#include <carl-arith/poly/umvpoly/UnivariatePolynomial.h>
#include "helper/RealRootIsolation.h"
#include <map>
#include <carl-arith/poly/ctxpoly/ContextPolynomial.h>

Include dependency graph for RealRoots.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.

Functions
template<typename Coeff , typename Number = typename UnderlyingNumberType<Coeff>::type, EnableIf< std::is_same< Coeff, Number >> = dummy>
RealRootsResult< IntRepRealAlgebraicNumber< Number > >	carl::real_roots (const UnivariatePolynomial< Coeff > &polynomial, const Interval< Number > &interval=Interval< Number >::unbounded_interval())
	Find all real roots of a univariate 'polynomial' with numeric coefficients within a given 'interval'. More...

template<typename Coeff , typename Number >
RealRootsResult< IntRepRealAlgebraicNumber< Number > >	carl::real_roots (const UnivariatePolynomial< Coeff > &poly, const Assignment< IntRepRealAlgebraicNumber< Number >> &varToRANMap, const Interval< Number > &interval=Interval< Number >::unbounded_interval())
	Replace all variables except one of the multivariate polynomial 'p' by numbers as given in the mapping 'm', which creates a univariate polynomial, and return all roots of that created polynomial. More...

template<typename Coeff , typename Ordering , typename Policies >
auto	carl::real_roots (const ContextPolynomial< Coeff, Ordering, Policies > &p, const Assignment< typename ContextPolynomial< Coeff, Ordering, Policies >::RootType > &a)

Namespaces

Functions