mmx::AkritasBound< RT > Struct Template Reference

#include <univariate_bounds.hpp>

Static Public Member Functions
template<typename Poly >
static RT	lower_bound (const Poly &f)
template<typename Poly >
static long	lower_power_2 (const Poly &f)

Detailed Description

template<class RT>
struct mmx::AkritasBound< RT >

A time algorithm for computing a lower bound. It is based upon an upper bound by Akritas et al. that returns a value some what better than Kioustelidis' bound, but is not better than the bound by Hong. The idea is to pair the positive and negative coefficients in a certain manner. Assume the constant coefficient is not zero and there is at least one sign variation in the coefficients.

Member Function Documentation

template<class RT>

template<typename Poly >

static RT mmx::AkritasBound< RT >::lower_bound ( const Poly &  f )

inlinestatic

template<class RT>

template<typename Poly >

static long mmx::AkritasBound< RT >::lower_power_2 ( const Poly &  f )

inlinestatic

---

The documentation for this struct was generated from the following file:

• include/realroot/univariate_bounds.hpp