Changeset 7475b3f in git


Ignore:
Timestamp:
Dec 31, 2000, 3:02:05 AM (23 years ago)
Author:
Gert-Martin Greuel <greuel@…>
Branches:
(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
Children:
2e49a51582e5688782ab3d662b5dad70f3938d81
Parents:
bb7da752a854cf4b094e8dde30a8a98f0c5bb32f
Message:
* GMG: proc lcmP entfernt, da lcm in poly.lib dasselbe tut und lcmP duch
*      lcm ersetzt, wo es verwendet wird


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

Legend:

Unmodified
Added
Removed
  • Singular/LIB/primdec.lib

    rbb7da7 r7475b3f  
    11///////////////////////////////////////////////////////////////////////////////
    2 version="$Id: primdec.lib,v 1.81 2000-12-22 14:24:36 greuel Exp $";
     2version="$Id: primdec.lib,v 1.82 2000-12-31 02:02:05 greuel Exp $";
    33category="Commutative Algebra";
    44info="
     
    12531253   if(size(@pa)==0)
    12541254   {
    1255       return(lcmP(h));
     1255      return(lcm(h));
    12561256   }
    12571257   def bsr= basering;
     
    12591259   execute("ring @r=0,("+@pa+","+varstr(bsr)+"),(C,dp);");
    12601260   execute ("ideal @i="+@id+";");
    1261    poly @p=lcmP(@i);
     1261   poly @p=lcm(@i);
    12621262   string @ps=string(@p);
    12631263   setring bsr;
     
    12751275   pr;
    12761276}
    1277 
    12781277///////////////////////////////////////////////////////////////////////////////
    12791278
    1280 proc lcmP(ideal i)
    1281 "USAGE:   lcm(i); i list of polynomials
    1282 RETURN:  poly = lcm(i[1],...,i[size(i)])
    1283 NOTE:
    1284 EXAMPLE: example lcm; shows an example
    1285 "
    1286 {
    1287   int k,j;
    1288    poly p,q;
    1289   i=simplify(i,10);
    1290   for(j=1;j<=size(i);j++)
    1291   {
    1292     if(deg(i[j])>0)
    1293     {
    1294       p=i[j];
    1295       break;
    1296     }
    1297   }
    1298   if(deg(p)==-1)
    1299   {
    1300     return(1);
    1301   }
    1302   for (k=j+1;k<=size(i);k++)
    1303   {
    1304      if(deg(i[k])!=0)
    1305      {
    1306         q=GCD(p,i[k]);
    1307         if(deg(q)==0)
    1308         {
    1309            p=p*i[k];
    1310         }
    1311         else
    1312         {
    1313            p=p/q;
    1314            p=p*i[k];
    1315         }
    1316      }
    1317    }
    1318   return(p);
    1319 }
    1320 example
    1321 { "EXAMPLE:"; echo = 2;
    1322    ring  r = 0,(x,y,z),lp;
    1323    poly  p = (x+y)*(y+z);
    1324    poly  q = (z4+2)*(y+z);
    1325    ideal l=p,q;
    1326    poly  pr= lcmP(l);
    1327    pr;
    1328    l=1,-1,p,1,-1,q,1;
    1329    pr=lcmP(l);
    1330    pr;
    1331 }
    1332 
    1333 ///////////////////////////////////////////////////////////////////////////////
    13341279proc clearSB (ideal i,list #)
    13351280"USAGE:   clearSB(i); i ideal which is SB ordered by monomial ordering
Note: See TracChangeset for help on using the changeset viewer.