Generalized Fibonacci and Lucas sequences and rootfinding methods
HTML articles powered by AMS MathViewer
- by Joseph B. Muskat PDF
- Math. Comp. 61 (1993), 365-372 Request permission
Abstract:
Consider the sequences $\{ {u_n}\}$ and $\{ {v_n}\}$ generated by ${u_{n + 1}} = p{u_n} - q{u_{n - 1}}$ and ${v_{n + 1}} = p{v_n} - q{v_{n - 1}},n \geq 1$, where ${u_0} = 0,{u_1} = 1,{v_0} = 2,{v_1} = p$ , with 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. McCabe and Phillips 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$. 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.References
- Walter Gander, On Halley’s iteration method, Amer. Math. Monthly 92 (1985), no. 2, 131–134. MR 777559, DOI 10.2307/2322644 L. E. Dickson, History of the theory of numbers, Vol. 1, Chelsea, New York, 1952.
- A. F. Horadam, Basic properties of a certain generalized sequence of numbers, Fibonacci Quart. 3 (1965), 161–176. MR 186615
- M. J. Jamieson, Fibonacci numbers and Aitken sequences revisited, Amer. Math. Monthly 97 (1990), no. 9, 829–831. MR 1080391, DOI 10.2307/2324750 D. H. Lehmer, A machine method for solving polynomial equations, J. Assoc. Comput. Mach. 8 (1961), 151-162.
- J. H. McCabe and G. M. Phillips, Aitken sequences and generalized Fibonacci numbers, Math. Comp. 45 (1985), no. 172, 553–558. MR 804944, DOI 10.1090/S0025-5718-1985-0804944-8
Additional Information
- © Copyright 1993 American Mathematical Society
- Journal: Math. Comp. 61 (1993), 365-372
- MSC: Primary 65B99; Secondary 11B39, 49M15, 65H99, 90C30
- DOI: https://doi.org/10.1090/S0025-5718-1993-1192974-3
- MathSciNet review: 1192974