Message Boards Message Boards

0
|
1415 Views
|
4 Replies
|
0 Total Likes
View groups...
Share
Share this post:

Recursive symbolic Eqn.

Posted 11 years ago
Hello all out there. I am just new here. I have a question: I am using in my daily job Wolfram Mathematica 9. I am dealing now with a recurrence equation that when inserted into Table statement produces a stack overflow essentially. How can i evaluate the ricurrence eqn. without incurring into this problem? The eqn. has also symbolic parameter so it has to be evaluated symbolically. Thanks anyone for help. Alessandro
4 Replies
Ok i will try that simplify thanks
It might help if you use Simplify or FullSimplify after each step to reduce the amount of memory used by the results.
POSTED BY: Frank Kampas
Thanks Frank i saw already that but my case do not have constant parameter so it cannot be solved like the examples shown. But thanks anyhow
Reply to this discussion
Community posts can be styled and formatted using the Markdown syntax.
Reply Preview
Attachments
Remove
or Discard

Group Abstract Group Abstract