Generating recursive functions

• Subject: Generating recursive functions
• From: Richard Hennessy
• Date: Wed, 3 Sep 2008 15:45:42 -0400

I am not sure what you are asking, but try this.

g(n):=block(for i : 1 thru n do (X[i]:A[i].X[i-1]+F[i]));

g(100); <-plug in your number of iterations

Rich

------------Original Message------------
From: sahutoglu sonmez <sahutsonmez at yahoo.com>
To: "maxima" <maxima at math.utexas.edu>
Date: Wed, Sep-3-2008 3:29 PM
Subject: Generating recursive functions
Hi,
First thanks for the wonderful program. 

I am trying to generate recursive functions. That is, let say I have a recursion $X_n=A_nX_{n-1}+F_n$ where X_n and F_n are vector functions and A_n is a matrix. 
Furthermore, let say I know $X_04 and $F_n$ for all n. How do use Maxima to write a loop or a procedure to find $X_n$ for all n?

Thanks.


===========================================================
     Sonmez Sahutoglu  

_______________________________________________ 
Maxima mailing list 
Maxima at math.utexas.edu 
http://www.math.utexas.edu/mailman/listinfo/maxima 

• Prev by Date: Maxima/Ecl on 32-bit machine cannot evaluate "apply(union, listify({{..}}))"
• Next by Date: segmentation fault with Maxima/ECL
• Previous by thread: Generating recursive functions
• Next by thread: Generating recursive functions
• Index(es):
  • Date
  • Thread