A fast algorithm for computing large Fibonacci numbers (Q294835)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	A fast algorithm for computing large Fibonacci numbers	scientific article

Statements

scholarly article

A fast algorithm for computing large Fibonacci numbers (English)

Information Processing Letters

publication date

16 June 2016

full work available at URL

http://www.sciencedirect.com/science/article/pii/S0020019000001125?np=y

zbMATH Keywords

program derivation

Fibonacci numbers

Daisuke A. Takahashi

MaRDI profile type

MaRDI publication profile

An Algorithm for the Machine Calculation of Complex Fourier Series

Computing sums of order-k Fibonacci numbers in log time

A Fast Algorithm for Computing Order-K Fibonacci Numbers

Computing Fibonacci numbers (and similarly defined functions) in log time

A presentation of the Fibonacci algorithm

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

On the number of arithmetical operations for finding Fibonacci numbers

Fast multiplication of large numbers

An interative program to calculate Fibonacci numbers in O(log n) arithmetic operations

An \(O(\log n)\) algorithm for computing the \(n\)th element of the solution of a difference equation

Identifiers

zbMATH Open document ID

10.1016/S0020-0190(00)00112-5

Mathematics Subject Classification ID

zbMATH DE Number

Sitelinks

Mathematics(1 entry)

mardi Publication:294835

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q294835&oldid=36838900"