基于分治策略求解方程根的个数  

Seeking for Roots of Equation Based on Strategy of Divide and Conquer

作　　者：钱萌[1] 程玉胜[1] 程树林[1] 叶敏[1] 汪智华[1] 齐乐[1] 

机构地区：[1]安庆师范学院计算机与信息学院,安徽安庆246011

出　　处：《计算机技术与发展》2006年第9期41-43,共3页Computer Technology and Development

基　　金：安徽省教育厅自然科学研究计划资助项目(2004kj265)

摘　　要：n元高次方程根的个数求解常因问题的规模过大而使通常的算法时间复杂度过高。主要介绍了基于分治策略的二分思想来降低该问题的时间复杂度,并利用哈希技术和线性冲突解决方法进一步提高求解n元高次方程根个数的算法效率。The seeking for roots of n - members hyper- polynomial equation has large time complexity due to the size of n . In this paper, the efficiency of algorithm is improved by operating of binary based on the strategy of divide and conquer as well as using the Hash table and the linear method to resolve the conflicts.

关 键 词：分治策略 哈希函数 二分法 查找 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]