摘要
证明用KNA算法计算n次单零点多项式全部零点所需的多项式计值次数不超过O(n^3 log_2(n/ε)),其中ε是计算精度。
KNA algcrithm is a kind of PL homotopy methods for locating all zer-oes of polynomials. This paper shows that the cost of the algorithm finding all zeroes of a polynomial with only simple zeroes grows no faster than O (n_3log_2 (n/ε)),where n is the degree of the polynomial and ε is the compntional accuracy.
出处
《中山大学学报（自然科学版）》
CAS
CSCD
1992年第3期120-123,共4页
Acta Scientiarum Naturalium Universitatis Sunyatseni
基金
中山大学高等学术研究中心基金会
关键词
多项式
零点
计算复杂性
KNA算法
zeroes of polynomials
PL homotopy
computational complexity
