Changeset 3da61f in git


Ignore:
Timestamp:
Jan 20, 2007, 10:20:25 PM (17 years ago)
Author:
Viktor Levandovskyy <levandov@…>
Branches:
(u'fieker-DuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', 'b21a664aa22dc6e196223af8a74ad4885e83547c')
Children:
05a31dd1bac7c8886acb526ecf5503742a948378
Parents:
2a38938492546de508a73077c8791bf124d3edd5
Message:
*levandov: docu changes, some functional changes


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

Legend:

Unmodified
Added
Removed
  • Singular/LIB/sagbi.lib

    r2a38938 r3da61f  
    11//////////////////////////////////////////////////////////////////////////////
    2 version="$Id: sagbi.lib,v 1.6 2007-01-04 12:49:27 Singular Exp $";
     2version="$Id: sagbi.lib,v 1.7 2007-01-20 21:20:25 levandov Exp $";
    33category="Commutative Algebra";
    44info="
     
    88
    99PROCEDURES:
    10  proc reduction(p,I);  Perform one step subalgebra reducton (for short S-reduction) of p w.r.t I
    11  proc sagbiSPoly(I);   Compute the S-polynomilas of the Subalgebra defined by the genartors of I
    12  proc sagbiNF(id,I);   Perform iterated S-reductions in order to compute Subalgebras normal forms
    13  proc sagbi(I);        Construct SAGBI basis for the Subalgebra defined by I
    14  proc sagbiPart(I);    Construct partial SAGBI basis for the Subalgebra defined by I
     10 reduction(p,I);  perform one step subalgebra reducton (for short S-reduction) of p w.r.t I
     11 sagbiSPoly(I);   compute the S-polynomials of the Subalgebra defined by the genartors of I
     12 sagbiNF(id,I);   perform iterated S-reductions in order to compute Subalgebras normal forms
     13 sagbi(I);        construct SAGBI basis for the Subalgebra defined by I
     14 sagbiPart(I);    construct partial SAGBI basis for the Subalgebra defined by I
    1515";
    1616
     
    7373    //==================create anew ring with extra variables================
    7474
    75     execute("ring R1="+charstr(bsr)+",("+varstr(bsr)+",@y(1..m)),(dp(n),dp(m));");
     75    execute("ring R1=("+charstr(bsr)+"),("+varstr(bsr)+",@y(1..m)),(dp(n),dp(m));");
    7676    execute("minpoly=number("+mp+");");
    7777    ideal id=imap(bsr,id);
     
    202202    //================create a new ring with extra variables==============
    203203
    204     execute("ring R1="+charstr(R)+",("+varstr(R)+",@y((ii+1)..(ii+jj))),(dp(n),dp(kk+jj-n));");
     204    execute("ring R1=("+charstr(R)+"),("+varstr(R)+",@y((ii+1)..(ii+jj))),(dp(n),dp(kk+jj-n));");
     205    // *levandov: would it not be easier and better to use
     206    // ring @Y = char(R),(@y((ii+1)..(ii+jj))),dp;
     207    // def R1 = R + @Y;
     208    // setring R1;
     209    // -> thus
    205210    ideal kern1;
    206211    ideal A=fetch(R,A);
     
    272277  if(b !=0) //means that the basering is a quotient ring
    273278  {
    274     p=reduce(p,groebner(0));
    275     dom=reduce(groebner,std(0));
     279    p=reduce(p,std(0));
     280    dom=reduce(dom,std(0));
    276281  }
    277282
     
    320325
    321326    //------------- change the basering bsr to bsr[@(0),...,@(z)] ----------
    322     execute("ring s="+charstr(basering)+",("+varstr(basering)+",@(0..z)),dp;");
     327    execute("ring s=("+charstr(basering)+"),("+varstr(basering)+",@(0..z)),dp;");
    323328    // Ev hier die Reihenfolge der Vars aendern. Dazu muss unten aber entsprechend
    324329    // geaendert werden:
     
    429434RETURN: depends On the type of id; ideal or polynomial.
    430435@format
    431     The integer k determine waht kind of s-reduction is performad:
    432     - if (k=0) no tail s-reduction is performaed.
    433     - if (k=1) tail s-reduction is perofrmed.
     436    The integer k determines what kind of s-reduction is performed:
     437    - if (k=0) no tail s-reduction is performed.
     438    - if (k=1) tail s-reduction is performed.
    434439    Three Algorthim  variants  are used to perform Subalgebra reduction.
    435440    The positive integer n determine which variant should be used.
     
    481486 poly p=x4+x2y+y;
    482487 sagbiNF(p,dom,0);
    483  sagbiNF(p,dom,1);// tail subalgebra reduction is perofrmed
     488 sagbiNF(p,dom,1);// tail subalgebra reduction is performed
    484489}
    485490
     
    512517
    513518proc sagbi(id,int k,list#)
    514 "USAGE: sagbi(id,k[,n]); id ideal, k and n positive integer.
     519"USAGE: sagbi(id,k[,n]); id ideal, k and n positive integers.
    515520RETURN: A SAGBI basis for the subalgebra defined by the generators of id.
    516521@format
    517     k determine waht kind of s-reduction is performad:
    518      - if (k=0) no tail s-reduction is performaed.
    519      - if (k=1) tail s-reduction is perofrmed, and S-intereduced SAGBI basis
     522    k determine what kind of s-reduction is performed:
     523     - if (k=0) no tail s-reduction is performed.
     524     - if (k=1) tail s-reduction is performed, and S-interreduced SAGBI basis
    520525       is returned.
    521     Three Algorthim  variants are used to perform Subalgebra reduction.
     526    Three Algorithm variants are used to perform Subalgebra reduction.
    522527    The positive interger n determine which variant should be used.
    523528    n may take the values (0 or default),1 or 2.
     
    550555proc sagbiPart(id,int k,int c,list #)
    551556"USAGE: sagbi(id,k,c[,n]); id ideal, k, c and n positive integer.
    552 RETURN: A partial SAGBI basis for the subalgebra defined by the genrators of id.
     557RETURN: A partial SAGBI basis for the subalgebra defined by the generators of id.
    553558@format
    554      should stop.k determine waht kind of s-reduction is performad:
    555      - if (k=0) no tail s-reduction is performaed.
    556      - if (k=1) tail s-reduction is perofrmed, and S-intereduced SAGBI basis
     559     should stop. k determine what kind of s-reduction is performed:
     560     - if (k=0) no tail s-reduction is performed.
     561     - if (k=1) tail s-reduction is performed, and S-intereduced SAGBI basis
    557562      is returned.
    558      c  determine; after which turn Sagbi basis computations should stop
    559      Three Algorthim  variants are used to perform Subalgebra reduction.
    560      The positive interger n determine which variant should be used.
     563     c  determines, after which turn Sagbi basis computations should stop
     564     Three Algorithm variants are used to perform Subalgebra reduction.
     565     The positive integer n determines which variant should be used.
    561566     n may take the values (0 or default),1 or 2.
    562567@end format
Note: See TracChangeset for help on using the changeset viewer.