Can the unbounded knapsack problem be described as a matrix exponentiation?
For the Fibonacci sequence, the recurrence relation is linear.  That's why it can be represented as a matrix representation, i.e., using linear algebra.  If the recurrence relation isn't linear, you can't do something like that.

So, no, you can't always do that.