期刊文献+

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

ON THE COMPLEXITY OF A PL HOMOTOPY ALGORITHM FOR ZEROES OF POLYNOMIALS
原文传递
导出
摘要 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<sup>n</sup>+sum from k=1 to n a<sub>k</sub> z<sup>n-k</sup>. 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.
出处 《Chinese Science Bulletin》 SCIE EI CAS 1991年第6期527-528,共2页
基金 Project supported partly by the National Natural Science Foundation of China.
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部