How to solve this kind of recurrence relation in closed form? $F(n) = aF(n-1) + bF(n-2) + cF(n-3) + dF(n-4)$

231 Views Asked by At

How to solve this recurrence relation in closed form? $$F(n) = aF(n-1) + bF(n-2) + cF(n-3) + dF(n-4)$$

I know how to solve recurrence relations for less than four calls by solving the characteristic polynomial. But are there other ways so that i don't have to solve the 4 degree characteristic polynomial to solve this recurrence relation?