Changeset 1e5a2f in git for Singular

Timestamp:

Jan 30, 2024, 3:33:44 PM (4 months ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'spielwiese', 'b4f17ed1d25f93d46dbe29e4b499baecc2fd51bb')

Children:

4007108a12a7a307927d3cdab13500f28250b462

Parents:

6661730666f9132b9dbe855e475650883c272a6e

Message:

divrem renaming

Location:

Singular/LIB

Files:

• hyperel.lib (modified) (13 diffs)
• pfd.lib (modified) (3 diffs)

Singular/LIB/hyperel.lib

@@ -127 +127 @@
 //====================== Remainder of a polynomial division ===================
 
-proc divrem(poly f,poly g)
-"USAGE:   divrem(f,g);  f,g poly
+proc Divrem(poly f,poly g)
+"USAGE:   Divrem(f,g);  f,g poly
 RETURN:  remainder of the division f/g
 NOTE:    Computes R, s.t. f=a*g + R, and deg(R) < deg(g)
-EXAMPLE: example divrem; shows an example
+EXAMPLE: example Divrem; shows an example
 "
 {
@@ -139 +139 @@
 { "EXAMPLE:"; echo = 2;
    ring R=0,x,dp;
-   divrem(x2+1,x2);
+   Divrem(x2+1,x2);
 }
 
@@ -174 +174 @@
       B=B+y[i]*m[i]*b[i];
    }
-   B=divrem(B,M);
+   B=Divrem(B,M);
    return(B);
 }
@@ -272 +272 @@
       N=r1*r1 + r1*r2*h-r2*r2*f;
       r[i+1]=list(N/(var(1)-P[1]),0,n[1],n[2]);
-      while ((divrem(r[i+1][1],var(1)-P[1]) ==0) and (divrem(r[i+1][2],var(1)-P[1]) ==0) and (divrem(r[i+1][3],var(1)-P[1]) ==0) and (divrem(r[i+1][4],var(1)-P[1]) ==0))
+      while ((Divrem(r[i+1][1],var(1)-P[1]) ==0) and (Divrem(r[i+1][2],var(1)-P[1]) ==0) and (Divrem(r[i+1][3],var(1)-P[1]) ==0) and (Divrem(r[i+1][4],var(1)-P[1]) ==0))
       {
           // reducing the rationl function
@@ -326 +326 @@
       k=1;
 
-      while (divrem(b[i]*b[i] + b[i] *h - f,(var(1)-P[i][1])^(P[i][3])) != 0)
+      while (Divrem(b[i]*b[i] + b[i] *h - f,(var(1)-P[i][1])^(P[i][3])) != 0)
       {
           k=k+1;   // b[i]=P[i][2];
@@ -389 +389 @@
       c=P[i][2];
       r=0,-1,1,0;
-      while (divrem(b[i]*b[i] + b[i] *h - f,(var(1)-P[i][1])^(P[i][3])) != 0)
+      while (Divrem(b[i]*b[i] + b[i] *h - f,(var(1)-P[i][1])^(P[i][3])) != 0)
       {
           k=k+1;
@@ -401 +401 @@
           Norm=r1*r1 + r1*r2*h-r2*r2*f;
           r=list(Norm/(var(1)-P[i][1]),0,n[1],n[2]);
-          while ((divrem(r[1],var(1)-P[i][1]) ==0) and (divrem(r[2],var(1)-P[i][1]) ==0) and (divrem(r[3],var(1)-P[i][1]) ==0) and (divrem(r[4],var(1)-P[i][1]) ==0))
+          while ((Divrem(r[1],var(1)-P[i][1]) ==0) and (Divrem(r[2],var(1)-P[i][1]) ==0) and (Divrem(r[3],var(1)-P[i][1]) ==0) and (Divrem(r[4],var(1)-P[i][1]) ==0))
           {
 
@@ -443 +443 @@
    poly gg=g;
    int i;
-   while ( divrem(gg,var(1)-x0) ==0 )
+   while ( Divrem(gg,var(1)-x0) ==0 )
    {
       i=i+1;
@@ -656 +656 @@
 "
 {
-   if ( deg(D[2]) >= deg(D[1]) or divrem(D[2]^2+D[2]*h-f,D[1]) != 0 )
+   if ( deg(D[2]) >= deg(D[1]) or Divrem(D[2]^2+D[2]*h-f,D[1]) != 0 )
    {
       ERROR("Pair of polynomials doesn't belong to semireduced divisor!");
@@ -705 +705 @@
    {
       a=D[1]*Q[1];
-      b=divrem( e[2]*D[1]*Q[2] + e[3]*Q[1]*D[2] ,a);
+      b=Divrem( e[2]*D[1]*Q[2] + e[3]*Q[1]*D[2] ,a);
       return(list(a,b));
    }
@@ -713 +713 @@
    poly s3=c[3];
    a=D[1]*Q[1]/c[1]^2;
-   b=divrem((s1*D[1]*Q[2] + s2*Q[1]*D[2] + s3*(D[2]*Q[2] + f))/c[1],a);
+   b=Divrem((s1*D[1]*Q[2] + s2*Q[1]*D[2] + s3*(D[2]*Q[2] + f))/c[1],a);
    return(list(a,b));
 }
@@ -746 +746 @@
    {
       N[1]=(f - N[2]*h - N[2]^2)/N[1];
-      N[2]=divrem(-h-N[2],N[1]);
+      N[2]=Divrem(-h-N[2],N[1]);
    }
    N[1]=N[1]/leadcoef(N[1]);
@@ -778 +778 @@
    list c=extgcd(D[1], 2*D[2] + h);
    poly a=D[1]*D[1]/c[1]^2;
-   poly b=divrem((c[2]*D[1]*D[2] + c[3]*(D[2]*D[2] + f))/c[1],a);
+   poly b=Divrem((c[2]*D[1]*D[2] + c[3]*(D[2]*D[2] + f))/c[1],a);
    return(cantorred(list(a,b),h,f));
 }

Singular/LIB/pfd.lib

@@ -475 +475 @@
   matrix T;
   ideal q_std = liftstd(q_denom,T);
-  list divrem = division(f,q_std);
-  poly r = divrem[2][1]/divrem[3][1,1];
+  list Divrem = division(f,q_std);
+  poly r = Divrem[2][1]/Divrem[3][1,1];
 
   if(r!=0)
@@ -486 +486 @@
   }                               // not help in the next step (alg. depend. decomposition)
 
-  matrix a = divrem[1]/divrem[3][1,1]; // now f = r + a[1,1]*q_std[1] + ... +a[m,1]*q_std[m]
+  matrix a = Divrem[1]/Divrem[3][1,1]; // now f = r + a[1,1]*q_std[1] + ... +a[m,1]*q_std[m]
   a = T*a;   // lift coefficients   ==>   now f = r + a[1,1]*q[1]     + ... +a[m,1]*q[m]
 
@@ -632 +632 @@
   matrix T;
   ideal q_std = liftstd(q_denom,T);
-  list divrem = division(f,q_std);
-  matrix a = divrem[1]/divrem[3][1,1];
-  poly r = divrem[2][1]/divrem[3][1,1]; // now f = r + a[1,1]*q_std[1] + ... +a[m,1]*q_std[m]
+  list Divrem = division(f,q_std);
+  matrix a = Divrem[1]/Divrem[3][1,1];
+  poly r = Divrem[2][1]/Divrem[3][1,1]; // now f = r + a[1,1]*q_std[1] + ... +a[m,1]*q_std[m]
   a = T*a;   // lift coefficients    ==>   now f = r + a[1,1]*q[1]     + ... +a[m,1]*q[m]