app/solver_bb_mod.cpp

Go to the documentation of this file.

//#define DEB
//#define mymod
using namespace std;
#include<sys/time.h>
struct timeval initclock,tmpclock;      
double tempsdssdp=0;
double tempsCDSP=0;
//#define min
#include<gmpxx.h>
#include"borderbasix/arithm/bignum.H"
#include"borderbasix/arithm/Zp.H"
#include <iostream>
#include<stdio.h>
#include<list>
#include<vector>
#include<map>
#include "borderbasix/mpoly.H"
#include <time.h>

#ifdef mymod
#include"Phtmod.cc"
#endif

//#define oldppcm
//#define dimpos
//#define experiment
//#define projfast
//#define AFFICHE
#define nored
#define REALSOLVE
#define unimul
#define uninf
//#define plus2
//#define plus4
#ifndef NO_CHOICE
#define choice_grevlex choice
#endif
//dm -0.00198708
//#define RS_OUT
//#define GROEBNER 
#define COMPUTE_MAT
#define NBDIGITS 160
#define MON_PREMIER 32051 //12007
#ifndef NO_CHOICE
#define COEFF Z<MON_PREMIER,short int> //Scl<MPF>//long double//Scl<MPF>//long double//Z<MON_PREMIER, short int>//long double
#else
#define COEFF QQ
#endif

#define PETITFERMAT
#define NEED_INIT_ELEM
//#define NO_TWICE
//#define NO_TWICE_FALL
//#define DENSE
#define sparse2
#define GOTZMANN
//#define sdp sdp
#define WORKSPACE
//#define tableop
//#define BONRAJOUT
//#define FAST
//#define LAMBDA
#ifdef RS_OUT
#include "rs2.cc"
#endif

typedef Monom<COEFF , //dynamicexp<'x'> > Mon;
              numexp<'x',7, long long > > Mon;
typedef Mon mon;
#include "borderbasix/dlexorder.cc"
typedef MPoly<vector<Mon>, my_Dlex<Mon> > Poly;

#include"borderbasix/general.h"
#include"borderbasix/arithm/zpspecial.cc"
typedef Base<predicat<mon> > typB;
typedef predicat<mon> typpredicat;


#ifdef mymod
#include"borderbasix/dpivmacrev_z.cc"
#endif

#ifdef REALSOLVE
//#include"eigen.cc"
//#include"clapack/util/dlamch.mpfclass.c"
#include"borderbasix/post_treatment/resolve2.cc"
//#include"clapack/complex16/zlartg.mfpclass.c"

#endif

#ifdef dimpos
#include "dimpos.cc"
#endif

#ifdef SYMBO
#include"post_treatment/symbo2.cc"
#endif

int main(int argc,char** argv)
{
#ifdef tableop
  inittableop();
#endif
#ifdef mymod
  macrev_Z dummy;
  dummy.init_Z("32051");
#endif
  list<harewell<COEFF> > lmat;
  list<mon> stockmon;
#ifndef DENSE
  monomial_server<mon,pol<mon,COEFF> > serv;
#endif
  FILE *fic;
  list<Poly> toto;
  list<dumpstruct<pol<mon,COEFF> > > dump;
  harewell<COEFF> m;
  Base<predicat<mon> > b;
  //cout<<"sizeof(long int) "<<sizeof(long int)<<endl;
  mpai_set_prec(3);
    Precision(90);
  printf("%s\n",argv[1]);fflush(stdout);
  readfile(toto,argv[1]);
  //  perturb(toto);
#ifndef DENSE
  algo<list<Poly>,list<pol<mon,COEFF> >,
    list<dumpstruct<pol<mon,COEFF> > >
    ,Base<predicat<mon> >, harewell >(toto,dump,b,serv);
#else
  algo<list<Poly>,list<pol<mon,COEFF> >,
    list<dumpstruct<pol<mon,COEFF> > >
    ,Base<predicat<mon> >, harewell >(toto,dump,b);
#endif
#ifdef AFFICHE
  //debut affichage
  int total=0;
  for(list<dumpstruct<pol<mon,COEFF> > >::iterator iter=dump.begin();
      iter!=dump.end();iter++)
    for(int i=0;i<iter->size;i++)
      {
        
        int nbzero=0;
        for(int j=0;j<iter->nf[i].size;j++)
          if(Iszero(iter->nf[i].nf[j])) nbzero++;
        cout<<invconv<Poly>(iter->nf[i])<<","<<endl;
        total+=iter->nf[i].size;
        cout<<"taille "<<iter->nf[i].size<<"nbzero "<<nbzero<<endl;     
      }
  cout<<"total place memoire "<<total<<endl; 
  //fin affichage
#endif
#ifndef DENSE
  cout<<"nb point dans quotient "<<countpoint(b,dump,serv)<<endl;
#else
  cout<<"nb point dans quotient "<<countpoint(b,dump)<<endl;
#endif

#ifndef DENSE
  //  affdebug(m);
  if(argc>2)
    {
      char nom[10];
      harewell<complex< long double> > tmp;
      //harewell<complex< mpf_class> > tmp;
      int i,j;
      list<mon>::iterator iterstock;
      computestockmon(stockmon,b,dump);
      cout<<"coputestockmon "<<stockmon.size()<<endl;
      list<harewell<mpq_t> > loclmat;
      harewell<mpq_t > tmploc;
      fic=fopen(argv[2],"w");
      for(int i=0;i<b.nbvar();i++)
        {
#ifdef SYMBO      
          tmploc= harewell<mpq_t >(stockmon.size(),stockmon.size());
#endif    
          matmul(m,i,dump,b,stockmon,serv);
          sprintf(nom,"m%d",i);
          printmatfile(m,nom,fic);
#ifdef SYMBO     
          for(int k=0;k<stockmon.size();k++)
            for(int l=0;l<stockmon.size();l++)
              harewell_set_coeff(tmploc,l,k,&m(k,l).rep());
#endif
          lmat.push_back(m);
          loclmat.push_back(tmploc);
        }
#ifdef SYMBO      
      ptpol_t *res;
      res=(ptpol_t*)malloc((b.nbvar()+1)*sizeof(ptpol_t));
      for(int i=0;i<b.nbvar()+1;i++)
        ptpol_init(res[i]);
      symbo(res,loclmat, stockmon,dump,b);
      for(int i=0;i<b.nbvar()+1;i++)
        {
          ptpol_out_str(fic,res[i]);
          fprintf(fic,";\n");
        }
#endif
#ifdef REALSOLVE

      if(argc>3)
        {
          realsolve2(lmat,b,tmp);
          printmatfile(tmp,"sol",fic);
        }
#endif
      tmp.destroystore();m.destroystore();
      fprintf(fic,"mon:=[");    
      iterstock=stockmon.begin();
      for(i=0;i<(int)(stockmon.size()-1);i++,iterstock++)
        {
          for( j=0;j<b.nbvar()-1;j++)
            fprintf(fic,"x%d^%d*",j,(int)iterstock->GetDegree(j));
          fprintf(fic,"x%d^%d,",j,(int)iterstock->GetDegree(j));
        }
      for(j=0;j<b.nbvar()-1;j++)
        fprintf(fic,"x%d^%d*",j,(int)iterstock->GetDegree(j));
      fprintf(fic,"x%d^%d];\n",j,(int)iterstock->GetDegree(j));
      
      fclose(fic);
    }

#ifdef RS_OUT
  fic=fopen(argv[2],"w");
  rs_out(dump,b,fic);
#endif
  //   printdump(stdout,dump);
  
  //Liberation de la memoire
  /*#ifdef unimul 
#ifdef uninf 
   sweep(dump,b,multiple,nfmul);
#endif
#else
#ifdef unimul
   sweep(dump,b,multiple);
#else
#ifdef uninf
   sweep(dump,b,nfmul);
#else
  */
   sweep(dump,b);
   //#endif
   //#endif
   //#endif
cout<<"temps dans generickernel "<<tempsdssdp<<endl;
cout<<"temps dans CSDP "<<tempsCDSP<<endl;
#endif //DENSE
}

---