|
7.7.3.0. annfs
Procedure from library dmod.lib (see dmod_lib).
- Usage:
- annfs(f [,S,eng]); f a poly, S a string, eng an optional int
- Return:
- ring
- Purpose:
- compute the D-module structure of basering[1/f]*f^s with the algorithm
given in S and with the Groebner basis engine given in "eng"
- Note:
- activate the output ring with the
setring command.
String S; S can be one of the following:
'bm' (default) - for the algorithm of Briancon and Maisonobe,
'ot' - for the algorithm of Oaku and Takayama,
'lot' - for the Levandovskyy's modification of the algorithm of OT.
If eng <>0, std is used for Groebner basis computations,
otherwise and by default slimgb is used.
In the output ring:
- the ideal LD (which is a Groebner basis) is the needed D-module structure,
- the list BS contains roots and multiplicities of a BS-polynomial of f.
- Display:
- If
printlevel =1, progress debug messages will be printed,
if printlevel >=2, all the debug messages will be printed.
Example:
|