I sometimes have to solve problem related to series where coefficients are defined by recurrence relations.
The easiest relation is in a such situation when I have one recurrence relation a[n]=… function of a[] with initial values a[0].
But it is more difficult to solve recurrence relations when two or three a[n], b[n], c[n] relations form an implicit system .
What strategy do you suggest to solve effectively this problem?
Dear R. Jedynak,
Send all the relations. If it is possible for me to write the codes. I will write it and then send it to you.
Dear R. Jedynak,
Send all the relations. If it is possible for me to write the codes. I will write it and then send it to you.
Dear Hammad,
I appreciate you helping me. The last problem I solved numerically using Mathematica.
I calculated unknown coefficients using iterative process. I had two recurrence relations a[n] and b[n] which I treated as elements of tables (matrixes).
I am very glad that I can count on you in the future because I often meet the similar tasks in my scientific work.
- Badges
- Science topic
- Similar topics
- Social Psychology
- Attitude