Re: How do I bisect unbounded intervals?
On Jan 12 2012, Jean-Pierre Merlet wrote:
What we are doing in that case in ALIAS for system solving is to choose
a random number in the unbounded interval and to bisect the interval at
that point (for bounded intervals we have tried methods to determine a
bisection point that may be better than the mid-point but have found
none that were better on a significant number of examples of our
benchmarks, hence we are using the mid-point). ...
Something that might interest people is that, subject to reasonable
constraints, using random points is within a constant factor of optimal
even for bounded intervals. I suspect that you already know that :-)
Regards,
Nick Maclaren.