Changeset a2c07bb in git for libpolys

Timestamp:

Jun 17, 2022, 6:56:53 PM (23 months ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

8d8c973f1674602e68bdfd36d9a67586050f47bdce7435b23b44b6987cf9629684c88b0d33c063fd

Parents:

148c3f7df007ca33811e5be36a569846dac3703a

Message:

opt: id_DelDiv

File:

• libpolys/polys/simpleideals.cc (modified) (3 diffs)

libpolys/polys/simpleideals.cc

@@ -349 +349 @@
 }
 
+/// delete id[j], if LT(j) == coeff*mon*LT(i) (j>i)
+static void id_DelDiv_SEV(ideal id, int k,const ring r)
+{
+  int kk = k;
+  long *sev=(long*)omAlloc0((k+1)*sizeof(long));
+  for (int i=0; i<=k; i++)
+  {
+    if(id->m[i]!=NULL)
+      sev[i]=p_GetShortExpVector(id->m[i],r);
+  }
+  for (int i=0; i<k; i++)
+  {
+    if (id->m[i] != NULL)
+    {
+      poly m_i=id->m[i];
+      for (int j=i+1; j<=k; j++)
+      {
+        if (id->m[j]!=NULL)
+        {
+          if (p_LmShortDivisibleBy(m_i, sev[i],r, id->m[j],~sev[j],r))
+          {
+            p_Delete(&id->m[j],r);
+          }
+          else if (p_LmShortDivisibleBy(id->m[j],sev[j],r, m_i,~sev[i],r))
+          {
+            p_Delete(&id->m[i],r);
+            break;
+          }
+        }
+      }
+    }
+  }
+  omFreeSize(sev,(kk+1)*sizeof(long));
+}
+
 /// delete id[j], if LT(j) == coeff*mon*LT(i) and vice versa, i.e.,
 /// delete id[i], if LT(i) == coeff*mon*LT(j)
@@ -386 +421 @@
   {
     /* the case of a coefficient field: */
+    if (k>10)
+    {
+      id_DelDiv_SEV(id,k,r);
+      return;
+    }
     for (i=k-1; i>=0; i--)
     {
@@ -413 +453 @@
 void id_DelDiv_Sorted(ideal id, const ring r)
 {
-  id_Test(id, r);
-
   int k = IDELEMS(id)-1;
-  for (int i=0; i<k; i++)
-  {
-    if (id->m[i] != NULL)
-    {
-      poly m_i=id->m[i];
-      for (int j=i+1; j<=k; j++)
-      {
-        if (id->m[j]!=NULL)
-        {
-          if (p_LmDivisibleByNoComp(m_i, id->m[j],r))
-          {
-            p_Delete(&id->m[j],r);
-          }
-          else if (p_LmDivisibleByNoComp(id->m[j], m_i,r))
-          {
-            p_Delete(&id->m[i],r);
-            break;
-          }
-        }
-      }
-    }
-  }
+  id_DelDiv_SEV(id,k,r);
 }