D.4.4.2 PrimdecA
................
Procedure from library mprimdec.lib (see mprimdec_lib).

Usage:
PrimdecA (N[, i]); module N, int i

Return:
list l

a (not necessarily minimal) primary decomposition of N
computed by a generalized version of

the algorithm of Schimoyama/Yokoyama,

if i=1 is given, the factorizing Groebner is used

to compute the isolated primes.

Example:
LIB "mprimdec.lib";
ring r=0,(x,y,z),dp;
module N=x*gen(1)+ y*gen(2),
x*gen(1)-x2*gen(2);
list l=PrimdecA(N);
l;
==> [1]:
==>    [1]:
==>       _[1]=x*gen(1)+y*gen(2)
==>       _[2]=x*gen(2)-gen(1)
==>    [2]:
==>       _[1]=x2+y
==> [2]:
==>    [1]:
==>       _[1]=gen(2)
==>       _[2]=x*gen(1)
==>    [2]:
==>       _[1]=x
==> [3]:
==>    [1]:
==>       _[1]=y*gen(1)
==>       _[2]=y*gen(2)
==>       _[3]=x*gen(1)
==>       _[4]=x*gen(2)
==>    [2]:
==>       _[1]=y
==>       _[2]=x

<font size="-1">
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; User manual for <a href="http://www.singular.uni-kl.de/"><i>Singular</i></a> version 2-0-4, October 2002,
generated by <a href="http://www.gnu.org/software/texinfo/"><i>texi2html</i></a>.
</font>

</body>
</html>
