- 7,864
- 1,602
Is there good survey of known algorithms for solving recurrence relations ?
By "solving" a recurrence relation such as a_n = \sum_{i=1}^{k} { c_k a_{n-k}}, I mean to express a_n as a function of n.
In the case that the c_i are constants the algorithm based on the "characteristic equation" can be used, but what is know about cases where the c_i are themselves functions of n ?
For example, it seems that the "next simplest" case would be where the c_i are known linear functions of n.
By "solving" a recurrence relation such as a_n = \sum_{i=1}^{k} { c_k a_{n-k}}, I mean to express a_n as a function of n.
In the case that the c_i are constants the algorithm based on the "characteristic equation" can be used, but what is know about cases where the c_i are themselves functions of n ?
For example, it seems that the "next simplest" case would be where the c_i are known linear functions of n.