Changeset 38c0dca in git

Timestamp:

Feb 12, 2002, 6:39:27 PM (21 years ago)

Author:

Mathias Schulze <mschulze@…>

Branches:

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

Children:

37c112469f189ef5a3de5e526fcf3d8aaac5210a

Parents:

6d07e39974898a3c343d0298c4eb25a179334ab7

Message:

*mschulze: gmsnf moved to kernel


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

File:

• Singular/LIB/gaussman.lib (modified) (6 diffs)

Singular/LIB/gaussman.lib

@@ -1 +1 @@
 ///////////////////////////////////////////////////////////////////////////////
-version="$Id: gaussman.lib,v 1.66 2002-02-12 14:35:24 mschulze Exp $";
+version="$Id: gaussman.lib,v 1.67 2002-02-12 17:39:27 mschulze Exp $";
 category="Singularities";
 
@@ -13 +13 @@
 PROCEDURES:
  gmsring(t,s);              Gauss-Manin connection of t with variable s
- gmsnf(p,K[,Kmax]);         Gauss-Manin connection normal form of p
- gmscoeffs(p,K[,Kmax]);     Gauss-Manin connection basis representation of p
+ gmsnf(p,K);                Gauss-Manin connection normal form of p
+ gmscoeffs(p,K);            Gauss-Manin connection basis representation of p
  monodromy(t);              Jordan data of monodromy of t
  spectrum(t);               singularity spectrum of t
@@ -211 +211 @@
 ///////////////////////////////////////////////////////////////////////////////
 
-proc gmsnf(ideal p,int K,list #)
-"USAGE:    gmsnf(p,K[,Kmax]); poly p, int K, int Kmax
-ASSUME:   basering returned by gmsring; K<=Kmax
+proc gmsnf(ideal p,int K)
+"USAGE:    gmsnf(p,K); poly p, int K
+ASSUME:   basering returned by gmsring
 RETURN:
 @format
 list nf; 
   ideal nf[1];  projection of p to gmsbasis mod s^(K+1)
-  ideal nf[2];  p=nf[1]+nf[2] mod s^(Kmax+1)
+  ideal nf[2];  p=nf[1]+nf[2]
 @end format
+NOTE:     by setting p=nf[2] the computation can be continued
 KEYWORDS: singularities; Gauss-Manin connection; Brieskorn lattice
 EXAMPLE:  example gmsnf; shows examples
 "
 {
-  int Kmax=-1;
-  if(size(#)>0)
-  {
-    if(typeof(#[1])=="int")
-    {
-      Kmax=#[1];
-      if(K>Kmax)
-      {
-        Kmax=K;
-      }
-    }
-  }
-
-  intvec v=1;
-  v[nvars(basering)]=0;
-
-  int k;
-  if(Kmax>=0)
-  {
-    p=jet(jet(p,K,v),(Kmax+1)*deg(var(1))-2*gmsmaxdeg);
-  }
-
-  ideal r,q;
-  r[ncols(p)]=0;
-  q[ncols(p)]=0;
-
-  poly s;
-  int i,j;
-  for(k=ncols(p);k>=1;k--)
-  {
-    while(p[k]!=0&&deg(lead(p[k]),v)<=K)
-    {
-      i=1;
-      s=lead(p[k])/lead(gmsstd[i]);
-      while(i<ncols(gmsstd)&&s==0)
-      {
-        i++;
-        s=lead(p[k])/lead(gmsstd[i]);
-      }
-      if(s!=0)
-      {
-        p[k]=p[k]-s*gmsstd[i];
-        for(j=1;j<=nrows(gmsmatrix);j++)
-        {
-          if(Kmax>=0)
-          {
-            p[k]=p[k]+
-              jet(jet(diff(s*gmsmatrix[j,i],var(j+1))*var(1),Kmax,v),
-                (Kmax+1)*deg(var(1))-2*gmsmaxdeg);
-          }
-          else
-          {
-            p[k]=p[k]+diff(s*gmsmatrix[j,i],var(j+1))*var(1);
-          }
-        }
-      }
-      else
-      {
-        r[k]=r[k]+lead(p[k]);
-        p[k]=p[k]-lead(p[k]);
-      }
-      while(deg(lead(p[k]))>(K+1)*deg(var(1))-2*gmsmaxdeg&&
-        deg(lead(p[k]),v)<=K)
-      {
-        q[k]=q[k]+lead(p[k]);
-        p[k]=p[k]-lead(p[k]);
-      }
-    }
-    q[k]=q[k]+p[k];
-  }
-
-  return(list(r,q));
+  return(system("gmsnf",p,gmsstd,gmsmatrix,(K+1)*deg(var(1))-2*gmsmaxdeg,K));
 }
 example
@@ -312 +242 @@
 ///////////////////////////////////////////////////////////////////////////////
 
-proc gmscoeffs(ideal p,int K,list #)
-"USAGE:    gmscoeffs(p,K[,Kmax]); poly p, int K, int Kmax
-ASSUME:   basering constructed by gmsring, K<=Kmax
+proc gmscoeffs(ideal p,int K)
+"USAGE:    gmscoeffs(p,K); poly p, int K
+ASSUME:   basering constructed by gmsring
 RETURN:
 @format
 list l; 
   matrix l[1];  gmsbasis representation of p mod s^(K+1)
-  ideal l[2];  p=matrix(gmsbasis)*l[1]+l[2] mod s^(Kmax+1)
+  ideal l[2];  p=matrix(gmsbasis)*l[1]+l[2]
 @end format
-NOTE:     by setting p=l[2] the computation can be continued up to degree 
-          at most Kmax, by default Kmax=infinity
+NOTE:     by setting p=l[2] the computation can be continued
 KEYWORDS: singularities; Gauss-Manin connection; Brieskorn lattice
 EXAMPLE:  example gmscoeffs; shows examples
 "
 {
-  list l=gmsnf(p,K,#);
+  list l=gmsnf(p,K);
   ideal r,q=l[1..2];
   poly v=1;
@@ -411 +340 @@
     k++;
     dbprint(printlevel-voice+2,"// k="+string(k));
-    l=gmscoeffs(r,k,mu+K0);
+    l=gmscoeffs(r,k);
     C,r=l[1..2];
     A0=A0+C;
@@ -436 +365 @@
   dbprint(printlevel-voice+2,"// compute matrix A of t");
   dbprint(printlevel-voice+2,"// k="+string(K+k0+1));
-  list l=gmscoeffs(r,K+k0+1,K0+k0+1);
+  list l=gmscoeffs(r,K+k0+1);
   matrix C;
   C,r=l[1..2];