Changeset eb0206 in git


Ignore:
Timestamp:
Apr 24, 2006, 6:00:14 PM (17 years ago)
Author:
Viktor Levandovskyy <levandov@…>
Branches:
(u'spielwiese', 'f6c3dc58b0df4bd712574325fe76d0626174ad97')
Children:
95436ea6ce20f77e2d84e839fce6c9dacc7e905e
Parents:
ff89aa844cb04cbe6032cb5a00457f30b8b286ab
Message:
*levandov: docu related minor changes


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

Legend:

Unmodified
Added
Removed
  • Singular/LIB/dmod.lib

    rff89aa8 reb0206  
    11///////////////////////////////////////////////////////////////////////////////
    2 version="$Id: dmod.lib,v 1.1 2006-04-03 20:44:02 levandov Exp $";
     2version="$Id: dmod.lib,v 1.2 2006-04-24 16:00:14 levandov Exp $";
    33category="Noncommutative";
    44info="
    55LIBRARY: dmod.lib     Algorithms for algebraic D-modules
    66AUTHORS: Viktor Levandovskyy,     levandov@mathematik.uni-kl.de
    7          Jorge Martin Morales,      jorge@unizar.es
     7@*         Jorge Martin Morales,      jorge@unizar.es
    88
    99THEORY: Given a polynomial ring R = K[x_1,...,x_n] and a polynomial F in R, one is interested in the ring R[1/F^s] for a natural number s.
     
    6161@*       If eng <>0, @code{std} is used for Groebner basis computations,
    6262@*       otherwise (and by default) @code{slimgb} is used.
    63 @*       If printlevel=1, pogress debug messages will be printed,
     63@*       If printlevel=1, progress debug messages will be printed,
    6464@*       if printlevel>=2, all the debug messages will be printed.
    6565EXAMPLE: example annfsBM; shows examples
     
    337337@*       If eng <>0, @code{std} is used for Groebner basis computations,
    338338@*       otherwise (and by default) @code{slimgb} is used.
    339 @*       If printlevel=1, pogress debug messages will be printed,
     339@*       If printlevel=1, progress debug messages will be printed,
    340340@*       if printlevel>=2, all the debug messages will be printed.
    341341EXAMPLE: example annfsOT; shows examples
     
    697697@*       If eng <>0, @code{std} is used for Groebner basis computations,
    698698@*       otherwise (and by default) @code{slimgb} is used.
    699 @*       If printlevel=1, pogress debug messages will be printed,
     699@*       If printlevel=1, progress debug messages will be printed,
    700700@*       if printlevel>=2, all the debug messages will be printed.
    701701EXAMPLE: example annfsgms; shows examples
     
    11031103"
    11041104{
    1105   if ( (typeof(M) != "ideal") || (typeof(M) != "module") || (typeof(M) != "matrix"))
    1106   {
     1105  if ( (typeof(M) != "ideal") && (typeof(M) != "module") && (typeof(M) != "matrix") )
     1106  {
     1107  //  print(typeof(M));
    11071108    ERROR("an argument of type ideal/module/matrix expected");
    11081109  }
     
    11201121  ring R = 0,(x,y),dp;
    11211122  poly F = x*y*(x+y);
    1122   def A = annfs(F,0);
     1123  def A = annfsBM(F,0);
    11231124  setring A;
    11241125  LD;
Note: See TracChangeset for help on using the changeset viewer.