Algorithms for solving recurrence relations?

Click For Summary

Discussion Overview

The discussion centers around algorithms for solving recurrence relations, particularly those where the coefficients are functions of n. Participants explore various methods and express interest in both theoretical and practical applications of these algorithms.

Discussion Character

  • Exploratory
  • Technical explanation
  • Mathematical reasoning

Main Points Raised

  • One participant inquires about surveys of known algorithms for solving recurrence relations, specifically when coefficients are functions of n.
  • Another participant suggests that for polynomial coefficients, one can transform the recurrence relation into an equation of formal power series by multiplying both sides by x^n and summing from n=0 to infinity.
  • A further elaboration indicates that this transformation can lead to a differential equation for the generating function f(x) = ∑ a_n x^n, using identities involving derivatives.
  • One participant shares that their interest in recurrence relations is linked to finding power series solutions to differential equations, noting that common examples involve deriving recurrence relations from differential equations.
  • A specific case of a linear recurrence relation is presented, with an explicit solution provided, but the participant notes that more complex cases, such as those involving multiple terms, pose additional challenges.
  • Concerns are raised about the convergence of solutions for certain types of recurrence relations, particularly those that may not have a strictly positive radius of convergence.

Areas of Agreement / Disagreement

Participants express various approaches to solving recurrence relations, but there is no consensus on a single method or solution. Multiple competing views and techniques are presented, reflecting the complexity of the topic.

Contextual Notes

Some limitations are noted, such as the dependence on the nature of the coefficients and the potential issues with convergence in certain cases. The discussion does not resolve these complexities.

Stephen Tashi
Science Advisor
Homework Helper
Education Advisor
Messages
7,864
Reaction score
1,605
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.
 
Mathematics news on Phys.org
For polynomial c_k, the trick is to multiply both sides by x^n and sum from n=0 to infinity, turning the recurrence relation into an equation of formal power series. Then you can turn that into a differential equation for f(x) = \sum a_nx^n (valid where the power series converges) by using such identities as <br /> n^kx^n = \left(x \frac{d}{dx}\right)^k x^n.
 
  • Like
Likes   Reactions: mfb
pasmith said:
Then you can turn that into a differential equation for f(x) = \sum a_nx^n (valid where the power series converges) by using such identities as <br /> n^kx^n = \left(x \frac{d}{dx}\right)^k x^n.

By an amusing coincidence, my interest in solving recurrence relations is prompted by the problem of solving the recurrence relations that arise in finding power series solutions to differential equations ! Common examples of that type of problem show using the D.E. to formulate the recurrence relation and then solving the recurrence relation "by inspection". So my question concerns finding a_n as an explicit function of n.
 
The case <br /> a_n = (pn + q)a_{n-1} has the explicit solution <br /> a_n = a_0\prod_{k=1}^n (pk + q). This is of course just a special case of the solution of a_n = f(n)a_{n-1} being <br /> a_n = a_0\prod_{k=1}^n f(k). So where it gets difficult is <br /> a_n = (p_1n + q_1)a_{n-1} + (p_2n + q_2)a_{n-2}. However such recurrence relations are unlikely to describe coefficients of power series solutions to differential equations as they may not have strictly positive radius of convergence.
 
  • Like
Likes   Reactions: Stephen Tashi

Similar threads

  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 18 ·
Replies
18
Views
3K
Replies
4
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
Replies
8
Views
3K
  • · Replies 0 ·
Replies
0
Views
1K
  • · Replies 8 ·
Replies
8
Views
4K
  • · Replies 3 ·
Replies
3
Views
8K
  • · Replies 5 ·
Replies
5
Views
1K