An Extension of the Steffensen Iteration and Its Computational Complexity.

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

Authors: Koichi Kondo, Yoshimasa Nakamura 

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

Recommendations

• scientific article; zbMATH DE number 1076485
• scientific article; zbMATH DE number 917815
• ICIAM/GAMM 95 Applied sciences, especially Mechanics Contributed Lecture and Poster Presentations
• On the construction of fast Steffensen-type iterative methods for nonlinear equations

zbMATH Keywords

computational complexityconvergenceHankel determinantsNewton methodShanks transformKepler equation\(\varepsilon\)-algorithmSteffensen iteration method

Mathematics Subject Classification ID

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

Cited In (1)

• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4241107)