ON THE COMPLEXITY OF A PL HOMOTOPY ALGORITHM FOR ZEROES OF POLYNOMIALS  

作　　者：高堂安 王则柯 

机构地区：[1]Department of Computer Science, Zhongshan University, Guangzhou 510275, PRC

出　　处：《Chinese Science Bulletin》1991年第6期527-528,共2页

基　　金：Project supported partly by the National Natural Science Foundation of China.

摘　　要：A PL homotopy method （KNA method in short） was presented in Ref.[1] for the problem of locating zeroes of any polynomial of form f（z）=zⁿ+sum from k=1 to n a_k z^n-k. Due to the introduction of a perturbation term, the method gives all zeroes of a polynomial with correct multiplicities. However, there are no error estimates independent from the coefficients, and thus no results of complexity.

关 键 词：PERTURBATION polynomial ESTIMATES locating ARGUMENT instead CORRECT DESIRED labelling assume 

分 类 号：N[自然科学总论]