Changeset 93332c in git for Singular/LIB


Ignore:
Timestamp:
Aug 5, 2004, 5:59:22 PM (20 years ago)
Author:
Hans Schönemann <hannes@…>
Branches:
(u'fieker-DuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', 'b4f17ed1d25f93d46dbe29e4b499baecc2fd51bb')
Children:
b0b7bdeafea2f16d524d312078bcb23219f9425f
Parents:
35340eda1fec349be666fea4232329107bae3a69
Message:
*hannes: lib changes


git-svn-id: file:///usr/local/Singular/svn/trunk@7331 2c84dea3-7e68-4137-9b89-c4e89433aadc
Location:
Singular/LIB
Files:
4 edited

Legend:

Unmodified
Added
Removed

  • Singular/LIB/gmssing.lib

    r35340e r93332c  
    11///////////////////////////////////////////////////////////////////////////////
    2 version="$Id: gmssing.lib,v 1.3 2004-04-22 10:50:51 Singular Exp $";
     2version="$Id: gmssing.lib,v 1.4 2004-08-05 15:59:20 Singular Exp $";
    33category="Singularities";
    44
    … …  
    121121  int gmsmaxdeg;  maximal weight of variables
    122122@end format
    123 NOTE:     gmsbasis is a C{{s}}-basis of H'' and [t,s]=s^2
     123NOTE:     gmsbasis is a C[[s]]-basis of H'' and [t,s]=s^2
    124124KEYWORDS: singularities; Gauss-Manin system; Brieskorn lattice
    125125EXAMPLE:  example gmsring; shows examples

  • Singular/LIB/hnoether.lib

    r35340e r93332c  
    1 version="$Id: hnoether.lib,v 1.38 2004-04-21 14:27:23 Singular Exp $";
     1version="$Id: hnoether.lib,v 1.39 2004-08-05 15:59:21 Singular Exp $";
    22category="Singularities";
    33info="
    … …  
    170170"
    171171{
    172  nameof(basering);
    173172 map T1 = basering,var(1),var(2)+d*var(1)^Q;
    174173 return(T1(f));

  • Singular/LIB/paramet.lib

    r35340e r93332c  
    11// last change:           17.01.2001
    22///////////////////////////////////////////////////////////////////////////////
    3 version="$Id: paramet.lib,v 1.12 2001-08-27 14:47:57 Singular Exp $";
     3version="$Id: paramet.lib,v 1.13 2004-08-05 15:59:22 Singular Exp $";
    44category="Visualization";
    55info="
    … …  
    6969      // number of necessary variables, and the information, if
    7070      // the parametrization was successful.
    71       list param=para,d,1;
     71      list @param=para,d,1;
    7272//     if (d==0)
    7373//     {
    … …  
    8282    {
    8383      setring BAS;
    84       list param=I,0,0;
     84      list @param=I,0,0;
    8585    }
    8686  }
    … …  
    8888  {
    8989    setring BAS;
    90     list param=I,0,0;
     90    list @param=I,0,0;
    9191  }
    9292  option(set,ov);
    93   return(param);
     93  return(@param);
    9494}
    9595example
    … …  
    117117  intvec ov=option(get);
    118118  option(noredefine);
    119   list primary,no,nor,para,param;
     119  list primary,no,nor,para,@param;
    120120  def BAS=basering;
    121121  int d=dim(std(I));
    … …  
    153153         // (x-a,y-b,z-c), since only then normap=(a,b,c).
    154154//       }
    155       param[ii]=inter;
     155      @param[ii]=inter;
    156156      kill inter;
    157157      setring BAS;
    … …  
    161161      setring PR;
    162162      list inter=0,0,0;
    163       param[ii]=inter;
     163      @param[ii]=inter;
    164164      kill inter;
    165165      setring BAS;
    … …  
    171171  keepring PR;
    172172  option(set,ov);
    173   return(param);
     173  return(@param);
    174174}
    175175example
    … …  
    202202    for (int ii=1; ii<=size(hn); ii++)
    203203    {
    204       para[ii]=param(hn[ii]);
     204      para[ii]=@param(hn[ii]);
    205205    }
    206206  }

  • Singular/LIB/solve.lib

    r35340e r93332c  
    11///////////////////////////////////////////////////////////////////////////////
    2 version="$Id: solve.lib,v 1.26 2003-07-18 14:13:15 Singular Exp $";
     2version="$Id: solve.lib,v 1.27 2004-08-05 15:59:22 Singular Exp $";
    33category="Symbolic-numerical solving";
    44info="
    … …  
    2929"USAGE:   laguerre_solve(f [, m, l, n, s] ); f = polynomial,@*
    3030         m, l, n, s = integers (control parameters of the method)
    31 @format
    3231 m: precision of output in digits ( 4 <= m), if basering is not ring of
    3332      complex numbers;
    … …  
    4342      current ring)
    4443 ( default: m, l, n, s = 8, 30, 1, 0 )
    45 @end format
    4644ASSUME:  f is a univariate polynomial;@*
    4745         basering has characteristic 0 and is either complex or without
    … …  
    4947RETURN:  list of (complex) roots of the polynomial f, depending on n. The
    5048         result is of type
    51 @format
    5249 string: if the basering is not complex,
    5350 number: otherwise.
    54 @end format
    5551NOTE:    If printlevel >0: displays comments ( default = 0 ).
    5652         If s != 0 and if the procedure stops with ERROR, try a higher
    … …  
    522518"USAGE:   solve(G [, m, n, l] ); G = ideal,
    523519         m, n, l = integers (control parameters of the method)
    524  @format
    525520         m: precision of output in digits ( 4 <= m) and of the
    526521            generated ring of complex numbers;
    … …  
    533528         ( default: m, n, l = 8, 0, 30 or
    534529                    for (n != 0 and size(#) = 2) l = 60 )
    535  @end format
    536530ASSUME:  the ideal is 0-dimensional;@*
    537531         basering has characteristic 0 and is either complex or
    … …  
    540534         list of complex numbers in the generated output ring (the new
    541535         basering).
    542 @format
    543536 The result is a list L
    544537    n  = 0: a list of all different solutions (L[i]),
    … …  
    547540            L[i][2] the multiplicity
    548541 L is ordered w.r.t. multiplicity (the smallest first).
    549 @end format
    550542NOTE:    If the problem is not 0-dim. the procedure stops with ERROR, if the
    551543         ideal G is not a lex. standard basis, it is generated with internal
    … …  
    11991191proc ures_solve( ideal gls, list # )
    12001192"USAGE:   ures_solve(i [, k, p] ); i = ideal, k, p = integers
    1201 @format
    12021193   k=0: use sparse resultant matrix of Gelfand, Kapranov and Zelevinsky,
    12031194   k=1: use resultant matrix of Macaulay which works only for
    … …  
    12061197          if the basering is not complex (in decimal digits),
    12071198   (default: k=0, p=30)
    1208 @end format
    12091199ASSUME:  i is a zerodimensional ideal with
    12101200         nvars(basering) = ncols(i) = number of vars
    … …  
    12121202RETURN:  list of all (complex) roots of the polynomial system i = 0; the
    12131203         result is of type
    1214 @format
    12151204   string: if the basering is not complex,
    12161205   number: otherwise.
    1217 @end format
    12181206EXAMPLE: example ures_solve; shows an example
    12191207"
    … …  
    12671255proc mp_res_mat( ideal i, list # )
    12681256"USAGE:   mp_res_mat(i [, k] ); i ideal, k integer,
    1269 @format
    12701257    k=0: sparse resultant matrix of Gelfand, Kapranov and Zelevinsky,
    12711258    k=1: resultant matrix of Macaulay (k=0 is default)
    1272 @end format
    12731259ASSUME:  The number of elements in the input system must be the number of
    12741260         variables in the basering plus one;
    … …  
    16291615proc lex_solve( ideal fi, list # )
    16301616"USAGE:   lex_solve( i[,p] ); i=ideal, p=integer,
    1631  @format
    16321617  p>0: gives precision of complex numbers in decimal digits (default: p=30).
    1633  @end format
    16341618ASSUME:  i is a reduced lexicographical Groebner bases of a zero-dimensional
    16351619         ideal, sorted by increasing leading terms.
Note: See TracChangeset for help on using the changeset viewer.