Is there good survey of known algorithms for solving recurrence relations ?(adsbygoogle = window.adsbygoogle || []).push({});

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].

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# A Algorithms for solving recurrence relations?

Have something to add?

Draft saved
Draft deleted

Loading...

Similar Threads - Algorithms solving recurrence | Date |
---|---|

B Non-algorithmic math | Oct 13, 2017 |

I Algorithm to create a composite score | Sep 12, 2017 |

I Arm reaching algorithm determine angles | Aug 14, 2017 |

Solving a simple inequality arising from the study of algorithms -asymptotic notation | Jul 10, 2012 |

New roots solving algorithms | Jan 23, 2006 |

**Physics Forums - The Fusion of Science and Community**