The Fibonacci family of iterative processes for solving nonlinear equations

Tamara Kogan, Luba Sapir, Amir Sapir, Ariel Sapir

Research output: Contribution to journalArticlepeer-review

6 Scopus citations


This paper presents a class of stationary iterative processes with convergence order equal to the growth rate of generalized Fibonacci sequences. We prove that the informational and computational efficiency of the processes of our class tends to 2 from below. The paper illustrates a connection of the methods of the class with the nonstationary iterative method suggested by our previous paper, whose efficiency index equals to 2. We prove that the efficiency of the nonstationary iterative method, measured by Ostrowski–Traub criteria, is maximal among all iterative processes of order 2.

Original languageEnglish
Pages (from-to)148-158
Number of pages11
JournalApplied Numerical Mathematics
StatePublished - 1 Dec 2016


  • Efficiency index
  • Fibonacci sequences of higher order
  • Iterative methods
  • Order of convergence
  • Secant method

ASJC Scopus subject areas

  • Numerical Analysis
  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'The Fibonacci family of iterative processes for solving nonlinear equations'. Together they form a unique fingerprint.

Cite this