Changeset bd0aeb in git for Singular/LIB/lejeune.lib

Timestamp:

Jun 23, 2005, 3:52:12 PM (18 years ago)

Author:

Nadine Cremer <cremer@…>

Branches:

(u'spielwiese', '8e0ad00ce244dfd0756200662572aef8402f13d5')

Children:

a868907fc6dd9b59a0d27bd87056410c92a84223

Parents:

e7ff6bef3e40732ca87472519b69d1fc7a29d922

Message:

*cremer: nothing new except for comments


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

File:

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

Singular/LIB/lejeune.lib

@@ -1 +1 @@
 
 //-*- mode:C++;-*-
-// $Id: lejeune.lib,v 1.4 2005-06-23 13:40:16 cremer Exp $
+// $Id: lejeune.lib,v 1.5 2005-06-23 13:52:12 cremer Exp $
+
 
 info="
@@ -14 +15 @@
     ringchange(i);       changes the ring to the one needed in ith step      
     plugin_coeffs(i,f)   plugs tpolys into f, up to power i
-    maxidealstep(i,N);   returns ideal needed for contraction in ith step;
+    maxidealstep(i,N);   returns ideal needed for contraction in ith step
                          N is number of variables of input f
     formaldiff(f,k);     computes the formal derivatives D_I with |I|<k
@@ -55 +56 @@
      resultdiff=resultdiff,J;
    }
-  resultdiff;~
-  export(resultdiff);
-  return(R);
+  export(resultdiff);                // exports the result
+  return(R);                         // return the ring
   
 }
@@ -66 +66 @@
 {
   def r=basering;
-  def R=ringchange(i);
-  setring R; 
+  def R=ringchange(i);              // changes the ring
+  setring R;                        // makes it new basering;
   ideal I=tpolys(i,startvar);
-  poly g=imap(r,f);
-  export(g);
-  map h=r,I;
-  ideal J=h(f);
-  export(h);
-  matrix result=coeffs(J[1],t);
-  export result;
-  return(R);
+  poly g=imap(r,f);                 // maps f to new basering
+  export(g);                        // export it
+  map h=r,I;                        // define map according to our purpose
+  ideal J=h(f);                     // gives f with power series plugged in
+  export(h);                   
+  matrix result=coeffs(J[1],t);     // gives the t-coefficients
+  export result;                    // export it i.o. to use it later on
+  return(R);                        // return ring (ring change!)
 }
 
@@ -84 +84 @@
 {
   int startvar=nvars(basering);
-  export(startvar);
+  export(startvar);         
   string str=variables(startvar,i);
-  def R=changevar(""+varstr(r)+",t,"+variables(startvar,i)+"");
-  return(R);
+  def R=changevar(""+varstr(r)+",t,"+variables(startvar,i)+"");  // change
+  return(R);                 // return the ring, needed in future proc
 }
 
@@ -101 +101 @@
      for (s=1;s<=i;s++)
      {
-       str=""+a_z(u)+"("+string(s)+")";     
-       l[(u-1)*i+s]=str;
+       str=""+a_z(u)+"("+string(s)+")"; // creates new variables    
+       l[(u-1)*i+s]=str;                // saves them in a list
      }
    } 
   //l=insert(l,"t");
-  string str1=string(l);
-  return(str1);
+  string str1=string(l);                // makes the list into a string,
+  return(str1);                         // (needed for ring change)
 }
 
 
-proc a_z (int n)                      // returns nth letter of the alphabet
+proc a_z (int n)                        // returns nth letter of the alphabet
 { 
   if((n<1)||(n>26))                     // input admissible?
@@ -127 +127 @@
 proc tpolys (int i,int k)             // constructs polynomials a(1)*t+... 
 {                                     // has to be called from tpolys
-  int s,t;                             // loop variables
+  int s,t;                            // loop variables
   int v;           
   poly sum; 
@@ -147 +147 @@
 
 
-proc maxidealstep (int i,int N)   
-{
+proc maxidealstep (int i,int N)       // returns ideal needed for 
+{                                     // differentiation in ith step
   ideal I=var(N+1+i);
   int j;