×

Generalized Fibonacci and Lucas sequences and rootfinding methods. (English) Zbl 0781.11006

Summary: Consider the sequences \(\{u_ n\}\) and \(\{v_ n\}\) generated by \(u_{n+1}= pu_ n- qu_{n-1}\) and \(v_{n+1}= pv_ n- qv_{n-1}\), \(n\geq 1\), where \(u_ 0=0\), \(u_ 1=1\), \(v_ 0=2\), \(v_ 1=p\), and \(p\) and \(q\) real and nonzero. The Fibonacci sequence and the Lucas sequence are special cases of \(\{u_ n\}\) and \(\{v_ n\}\), respectively. Define \(r_ n= u_{n+d}/u_ n\), \(R_ n= v_{n+d}/v_ n\), where \(d\) is a positive integer. J. H. McCabe and G. M. Phillips [Math. Comput. 45, 553-558 (1985; Zbl 0581.10005)] showed that for \(d=1\), applying one step of Aitken acceleration to any appropriate triple of elements of \(\{r_ n\}\) yields another element of \(\{r_ n\}\). 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_ n\}\) in solving the characteristic equation \(x^ 2-px+q=0\), then the result is an element of \(\{r_ n\}\).
The above results are obtained for \(d>1\). (For the ordinary Fibonacci numbers this was considered by M. J. Jamieson [Am. Math. Mon. 97, 829-831 (1990; Zbl 0735.11007)].) It is shown that if any of the above methods is applied to elements of \(\{R_ n\}\), then the result is an element of \(\{r_ n\}\). The application of certain higher-order iterative procedures, such as Halley’s method, to elements of \(\{r_ n\}\) and \(\{R_ n\}\) is also investigated.

MSC:

11B39 Fibonacci and Lucas numbers and polynomials and generalizations
65H05 Numerical computation of solutions to single equations
Full Text: DOI

References:

[1] Walter Gander, On Halley’s iteration method, Amer. Math. Monthly 92 (1985), no. 2, 131 – 134. · Zbl 0574.65041 · doi:10.2307/2322644
[2] L. E. Dickson, History of the theory of numbers, Vol. 1, Chelsea, New York, 1952.
[3] A. F. Horadam, Basic properties of a certain generalized sequence of numbers, Fibonacci Quart. 3 (1965), 161 – 176. · Zbl 0131.04103
[4] M. J. Jamieson, Fibonacci numbers and Aitken sequences revisited, Amer. Math. Monthly 97 (1990), no. 9, 829 – 831. · Zbl 0735.11007 · doi:10.2307/2324750
[5] D. H. Lehmer, A machine method for solving polynomial equations, J. Assoc. Comput. Mach. 8 (1961), 151-162. · Zbl 0106.10203
[6] J. H. McCabe and G. M. Phillips, Aitken sequences and generalized Fibonacci numbers, Math. Comp. 45 (1985), no. 172, 553 – 558. · Zbl 0581.10005
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.