include/realroot/polynomial_glue.hpp

Go to the documentation of this file.

#ifndef realroot_polynomial_glue_hpp
#define realroot_polynomial_glue_hpp
#include <basix/mmx_syntax.hpp>
#include <realroot/polynomial.hpp>
#include <realroot/ring_monomial_tensor.hpp>
#include <realroot/subresultant.hpp>
#define TMPL template <class C, class V, class W>
#define WVW  with<V,W>
#define Polynomial polynomial<C, WVW >
//======================================================================
namespace mmx {
  TMPL unsigned hash(const Polynomial& p){ return 1;}
  TMPL unsigned exact_hash(const Polynomial& p){ return 1;}
  TMPL unsigned soft_hash(const Polynomial& p){ return 1;}
  TMPL bool exact_eq(const Polynomial& p, const Polynomial& q){ return p==q;}
  TMPL bool exact_neq(const Polynomial& p, const Polynomial& q){ return p!=q;}
  
  TMPL syntactic flatten(const Polynomial& p) {
    return flatten(p.rep());
  }

  TMPL Polynomial diff(const Polynomial& p, const generic& v) {
    char *x= as_charp(as_mmx(v));
    int i= Polynomial::Ring::vars()[x];
    free_charp (x);
    return diff(p, i);
  }
  
  TMPL vector<generic>
  polynomial_sturm_sequence(const Polynomial& p, const Polynomial& q, int v)
  {
    vector<generic> res;

    Seq<Polynomial> lp = coefficients(p,v);
    vector<generic> vp;
    for (unsigned j=0;j<lp.size();j++)
      vp << as<generic>(lp[j]);
    res << as<generic>(vp);

    Seq<Polynomial> lq = coefficients(q,v);
    vector<generic> vq;
    for (unsigned j=0;j<lq.size();j++)
      vq << as<generic>(lq[j]);
    res << as<generic>(vq);
    
    Seq< Seq<Polynomial> >  s = sub_resultant<euclidean>::sequence(p,q,v);
    for(unsigned i=0;i<s.size();i++) {    
      Seq<Polynomial> ri = s[s.size()-i-1];
      vector<generic> vi;
      for (unsigned j=0;j<ri.size();j++)
        vi << as<generic>(ri[j]);
      res << as<generic>(vi);
    }
    return res;
  } 

  TMPL Polynomial
  polynomial_resultant(const Polynomial& p, const Polynomial& q, int v)
  {
    Seq< Seq<Polynomial> >  s = sub_resultant<euclidean>::sequence(p,q,v);

    Polynomial r;
    return (s[0])[0];
  }


 TMPL Polynomial
 polynomial_gcd(const Polynomial& p, const Polynomial& q, int v)
{


    return p;
}







} //namespace mmx
//======================================================================
#undef TMPL
#undef Polynomial
#endif //realroot_polynomial_glue_hpp

---