carl  24.04
Computer ARithmetic Library
RealRoots.h
Go to the documentation of this file.
1 #pragma once
2 
3 #include <carl-common/config.h>
4 
5 #ifdef USE_LIBPOLY
6 
7 #include "../common/RealRoots.h"
8 #include <carl-arith/core/Variable.h>
9 
10 #include "helper.h"
11 #include <carl-logging/carl-logging.h>
12 
13 #include <carl-arith/poly/libpoly/LPPolynomial.h>
14 
15 #include "LPRan.h"
16 
17 namespace carl {
18 
19 RealRootsResult<LPRealAlgebraicNumber> real_roots(const LPPolynomial& polynomial, const Interval<LPRealAlgebraicNumber::NumberType>& interval = Interval<LPRealAlgebraicNumber::NumberType>::unbounded_interval());
20 
21 RealRootsResult<LPRealAlgebraicNumber> real_roots(const LPPolynomial& polynomial, const std::map<Variable, LPRealAlgebraicNumber>& m, const Interval<LPRealAlgebraicNumber::NumberType>& interval = Interval<LPRealAlgebraicNumber::NumberType>::unbounded_interval());
22 
23 }
24 
25 #endif
carl-logging.h
A small wrapper that configures logging for carl.
carl
carl is the main namespace for the library.
carl::real_roots
RealRootsResult< IntRepRealAlgebraicNumber< Number > > 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'.
Definition: RealRoots.h:25
carl::Interval::unbounded_interval
static Interval< Number > unbounded_interval()
Method which returns the unbounded interval rooted at 0.
Definition: Interval.h:804