Iteration Inverse Method

[antoniomancera]

For example if we choose c=-0.8i, a must be a element of the Julia set of the function f(z)=z**2-0.8i. In particular, at least one fixed point is a element of the Julia set, furthermore if the fixed point is a repelling fixed point(the module of their derivate is bigger than one) is ever a element of the Julia set. In this case both fixed point are in the Julia set, so we can choose

draw(-0.8j,fijo1(-0.8j),15)

If I change 15 with a bigger number my computer can't draw, and this is a problem because there are too many point which are too nearly. For this reason, I'm trying to make a program which select only elements far to each other.

def modulo(a,c,m):
    xs=[a]
    iter=0
    p=0
    while iter<m:
        iter=iter+1
        for i in range(p,len(xs)):
             ys=inversa(xs[i],c)
             for k in range(0,len(xs)):
                 for l in range(0,2):
                    if sqrt((ys[l].real-xs[k].real)**2+(ys[l].imag-xs[k].imag)**2)<=0.01:
                        xs=xs
                    else:
                        xs=xs+[ys[l]]
                        p=p+1
                    return xs

But I have to correct it. If I get it finished i will post.