Generalized fibonacci and lucas sequences and rootfinding methods

Joseph B. Muskat

Research output: Contribution to journalArticlepeer-review

29 Scopus citations

Abstract

Consider the sequences (Un) and (vn) generated by un+x = pun - qun-X and vn+x = pvn - qvn-X, n > 1, where Uq = 0, ux = 1, v0 = 2, vx = p, with p and q real and nonzero. The Fibonacci sequence and the Lucas sequence are special cases of (um) and (vm), respectively. Define rn = un+j/un, Rn = vn+d/vn, where d is a positive integer. McCabe and Phillips showed that for d = 1, applying one step of Aitken acceleration to any appropriate triple of elements of (rn) yields another element of (un). They also proved for d = 1 that if a step of the Newton-Raphson method or the secant method is applied to elements of (r„) in solving the characteristic equation x2 - px + q = 0, then the result is an element of (rn). The above results are obtained for d > 1. It is shown that if any of the above methods is applied to elements of (Rn), then the result is an element of (vn). The application of certain higher-order iterative procedures, such as Halley’s method, to elements of (rn) and (Rn) is also investigated.

Original languageEnglish
Pages (from-to)365-372
Number of pages8
JournalMathematics of Computation
Volume61
Issue number203
DOIs
StatePublished - Jul 1993

Fingerprint

Dive into the research topics of 'Generalized fibonacci and lucas sequences and rootfinding methods'. Together they form a unique fingerprint.

Cite this