Linear recursive sequences and powers of matrices

Publication date 20 January 2003

Published in The Fibonacci Quarterly (Search for Journal in Brave)

Cayley-Hamilton theorem characteristic polynomial generating function linear recurrence sequence power of matrix Stirling numbers

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Sequences (mod (m)) (11B50) Matrices, determinants in number theory (11C20)

Review text

The author gives basic properties for linear recursive sequences \(\{u_n(a_1, a_2,\ldots, a_n)\}\) of the form \(u_n+a_1u_{n-1}+\cdots+a_mu_{n-m}\) \((n=0, \pm 1, \pm 2,\ldots)\), \(u_{1-m}=\cdots=u_{-1}=0\), \(u_0=1\). The author also gives a formula for powers of matrices as NEWLINE\[NEWLINE A^n=\sum_{r=0}^{m-1}\left(\sum_{s=r}^{m-1}a_{s-r}u_{n-s}\right)A^r, NEWLINE\]NEWLINE where \(A\) is an \(m\times m\) matrix with characteristic polynomial \(x^m+a_1x^{m-1}+\cdots+a_m\).

Recommendations

Cited in

(24)

This page was built for publication: Linear recursive sequences and powers of matrices

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