Linear Recurrences (Q7361228)
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:
AFP entry Linear_Recurrences
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear Recurrences |
AFP entry Linear_Recurrences |
Statements
12 October 2017
0 references
Manuel Eberl
0 references
Linear Recurrences (English)
0 references
Linear recurrences with constant coefficients are an interesting class of recurrence equations that can be solved explicitly. The most famous example are certainly the Fibonacci numbers with the equation f ( n ) = f ( n -1) + f ( n - 2) and the quite non-obvious closed form ( φ n - (- φ ) - n ) / √ 5 where φ is the golden ratio. In this work, I build on existing tools in Isabelle – such as formal power series and polynomial factorisation algorithms – to develop a theory of these recurrences and derive a fully executable solver for them that can be exported to programming languages like Haskell.
0 references
