Improvement of convergence of an iterative method for finding polynomial factors of analytic functions

Improvement of convergence of an iterative method for finding polynomial factors of analytic functions
复制标题

求解析函数多项式因子迭代法收敛性的改进

DOI:
10.1016/s0377-0427(01)00524-6
复制
发表时间:
2002
影响因子:
2.4
通讯作者:
H. Sugiura
H. Sugiura
中科院分区:
数学2区
文献类型:
--
作者:
T. Sakurai;H. Sugiura

文献摘要

被引文献

相似文献

在本文中,我们考虑一种使用复杂循环算术评估解析函数的单项因子系数的迭代方法。在之前的一篇论文中,作者提出了一种因式分解方法,该方法将一组零作为多项式因子。我们分析了该方法的收敛行为并讨论了改进收敛的技术。数值示例说明了改进方法的各个方面。
In this paper, we consider an iterative method for evaluating the coefficients of a monic factor of an analytic function using complex circular arithmetic. In a previous paper, the authors presented a factoring method that finds a cluster of zeros as a polynomial factor. We analyze the convergence behavior of this method and discuss a technique for improving convergence. Numerical examples illustrate the aspects of the improved method.