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/m4ri.h"
00016 #ifndef __M4RI_TWOPOW
00017 #define __M4RI_TWOPOW TWOPOW
00018 #endif
00019 }
00020 #endif
00021 #ifndef PBORI_GB_NF_H
00022 #define PBORI_GB_NF_H
00023 BEGIN_NAMESPACE_PBORIGB
00024 
00025 
00026 void drawmatrix(mzd_t* mat, const char* filename);
00027 
00028 Polynomial add_up_exponents(const std::vector<Exponent>& vec);
00029 Polynomial add_up_monomials(const std::vector<Monomial>& res_vec);
00030 
00031 
00032 int select_no_deg_growth(const ReductionStrategy& strat, const Monomial& m);
00033 
00034 
00035 
00036 
00037 class LMLessCompare{
00038 public:
00039   bool operator() (const Polynomial& p1, const Polynomial& p2){
00040     return p1.lead()<p2.lead();
00041   }
00042 };
00043 
00044 const int SLIMGB_SIMPLEST=0;
00045 template<int variant> class SlimgbReduction{
00046 private:
00047   GroebnerStrategy* strat;
00048   std::priority_queue<Polynomial, std::vector<Polynomial>, LMLessCompare> to_reduce;
00049   public:
00050   std::vector<Polynomial> result;
00051 
00052   SlimgbReduction(GroebnerStrategy& strat){
00053     this->strat=&strat;
00054   }
00055   SlimgbReduction(){}
00056   void addPolynomial(const Polynomial& p);
00057   void reduce();
00058   //return zero at the end
00059   Polynomial nextResult();
00060 };
00061 template <int variant> void SlimgbReduction<variant>::addPolynomial(const Polynomial& p){
00062   if (!(p.isZero())){
00063     to_reduce.push(p);
00064   }
00065 }
00066 template <int variant> Polynomial SlimgbReduction<variant>::nextResult(){
00067   if (result.size()==0) return Polynomial();
00068   Polynomial res=result.back();
00069   result.pop_back();
00070   return res;
00071 }
00072 typedef SlimgbReduction<SLIMGB_SIMPLEST> slimgb_reduction_type;
00073 std::vector<Polynomial> parallel_reduce(std::vector<Polynomial> inp, GroebnerStrategy& strat, int average_steps, double delay_f);
00074 Polynomial red_tail(const ReductionStrategy& strat, Polynomial p);
00075 Polynomial red_tail_short(const ReductionStrategy& strat, Polynomial p);
00076 Polynomial nf3(const ReductionStrategy& strat, Polynomial p, Monomial rest_lead);
00077 Polynomial nf3_short(const ReductionStrategy& strat, Polynomial p);
00078 Polynomial ll_red_nf(const Polynomial& p,const BooleSet& reductors);
00079 
00080 Polynomial ll_red_nf_noredsb(const Polynomial& p,const BooleSet& reductors);
00081 Polynomial add_up_polynomials(const std::vector<Polynomial>& vec);
00082 Polynomial plug_1(const Polynomial& p, const MonomialSet& m_plus_ones);
00083 MonomialSet mod_mon_set(const MonomialSet& as, const MonomialSet &vs);
00084 std::vector<Polynomial> gauss_on_polys(const std::vector<Polynomial>& orig_system);
00085 Polynomial ll_red_nf_noredsb_single_recursive_call(const Polynomial& p,const BooleSet& reductors);
00086 Polynomial cheap_reductions(const ReductionStrategy& strat, Polynomial p);
00087 END_NAMESPACE_PBORIGB
00088 #endif