首页    期刊浏览 2024年12月01日 星期日
登录注册

文章基本信息

  • 标题:An Extension of the Steffensen Iteration and Its Computational Complexity
  • 本地全文:下载
  • 作者:Koichi KONDO ; Yoshimasa NAKAMURA
  • 期刊名称:Interdisciplinary Information Sciences
  • 印刷版ISSN:1340-9050
  • 电子版ISSN:1347-6157
  • 出版年度:1998
  • 卷号:4
  • 期号:2
  • 页码:129-138
  • DOI:10.4036/iis.1998.129
  • 出版社:The Editorial Committee of the Interdisciplinary Information Sciences
  • 摘要:An extension of the Steffensen iteration method for solving a single nonlinear equation is considered. The point is that the iteration function is defined by using the k -th Shanks transform. The convergence rate is shown to be of order k +1. The use of ε -algorithm avoids the direct calculation of Hankel determinants, which appear in the Shanks transform, and then diminishes the computational complexity. For a special case of the Kepler equation, it is shown that the numbers of mappings are actually decreased by the use of the extended Steffensen iteration.
  • 关键词:Steffensen iteration;Shanks transform;ε-algorithm;Newton method;computational complexity
国家哲学社会科学文献中心版权所有