I want to calculate iterates for the Logistic map using the maple's symbolic computation. e.g.,
x1=a*x*(1-x):
a1=a+w:
x=x1:
a=a1:
In order to keep track of the error that builds up in each step. But the main trouble is that it takes very long time to calculate the same even for 100 iterates. What could be the possible method to make my program efficient ?
Please do not answer in terms of using high precision technique as I am more interested in doing it symbolically.
hyder
