I think it is in sympy (included in Sage). I vaguely remember the question has been asked before on this list but I don't remember the exact answer. Did you look through the sage-support archive?
On Tue, Mar 13, 2012 at 9:35 AM, Kakaz <[email protected]> wrote: > Of course it should be: > a(n+1) = A*a(n) + B*b(n) > b(n+1) = C*a(n) + D*b(n) > > On Mar 13, 2:32 pm, Kakaz <[email protected]> wrote: >> Hi all! >> I would like to ask - is there possibility in Sage ( or Maxima) to >> solve first order recurrence relation given by linear system with >> several variables? >> For example: >> >> a(n+1) = A*a(n) + B*b(n) >> b(n) = C*a(n) + D*b(n) >> >> Have I find solution of linear system at first an then solve >> "separated" relation or is there a possibility to solve such system >> directly? As far as I know - rsolve from sympy - takes only one >> relation as argument. >> >> Actually I have such system with 4-variables and rational - constant >> - coefficients ... >> Thanks! >> Kazek Kurz > > -- > To post to this group, send email to [email protected] > To unsubscribe from this group, send email to > [email protected] > For more options, visit this group at > http://groups.google.com/group/sage-support > URL: http://www.sagemath.org -- To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
