J4 ›› 2010, Vol. 45 ›› Issue (12): 106-111.

• Articles • Previous Articles     Next Articles

Optimizations of  regular and simple system algorithms

JIN Meng   

  1. School of Mathematics and Systems Science, Key Laboratory of Mathematics, Informatics and Behavioral Semantics, Ministry of Education, Beihang University, Beijing 100191, China
  • Received:2009-08-04 Online:2010-12-16 Published:2011-03-16

Abstract:

 Algorithms RegSer and SimSer are improved which are presented by Wang Dongming for computing a finite set of regular/simple systems from a given set/system [P,Q] of multivariate polynomials. A new strategy for triangular decomposition is given. A series of fine triangular systems are computed such that the union of the zero sets of the fine systems is equal to that of [P, Q]. It is checked if each fine triangular system is regular. If some fine triangular system is not, a series of regular systems are computed for it. Simple systems are analogously obtained. The new algorithms are implemented in Maple, the efficiency of the routines is better than RegSer/SimSer which is shown by experimental results.

Key words: algorithm; triangular decomposition; regular system; simple system; Maple

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!