PolyBoRi
nf.h
Go to the documentation of this file.
00001 /*
00002  *  nf.h
00003  *  PolyBoRi
00004  *
00005  *  Created by Michael Brickenstein on 25.04.06.
00006  *  Copyright 2006 The PolyBoRi Team. See LICENSE file.
00007  *
00008  */
00009 #include <algorithm>
00010 #include <vector>
00011 #include <queue>
00012 #include "groebner_alg.h"
00013 #if HAVE_M4RI
00014 extern "C"{
00015 #include <m4ri/config.h>
00016 #include <m4ri/m4ri.h>
00017 }
00018 #endif
00019 #ifndef PBORI_GB_NF_H
00020 #define PBORI_GB_NF_H
00021 BEGIN_NAMESPACE_PBORIGB
00022 
00023 
00024 void drawmatrix(mzd_t* mat, const char* filename);
00025 
00026 Polynomial add_up_exponents(const std::vector<Exponent>& vec);
00027 Polynomial add_up_monomials(const std::vector<Monomial>& res_vec);
00028 
00029 
00030 int select_no_deg_growth(const ReductionStrategy& strat, const Monomial& m);
00031 
00032 
00033 
00034 
00035 class LMLessCompare{
00036 public:
00037   bool operator() (const Polynomial& p1, const Polynomial& p2){
00038     return p1.lead()<p2.lead();
00039   }
00040 };
00041 
00042 const int SLIMGB_SIMPLEST=0;
00043 template<int variant> class SlimgbReduction{
00044 private:
00045   GroebnerStrategy* strat;
00046   std::priority_queue<Polynomial, std::vector<Polynomial>, LMLessCompare> to_reduce;
00047   public:
00048   std::vector<Polynomial> result;
00049 
00050   SlimgbReduction(GroebnerStrategy& strat){
00051     this->strat=&strat;
00052   }
00053   SlimgbReduction(){}
00054   void addPolynomial(const Polynomial& p);
00055   void reduce();
00056   //return zero at the end
00057   Polynomial nextResult();
00058 };
00059 template <int variant> void SlimgbReduction<variant>::addPolynomial(const Polynomial& p){
00060   if (!(p.isZero())){
00061     to_reduce.push(p);
00062   }
00063 }
00064 template <int variant> Polynomial SlimgbReduction<variant>::nextResult(){
00065   if (result.size()==0) return Polynomial();
00066   Polynomial res=result.back();
00067   result.pop_back();
00068   return res;
00069 }
00070 typedef SlimgbReduction<SLIMGB_SIMPLEST> slimgb_reduction_type;
00071 std::vector<Polynomial> parallel_reduce(std::vector<Polynomial> inp, GroebnerStrategy& strat, int average_steps, double delay_f);
00072 Polynomial red_tail(const ReductionStrategy& strat, Polynomial p);
00073 Polynomial red_tail_short(const ReductionStrategy& strat, Polynomial p);
00074 Polynomial nf3(const ReductionStrategy& strat, Polynomial p, Monomial rest_lead);
00075 Polynomial nf3_short(const ReductionStrategy& strat, Polynomial p);
00076 Polynomial ll_red_nf(const Polynomial& p,const BooleSet& reductors);
00077 
00078 Polynomial ll_red_nf_noredsb(const Polynomial& p,const BooleSet& reductors);
00079 Polynomial add_up_polynomials(const std::vector<Polynomial>& vec);
00080 Polynomial plug_1(const Polynomial& p, const MonomialSet& m_plus_ones);
00081 MonomialSet mod_mon_set(const MonomialSet& as, const MonomialSet &vs);
00082 std::vector<Polynomial> gauss_on_polys(const std::vector<Polynomial>& orig_system);
00083 Polynomial ll_red_nf_noredsb_single_recursive_call(const Polynomial& p,const BooleSet& reductors);
00084 Polynomial cheap_reductions(const ReductionStrategy& strat, Polynomial p);
00085 END_NAMESPACE_PBORIGB
00086 #endif