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