On Mon, 2006-10-02 at 15:23 +0200, Samir Genaim wrote:
> Is it possible to solve a set of recurrence equations in Maxima ?,
> e.g.,
>
> a[1] = 1
> a[n] = b[n] + a[n-1]
> b[1] = 1
> b[n] = 2*b[n-1] + 1
Not always, but some systems can be solved; for instance, in the
following 2 cases:
1- The recurrence relations can be combined into a single
recurrence equation of a higher order, solvable with solve_rec.
2- As in your example, one of the equations can be solved independently
and the solution used to solve the other equation:
Solve the equation for b using solve_rec, substitute it into the
equation for a to eliminate b, and solve again using solve_rec. The
documentation for solve_rec explains very well how to solve
each equation.
Regards,
Jaime Villate