Aitken Sequences and Generalized Fibonacci Numbers

From MaRDI portal





The starting point is the sequence \(v_ n\) satisfying a three term recurrence relation \(v_{n+1}=av_ n-bv_{n-1}\) (n\(\geq 2)\), \(v_ 1=1\) and \(v_ 2=a\). The authors prove that under suitable conditions on a,b all \(v_ n\) are different from zero and: (1) The sequence \(x_ n=v_{n+1}/v_ n\) (n\(\geq 1)\) is transformed by r-fold application of Aitken acceleration into \(x_{2^ r}.\) (2) The sequence \(t_ n\) following from application of Newton's method to solve \(x^ 2-ax+b=0\) with \(t_ 0=v_ 2/v_ 1\) satisfies \(t_ n=v_{2^ n+1}/v_{2^ n}.\) (3) The secant method to approximate a root of \(x^ 2-ax+b=0\) with \(t_ 1=a\), \(t_ 2=a-b/a\) leads to \(t_ n=v_{u_{n+1}+1}/v_{u_{n+1}}\) where \(u_ n\) is the \(n\)-th Fibonacci number. The fact that all three methods mentioned lead to a subsequence of the original sequence makes it possible to compare the performance of the method by just looking at the magnitude of the new indices.











This page was built for publication: Aitken Sequences and Generalized Fibonacci Numbers

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