|
[Date Index]
[Thread Index]
[Author Index]
complicated recursion relations
- To: mathgroup at smc.vnet.net
- Subject: [mg26748] complicated recursion relations
- From: RUDOLPH JOHN MAGYAR <rjmagyar at unix.amherst.edu>
- Date: Fri, 19 Jan 2001 02:14:23 -0500 (EST)
- Organization: Amherst College
- Sender: owner-wri-mathgroup at wolfram.com
I have a set of four functions which are related by a series of recursive formulae. For example (The real problem is a much messier version of this),
b[n+1]-b[n-1]=b[n]
b[n+1]*sin((n+1)/2*pi) -d[n-1]*sin((n-1)/2*pi)
+c[n+1]*sin((n+1)/2*pi) -e[n-1]*sin((n-1)/2*pi)
= d[n]*sin(n/2*pi) - e [n]*sin(n/2*pi)
b[n+1]*sin(3(n+1)/2*pi) -d[n-1]*sin(3(n-1)/2*pi)
+c[n+1]*sin(3(n+1)/2*pi) -e[n-1]*sin(3(n-1)/2*pi)
= d[n]*sin(3n/2*pi) - e [n]*sin(3n/2*pi)
Well, I actually have more terms and a bigger mess, but can I use mathematica to untangle this mess like this?
--
Rudolph J. Magyar
rjmagyar at amhux4.amherst.edu
Web Address: www.amherst.edu/~rjmagyar
Prev by Date:
Re: Shortcut for magnitude of a Vector?
Next by Date:
Stderr:Actions not found:delete-next-character
Previous by thread:
algorithm for picking sum of list items
Next by thread:
Stderr:Actions not found:delete-next-character
|