Derivation of an \(O(k^ 2\log n)\) algorithm for computing order-k Fibonacci numbers from the \(O(k^ 3\log n)\) matrix multiplication method
type: Item
instance of: scholarly article
title: Derivation of an \(O(k^ 2\log n)\) algorithm for computing order-k Fibonacci numbers from the \(O(k^ 3\log n)\) matrix multiplication method
zbMATH Open document ID: 0509.68032
DOI: 10.1016/0020-0190(80)90045-9
author: Alberto Pettorossi
published in: Information Processing Letters
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 11B37
zbMATH DE Number: 3804838
zbMATH Keywords: Fibonacci numbers
zbMATH Keywords: linear recurrence relations
zbMATH Keywords: iterative and recursive algorithm
zbMATH Keywords: matrix multiplication
MaRDI profile type: Publication
full work available at URL: 0020-0190(80)90045-9
OpenAlex ID: W2013785943
cites work: A Transformation System for Developing Recursive Programs
cites work: Q5595249
cites work: Deriving very efficient algorithms for evaluating linear recurrence relations using the program transformation technique
cites work: An O(log n) algorithm for computing general order-k Fibonacci numbers
description: scientific article; zbMATH DE number 3804838