solver_uv_bernstein_binary_test.cpp

#include <iostream>
#include <iomanip>
#include <realroot/GMP.hpp>
#include <realroot/IEEE754.hpp>

#include <realroot/solver_bernstein_binary.hpp>



using namespace mmx;

typedef polynomial<double      , with<Bernstein> > Polynomial;
//typedef polynomial<GMP::integer, with<MonomialTensor> > Poly;

typedef solver<double, UvBernsteinBinaryApproximate> Solver;

int main(int argc, char** argv) 
{
  typedef GMP::integer integer;
  typedef GMP::rational rational;

  Interval<double> I(-1,1);
  Seq<Interval<double> > d; d<<I;
  Polynomial p("x^8+3*x-1");
  std::cout <<"p: "<<p<< std::endl;
  std::cout <<std::setprecision(16);

  Solver::Solutions sol=Solver::solve(p);

  foreach(Solver::Cell *c, sol) 
    std::cout<< c->domain()<< std::endl;;

}