>>>>> "Richard" == Richard Fateman <fateman at eecs.berkeley.edu> writes:
Richard> well, not the general issue, but finding roots of polynomials.
Richard> These programs tend to have difficulty when there are multiple roots.
Richard> e.g. (x-3)^2.
Richard> But we can remove multiple roots and count them by using sqfr.
Richard> It is a feature of computer algebra that we seem to have neglected.
Richard> Anyone willing to muck around with this? Maybe for bfallroots?
How would this work if the root is some floating-point number? It
seems that it wouldn't work well if you have a floating-point
approximation to a root. But don't know anything about how sqfr
works, so I'm probably all wrong.
Ray