An Extension of the Steffensen Iteration and Its Computational Complexity.

DOI10.4036/IIS.1998.129zbMATH Open0938.65078OpenAlexW2059262245MaRDI QIDQ4241107

Yoshimasa Nakamura, Koichi Kondo

Publication date: 29 April 1999

Published in: Interdisciplinary Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4036/iis.1998.129

zbMATH Keywords

computational complexityconvergenceNewton methodShanks transformHankel determinantsKepler equation\(\varepsilon\)-algorithmSteffensen iteration method

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

Unnamed Item

This page was built for publication: An Extension of the Steffensen Iteration and Its Computational Complexity.