Abstract:

This paper provides two kinds of algorithms on GCD of polynomial system on the basis of  the parallel technology, gives the pseudo-code representation on the algorithms, proves the feasibility on them, and obtains the programs and presents computing examples for symbolic computation. The algorithms are direct, parallel, and exact. So they are different from the indirect ones by the polynomial pair, they are faster than the serial ones, and they can be used both symbolic and numerical computations. Moreover, this paper improves the existing pseudocode system, obtains a new pseudocode system, and provides its application.

Key words: polynomial system, greatest common divisor, parallel algorithm, pseudocode system