In solving many recursive problems , like Flibonakkii ,sum of fib products , Tribonacci we can make use of matrix exponentiation . This can be done only after constructing the base matrices .
Please help me finding how to construct the base matrix for any recursive relation . ?
1 1
1 0
You may like to go through this blog. It systematically goes from formally formulating the problem statement to determining the base or transformation matrix to finally use exponentiation by squaring to get the desired result.
How to to solve recurrence relation
t(n)=2t(n-1) + 3t(n-2)
using matrix exponential method.
t(2)=12,t(3)=24.
It works only for Fibonacci series …!