...
首页> 外文期刊>Mathematics of computation >A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton's method
【24h】

A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton's method

机译:牛顿法寻找复杂多项式根的小概率通用起点集

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

We specify a small set, consisting of O(d(log log d)~2) points, that intersects the basins under Newton's method of all roots of all (suitably normalized) complex polynomials of fixed degrees d, with arbitrarily high probability. This set is an efficient and universal probabilistic set of starting points to find all roots of polynomials of degree d using Newton's method; the best known deterministic set of starting points consists of [1.1d(log d)~2] points.
机译:我们指定了一个由O(d(log log d)〜2)点组成的小集合,该集合在牛顿法下与固定度为d的所有(适当归一化)复多项式的所有根的根相交,且概率很高。该集合是使用牛顿法找到d级多项式的所有根的有效且通用的起点集合;最著名的确定性起点集由[1.1d(log d)〜2]个点组成。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号