Fast Computation of Fibonacci Numbers and Their Sums (Q3689237)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3912455
Language Label Description Also known as
default for all languages
No label defined
    English
    Fast Computation of Fibonacci Numbers and Their Sums
    scientific article; zbMATH DE number 3912455

      Statements

      Fast Computation of Fibonacci Numbers and Their Sums (English)
      0 references
      1985
      0 references
      computation
      0 references
      matrix method
      0 references
      algorithm
      0 references
      Fibonacci numbers
      0 references
      0 references
      Let \(f_ n\), \(n\geq -1\), be the Fibonacci sequence \((f_{-1}=0\), \(f_ 0=1)\). Using a novel matrix method the author obtains the relations: \(f_{2n}=f^ 2_ n+f^ 2_{n-1}\) and \(f_{2n-1}=2f_ nf_{n-1}- f^ 2_{n-1}\); by means of these he constructs an algorithm (which runs faster than \textit{J. Shortt}'s one [Inf. Process. Lett. 7, 299-303 (1978; Zbl 0385.65057)] both at small n and large n) for computing the Fibonacci numbers and their sums. The running time of this is (3 log n) multiplicative and n additive operations for large and small n respectively. His matrix method can also be extended to the s-additive sequence: \(g_{-s+1}=g_{-s+2}=...=g_{-1}=0\), \(g_ 0=1\), and \(g_ n=\sum^{s}_{i=1}g_{n-i}\) for \(n>0\).
      0 references

      Identifiers