#include <contfrac_lowerbound.hpp>
|
| template<typename Poly > |
| Poly::value_type | lower_bound (const Poly &f) |
| |
A lower bound using the Bernstein representation of the polynomial. The idea is to compute the Bernstein form of the polynomial over the positive axis and find the least positive intersection point of the convex hull with the axis. From the convex hull property it follows that this quantity is a lower bound on the positive roots of the polynomial. The value returned is the floor of the intersection point.
template<typename Poly >
| Poly::value_type mmx::BezierBound::lower_bound |
( |
const Poly & |
f | ) |
|
|
inline |
The documentation for this struct was generated from the following file: