Changeset 804d68 in git
 Timestamp:
 Jan 23, 2007, 7:27:17 PM (17 years ago)
 Branches:
 (u'fiekerDuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', 'b21a664aa22dc6e196223af8a74ad4885e83547c')
 Children:
 699567b13d1a31435754a539ed8b14924b96762b
 Parents:
 b788ab439857884880c28825ed58ad95b56e2587
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

Singular/LIB/sagbi.lib
rb788ab r804d68 1 1 ////////////////////////////////////////////////////////////////////////////// 2 version="$Id: sagbi.lib,v 1. 8 20070123 15:03:37 Singular Exp $";2 version="$Id: sagbi.lib,v 1.9 20070123 18:27:17 Singular Exp $"; 3 3 category="Commutative Algebra"; 4 4 info=" … … 8 8 9 9 PROCEDURES: 10 reduction(p,I); perform one step subalgebra reducton (for short Sreduction) of p w.r.t I10 sagbiRreduction(p,I); perform one step subalgebra reducton (for short Sreduction) of p w.r.t I 11 11 sagbiSPoly(I); compute the Spolynomials of the Subalgebra defined by the genartors of I 12 12 sagbiNF(id,I); perform iterated Sreductions in order to compute Subalgebras normal forms … … 254 254 /////////////////////////////////////////////////////////////////////////////// 255 255 256 proc reduction(poly p,ideal dom,list #)//one step Subalgebra reduction257 "USAGE: reduction(p,dom[,n]); p poly , dom ideal256 proc sagbiReduction(poly p,ideal dom,list #)//one step Subalgebra reduction 257 "USAGE: sagbiReduction(p,dom[,n]); p poly , dom ideal 258 258 RETURN: a polynomial 259 259 @format … … 262 262 n may take the values (0 or default),1 or 2. 263 263 @end format 264 EXAMPLE: reduction; show an example"264 EXAMPLE: sagbiReduction; show an example" 265 265 { 266 266 def bsr=basering; … … 387 387 ideal dom =x2,y2,xyy; 388 388 poly p=x4+x3y+xy2y2; 389 reduction(p,dom);390 reduction(p,dom,1);391 reduction(p,dom,2);389 sagbiReduction(p,dom); 390 sagbiReduction(p,dom,1); 391 sagbiReduction(p,dom,2); 392 392 } 393 393 … … 396 396 { 397 397 poly p1=p; 398 poly p2= reduction(p,dom,#);398 poly p2=sagbiReduction(p,dom,#); 399 399 while (p1!=p2) 400 400 { 401 401 p1=p2; 402 p2= reduction(p1,dom,#);402 p2=sagbiReduction(p1,dom,#); 403 403 } 404 404 return(p2); … … 412 412 while(p1!=0) 413 413 { 414 p2= reduction(p1,dom,#);414 p2=sagbiReduction(p1,dom,#); 415 415 if(p2!=p1) 416 416 {
Note: See TracChangeset
for help on using the changeset viewer.