...
首页> 外文期刊>Journal of Computational and Applied Mathematics >On the new fourth-order methods for the simultaneous approximation of polynomial zeros
【24h】

On the new fourth-order methods for the simultaneous approximation of polynomial zeros

机译:关于多项式零点同时逼近的新四阶方法

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

摘要

A new iterative method of the fourth-order for the simultaneous determination of polynomial zeros is proposed. This method is based on a suitable zero-relation derived from the fourth-order method for a single zero belonging to the Schr?der basic sequence. One of the most important problems in solving polynomial equations, the construction of initial conditions that enable both guaranteed and fast convergence, is studied in detail for the proposed method. These conditions are computationally verifiable since they depend only on initial approximations, the polynomial coefficients and the polynomial degree, which is of practical importance. The construction of improved methods in ordinary complex arithmetic and complex circular arithmetic is discussed. Finally, numerical examples and the comparison with existing fourth-order methods are given.
机译:提出了一种同时确定多项式零的四阶迭代方法。该方法基于从四阶方法派生的适合零关系的零关系,该零关系属于属于Schrder基本序列的单个零。对于所提出的方法,详细研究了求解多项式方程式时最重要的问题之一,即能够同时保证快速收敛的初始条件的构造。由于这些条件仅取决于初始逼近,多项式系数和多项式度,因此这些条件在计算上是可验证的,这具有实际意义。讨论了普通复数算法和复数循环算法中改进方法的构造。最后,给出了数值例子并与现有的四阶方法进行了比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号