《Fibonacci数的巧妙求法》的评论 http://boundary.cc/200905/smart-way-to-solve-fibonacci/ Joker Lee's Blog Sat, 29 Oct 2011 09:27:01 +0000 hourly 1 http://wordpress.org/?v=3.3.1 作者：Jackal http://boundary.cc/200905/smart-way-to-solve-fibonacci/comment-page-1/#comment-45 Jackal Tue, 07 Jul 2009 02:08:05 +0000 http://jackaldire.com/?p=25#comment-45 呵呵，原来有通解～～ 呵呵，原来有通解～～

]]> 作者：5x http://boundary.cc/200905/smart-way-to-solve-fibonacci/comment-page-1/#comment-44 5x Mon, 06 Jul 2009 05:30:01 +0000 http://jackaldire.com/?p=25#comment-44 对一般k阶常系数递推数列 f(n) = a1*f(n-1) + a2*f(n-2) + ... + ak*f(n-k) 可以构造出k阶转移矩阵: a1 a2 ... ak 1 0 ... 0 0 1 ... 0 ... 0 0 ..1 0 然后左乘初值向量(fk,f(k-1), ... f0)' 对一般k阶常系数递推数列
f(n) = a1*f(n-1) + a2*f(n-2) + … + ak*f(n-k)
可以构造出k阶转移矩阵:
a1 a2 … ak
1 0 … 0
0 1 … 0
…
0 0 ..1 0

然后左乘初值向量(fk,f(k-1), … f0)’

]]>