Changeset 6f2edc in git for Singular/LIB/random.lib

Timestamp:

Apr 28, 1997, 9:27:25 PM (27 years ago)

Author:

Olaf Bachmann <obachman@…>

Branches:

(u'spielwiese', 'e7cc1ebecb61be8b9ca6c18016352af89940b21a')

Children:

8c5a578cc8481c8a133a58030c4c4c8227d82bb1

Parents:

6d09c564c80f079b501f7187cf6984d040603849

Message:

Mon Apr 28 21:00:07 1997  Olaf Bachmann
<obachman@ratchwum.mathematik.uni-kl.de (Olaf Bachmann)>

     * dunno why I am committing these libs -- have not modified any
       of them


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

File:

• Singular/LIB/random.lib (modified) (15 diffs)

Singular/LIB/random.lib

@@ -1 @@
-// $Id: random.lib,v 1.1.1.1 1997-04-25 15:13:26 obachman Exp $
+// $Id: random.lib,v 1.2 1997-04-28 19:27:23 obachman Exp $
 //system("random",787422842);
-//(GMG+BM)
+//(GMG/BM, last modified 22.06.96)
 ///////////////////////////////////////////////////////////////////////////////
 
@@ -20 +20 @@
 
 proc genericid (id, list #)
-USAGE:   genericid(id,[,p,b]);  id ideal/module, p,b integers
-RETURN:  system of generators of id which are generic, sparse, trigonal linear
+USAGE:   genericid(id,[,p,b]);  id ideal/module, k,p,b integers
+RETURN:  system of generators of id which are generic, sparse, triagonal linear
          combinations of given generators with coefficients in [1,b] and
          sparsety p percent, bigger p being sparser (default: p=75, b=30000)
@@ -32 +32 @@
    if( size(#)==0 ) { int p=75; int b=30000; }
 //---------------- use sparsetriag for creation of genericid ------------------
-   def i = simplify(id,10);                          
+   def i = simplify(id,10);
    i = i*sparsetriag(ncols(i),ncols(i),p,b);
    return(i);
-}               
-example
-{ "EXAMPLE:"; echo = 2;
-   ring r=0,(t,x,y,z),ds; 
-   ideal i= x3+y4,z4+yx,t+x+y+z;          
-   genericid(i,0,10);          
-   module m=[x,0,0,0],[0,y2,0,0],[0,0,z3,0],[0,0,0,t4]; 
+}
+example
+{ "EXAMPLE:"; echo = 2;
+   ring r=0,(t,x,y,z),ds;
+   ideal i= x3+y4,z4+yx,t+x+y+z;
+   genericid(i,0,10);
+   module m=[x,0,0,0],[0,y2,0,0],[0,0,z3,0],[0,0,0,t4];
    print(genericid(m));
 }
@@ -59 +59 @@
    if( size(#)==0 ) { int k=size(id); int b=30000; }
 //--------------------------- create randomid ---------------------------------
-   def i = id;                          
+   def i = id;
    i = matrix(id)*random(b,ncols(id),k);
    return(i);
-}               
-example
-{ "EXAMPLE:"; echo = 2;
-   ring r=0,(x,y,z),dp;            
-   randomid(maxideal(2),2,9);          
-   module m=[x,0,1],[0,y2,0],[y,0,z3]; 
+}
+example
+{ "EXAMPLE:"; echo = 2;
+   ring r=0,(x,y,z),dp;
+   randomid(maxideal(2),2,9);
+   module m=[x,0,1],[0,y2,0],[y,0,z3];
    show(randomid(m));
 }
@@ -88 +88 @@
    int g=ncols(id);
    matrix rand[n][m]; matrix ra[1][m];
-   for (int k=1; k<=n; k++)
+   for (int k=1; k<=n; k=k+1)
    {
       ra = id*random(b,g,m);
@@ -102 +102 @@
    A=randommat(2,3);
    print(A);
-}               
+}
 ///////////////////////////////////////////////////////////////////////////////
 
 proc sparseid (int k, int u, list #)
 USAGE:   sparseid(k,u[,o,p,b]);  k,u,o,p,b integers
-RETURN:  ideal having k generators in each degree d, u<=d<=o, p percent of 
-         terms in degree d are 0, the remaining have random coefficients 
+RETURN:  ideal having k generators in each degree d, u<=d<=o, p percent of
+         terms in degree d are 0, the remaining have random coefficients
          in the interval [1,b], (default: o=u=d, p=75, b=30000)
 EXAMPLE: example sparseid; shows an example
@@ -119 +119 @@
 //------------------ use sparsemat for creation of sparseid -------------------
    int ii; ideal i; intmat m;
-   for ( ii=u; ii<=o; ii++) 
-   { 
+   for ( ii=u; ii<=o; ii=ii+1)
+   {
        m = sparsemat(size(maxideal(ii)),k,p,b);
        i = i+ideal(matrix(maxideal(ii))*m);
@@ -131 +131 @@
    sparseid(3,4);"";
    sparseid(2,2,5,90,9);
-}               
+}
 ///////////////////////////////////////////////////////////////////////////////
 
@@ -153 +153 @@
    if( p<40 )
    {
-      for( ii=1; ii<=t; ii++ )
+      for( ii=1; ii<=t; ii=ii+1 )
       { r=( random(1,100)>p ); v[1,ii]=r*random(1,b); h=h+r; }
    }
@@ -173 +173 @@
 example
 { "EXAMPLE:"; echo = 2;
-   sparsemat(5,5);
-   sparsemat(5,5,95);
-   sparsemat(5,5,5);
+   sparsemat(5,5);"";
+   sparsemat(5,5,95);"";
+   sparsemat(5,5,5);"";
    sparsemat(5,5,50,100);
-}               
+}
 ///////////////////////////////////////////////////////////////////////////////
 
@@ -183 +183 @@
 USAGE:   sparsepoly(u[,o,p,b]);  u,o,p,b integers
 RETURN:  poly having only terms in degree d, u<=d<=o, p percent of the terms
-         in degree d are 0, the remaining have random coefficients in [1,b), 
+         in degree d are 0, the remaining have random coefficients in [1,b),
          (defaults: o=u=d, p=75, b=30000)
 EXAMPLE:  example sparsepoly; shows an example
@@ -194 +194 @@
    int ii; poly f;
 //----------------- use sparseid for creation of sparsepoly -------------------
-   for( ii=u; ii<=o; ii++ ) { f=f+sparseid(1,ii,ii,p,b)[1]; }
+   for( ii=u; ii<=o; ii=ii+1 ) { f=f+sparseid(1,ii,ii,p,b)[1]; }
    return(f);
 }
@@ -202 +202 @@
    sparsepoly(5);"";
    sparsepoly(3,5,90,9);
-}               
+}
 ///////////////////////////////////////////////////////////////////////////////
 
@@ -222 +222 @@
    if( n<=m ) { min=n-1; M[n,n]=1; }
    else { min=m; }
-   for( ii=1; ii<=min; ii++ )
+   for( ii=1; ii<=min; ii=ii+1 )
    {
       l=r+1; r=r+n-ii;
@@ -231 +231 @@
 example
 { "EXAMPLE:"; echo = 2;
-   sparsetriag(5,7);
-   sparsetriag(7,5,90);
-   sparsetriag(5,5,0);
+   sparsetriag(5,7);"";
+   sparsetriag(7,5,90);"";
+   sparsetriag(5,5,0);"";
    sparsetriag(5,5,50,100);
-}               
-///////////////////////////////////////////////////////////////////////////////
+}
+///////////////////////////////////////////////////////////////////////////////