|
From: Richard F. <fa...@be...> - 2020-03-23 19:24:05
|
There is "realroots" in Maxima which is guaranteed to (eventually) find a bracket of any desired rational size around any polynomial real root. This may not be relevant here, but it is available. There is an IEEE standards effort for interval arithmetic. It describes a rather elaborate scheme, one which is far more ambitious than what is in Mathematica or Maple (or any of the several student projects I've sponsored over the years to use Lisp and possibly Maxima for interval arithmetic.) There are many decisions that have to be made along the way -- what to do with intervals like [0,oo] or how to represent 1/[-1,1]. And then essentially all the algorithms have to be modified to allow intervals. Writing (say) an interval version of a particular numeric function, say cosine of a real finite interval is not too hard. Just there are lots of these programs. RJF On 3/22/2020 9:59 PM, Gunter Königsmann wrote: > The question is if this is enough for this case or if we would need an > interval arithmetics for find_root - which is impossible for more than > trivial problems. > |