Changeset 2d3c9b in git for Singular/LIB/primdec.lib

Timestamp:

Jul 28, 1999, 12:21:30 PM (25 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

c73fc6ebe7e6475ab239af57cc95d64e6e835d0e

Parents:

4a9fee955d9f12ad8abf329f28930bcd8ca619bc

Message:

*hannes: added flags


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

File:

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

Singular/LIB/primdec.lib

@@ -1 @@
-// $Id: primdec.lib,v 1.40 1999-07-26 13:37:49 Singular Exp $
+// $Id: primdec.lib,v 1.41 1999-07-28 10:21:30 Singular Exp $
 ////////////////////////////////////////////////////////////////////////////////
 // primdec.lib                                                                //
@@ -11 +11 @@
 ////////////////////////////////////////////////////////////////////////////////
 
-version="$Id: primdec.lib,v 1.40 1999-07-26 13:37:49 Singular Exp $";
+version="$Id: primdec.lib,v 1.41 1999-07-28 10:21:30 Singular Exp $";
 info="
 LIBRARY: primdec.lib      PROCEDURES FOR PRIMARY DECOMPOSITION
@@ -20 +20 @@
 PROCEDURES:
   primdecGTZ(I);    complete primary decomposition via Gianni,Trager,Zacharias
-  primdecSY(I);     complete primary decomposition via Shimoyama-Yokoyama
+  primdecSY(I...);  complete primary decomposition via Shimoyama-Yokoyama
   minAssGTZ(I);     the minimal associated primes via Gianni,Trager,Zacharias
-  minAssChar(I);    the minimal associated primes using characteristic sets
+  minAssChar(I...); the minimal associated primes using characteristic sets
   testPrimary(L,k); tests the result of the primary decomposition
   radical(I);       computes the radical of the ideal I
@@ -2833 +2833 @@
          if(il==1)
          {
-
-            return(radI1);
+           return(radI1);
          }
-
          I2=sat(I,radI1)[1];
 
@@ -4024 +4022 @@
 ///////////////////////////////////////////////////////////////////////////////
 
-proc primdecSY(ideal i)
-"USAGE:  primdecSY(i); i ideal
+proc primdecSY(ideal i, list #)
+"USAGE:  primdecSY(i[,c]); i ideal
+         if c=0, the given ordering of the variables is used.
+         if c=1, minAssChar tries to use an optimal ordering,
+         if c=2, minAssGTZ is used
+         if c=3, minAssGTZ and facstd is used
 RETURN:  a list, say pr, of primary ideals and their associated primes
          pr[i][1], resp. pr[i][2] is the i-th primary resp. prime component
@@ -4034 +4036 @@
 "
 {
-   return(prim_dec(i,1));
+   if (size(#)==1)
+   { return(prim_dec(i,1)); }
+   else
+   { return(prim_dec(i,#[1])); }
 }
 example
@@ -4068 +4073 @@
 
 ///////////////////////////////////////////////////////////////////////////////
-proc minAssChar(ideal i)
-"USAGE:  minAssChar(i); i ideal
+proc minAssChar(ideal i, list #)
+"USAGE:   minAssChar(i[,c]); i ideal,
+         if c=0, the given ordering of the variables is used.
+         Otherwise, the system tries to find an optimal ordering,
+         which in some cases may considerably speed up the algorithm
 RETURN:  list = the minimal associated prime ideals of i
 NOTE:    implemented for characteristic 0, works also in char k > 0,
@@ -4076 +4084 @@
 "
 {
-   return(min_ass_prim_charsets(i,1));
+  if (size(#)==1)
+  { return(min_ass_prim_charsets(i,#[1])); }
+  else
+  { return(min_ass_prim_charsets(i,1)); }
 }
 example