It is the "np=120" that makes it difficult. This introduces something like "x^120" in the equation, which yields a function that has a very sharp bend. This is a case for which the current root-finding algorithm is not well suited.
I have now modified the root-finding algorithm to do "alternating interpolation and bisection", along the lines of the general root-finding algorithm used for programs. It might be a bit slower, but it finds the solution to your "trouble" cases. However, I think it might still be possible to screw it up by setting "np=120000" or something. The new algorithm will be available in the next release.
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
calc v4.51 ir% samples.xls
It is the "np=120" that makes it difficult. This introduces something like "x^120" in the equation, which yields a function that has a very sharp bend. This is a case for which the current root-finding algorithm is not well suited.
I have now modified the root-finding algorithm to do "alternating interpolation and bisection", along the lines of the general root-finding algorithm used for programs. It might be a bit slower, but it finds the solution to your "trouble" cases. However, I think it might still be possible to screw it up by setting "np=120000" or something. The new algorithm will be available in the next release.
Will be fixed in next version