Changeset 20057b in git

Timestamp:

Jun 8, 1999, 5:54:46 PM (24 years ago)

Author:

Gerhard Pfister <pfister@…>

Branches:

(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')

Children:

6047f66a1c9dd5e774d56bb4724616bc964ab76c

Parents:

3375e2707f3e056d897c66030470921db73ca942

Message:

bug fixed (zero_decomp,bei  Faktorisierung feste Reihenfolge der Faktoren unterstellt, dies zunaechst auskommentiert)


git-svn-id: file:///usr/local/Singular/svn/trunk@3112 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• Singular/LIB/primdec.lib (modified) (7 diffs)

Singular/LIB/primdec.lib

@@ -1 @@
-// $Id: primdec.lib,v 1.31 1999-03-16 14:18:51 Singular Exp $
+// $Id: primdec.lib,v 1.32 1999-06-08 15:54:46 pfister Exp $
 ////////////////////////////////////////////////////////////////////////////////
 // primdec.lib                                                                //
@@ -11 +11 @@
 ////////////////////////////////////////////////////////////////////////////////
 
-version="$Id: primdec.lib,v 1.31 1999-03-16 14:18:51 Singular Exp $";
+version="$Id: primdec.lib,v 1.32 1999-06-08 15:54:46 pfister Exp $";
 info="
 LIBRARY: primdec.lib: PROCEDURE FOR PRIMARY DECOMPOSITION
@@ -491 +491 @@
          "Warning: The characteristic ist too small to use";
          "the Algorithm of Gianni/Trager/Zacharias.";
-         "The result may be wrong.";
+         "The result may be incomplete.";
          "Try primdecSY";
+         "The result may be also imcomplete.";
       }
       if (reduce(i[m]-t^e,prm,1) !=0)
@@ -714 +715 @@
 {
   def   @P = basering;
+  int uytrewq;
   int nva = nvars(basering);
   int @k,@s,@n,@k1,zz;
@@ -731 +733 @@
 
   j=interred(j);
+
   attrib(j,"isSB",1);
   if(vdim(j)==deg(j[1]))
@@ -950 +953 @@
        attrib(@qh,"isSB",1);
        ser1=phi1(ser);
+
+
        @lh=zero_decomp (@qh,phi(ser1),@wr);
 //       @lh=zero_decomp (@qh,psi(ser),@wr);
@@ -970 +975 @@
        else
        {
-          act=factor(@qh[1]);
-          if(2*size(act[1])==size(@lh))
-          {
-             for(@n=1;@n<=size(act[1]);@n++)
-             {
-                @f=act[1][@n]^act[2][@n];
-                ser1=psi(@f);
-                lres0[2*@n-1]=interred(primary[2*@k-1]+psi1(ser1));
-                helpprim=@lh[2*@n];
-                ser1=psi(helpprim);
-                lres0[2*@n]=psi1(ser1);
-             }
-          }
-          else
-          {
+          //act=factor(@qh[1]);
+          //if(2*size(act[1])==size(@lh))
+          //{
+
+         //   for(@n=1;@n<=size(act[1]);@n++)
+         //    {
+         //       @f=act[1][@n]^act[2][@n];
+         //       ser1=psi(@f);
+         //       lres0[2*@n-1]=interred(primary[2*@k-1]+psi1(ser1));
+         //       helpprim=@lh[2*@n];
+         //      ser1=psi(helpprim);
+         //       lres0[2*@n]=psi1(ser1);
+         //    }
+         // }
+         // else
+         // {
              lres1=psi(@lh);
              lres0=psi1(lres1);
-          }
+         //}
        }
        if(npars(@P)>0)