- The computed value of the escape radius is accurate only when using relatively high M and N terms number (say : 8 , 8 ). For the default number of M and N (4, 4), it is necessary to scale down the computed escape radius by a factor of around 0.25 (I use 0.1 because it doesn't affect performance).

Ok I put in a 0.1*r in my local copy.

For odd i's, the coefficients are 0 so it is possible to optimize a little.

~~I'll try this soon.~~ **EDIT** Seems nontrivial, as it is initialized like this (see line highlighted):

` biPolyClass(N m, N n): m_m(m), m_n(n) {`

for(N l=0; l <= m_m; l++)

for(N c=0; c<= m_n; c++)

tab[l][c] = C_lo(0);

tab[1][0] = C_lo(1); // *****************

}

When loading a kfr file, overriding some parameters doesn't work (for example zoom factor).

I think I fixed this locally too.

Using floatexp type is much slower. Is it possible to perform rescaling "manually"? I remember Pauldebrot said once that it is possible to predict when the rescaling is necessary when using perturbation. For series approximation it is IMHO not really critical.

I'm not sure how much it will gain vs how much developer time it will take to implement correctly, at least in KF the scaled-(long)-double only doubles the exponent before you have to switch to the next type.

The zoom thresholds for float types selection suppose that the (super)SA is scaled which is not implemented: those thresholds need to be lowered for now.

Hmm, do the coefficients overflow to infinity or so? I just copied what I thought made sense from the number type ranges. How much do they need lowering? Dependent on M,N? Concrete (tested) suggestions for threshold values would help!