HongBound< RT > Struct Template Reference

#include <univariate_bounds.hpp>

List of all members.

Static Public Member Functions

• template<typename Poly > static RT lower_bound (const Poly &f)

---

Detailed Description

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

A lower bound based upon the upper bound given by Hong. This should be the best possible, since Hong's bound is better than Kioustelidis' bound. The problem is that it is a procedure.

Definition at line 357 of file univariate_bounds.hpp.

---

Member Function Documentation

static RT lower_bound

(

const Poly &

f

)

[inline, static]

Definition at line 360 of file univariate_bounds.hpp.

References mmx::abs(), mmx::bit_size(), mmx::degree(), mmx::univariate::degree(), and mmx::sign().

    {
      using univariate::degree;

      unsigned deg = degree(f);

      long lB=0, gB=0;
      bool localBoundSet = false, globalBoundSet = false;
      long temp, q;
      int s = sign(f[0]);
      //std::cout << "f[0]= " << f[0] << std::endl;
      for(int i= deg; i > 0; i--){
        //std::cout << "f["<< i << "]" << " = " << f[i] << std::endl;
        if(sign(f[i]) * s < 0){
          for(int k=i-1; k >= 0; k--){
            if(sign(f[k]) * s > 0){
              temp = bit_size( RT(f[i]) ) - bit_size( RT(f[k]) ) - 1;
              q = temp /(i-k);
              if(!localBoundSet || lB > q + 2){// Choose the minimum among localBounds
                localBoundSet = true;
                lB = q+2;
              }
            }
          }
          localBoundSet = false;
          if(!globalBoundSet || gB < lB){// Choose the maximum among globalBounds
            globalBoundSet = true;
            gB = lB;
          }
        }
        //std::cout << "Cout gb after " << i << " loop = "<< gB << std::endl;
      }
      if ( gB+1 < 0 ) return pow2<RT>( abs( gB+1) );
      return 0;
    }

---

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

• include/realroot/univariate_bounds.hpp