代数数根界的一个有效算法及其实现

AN EFFECTIVE ALGORITHM FOR THE ROOT BOUND OF THE ALGEBRAIC EXPRESSION AND ITS REALIZATION

得出了代数数根界的一个基于结式的有效实现算法 ,并且已用计算机代数系统MAPLE在微机上实现。用这种新的实现算法 ,计算了文献 [1,7]中的几个代数表达式的根界。数值结果表明 ,它比Scheinerman在文献 [1]中所给出的根界以及BFMS界[2 ]

In this paper, we have given a new effective algorithm for root bound of the algebraic expression based on the resultant of the algebraic polynomial, also, with MAPLE′s help, we have realized this new algorithm in our microcomputer. Using this new algorithm, we have calculated some example from E. R. Scheinerman and Chen Li, Chee Yap. The result have indicated that our new algorithm is much better than the others.