Empirical Evaluation of Innovations in Interval Branch and Bound Algorithms for Nonlinear Systems (Q4336717)

There are many tools of interval arithmetic that are appropriate for locating and enclosing zeros of nonlinear systems. Such tools are branch-and-bound techniques, bisection and trisection, preconditioning, inclusion function of first and second order, finding the right bisection direction, interval Newton methods, tests for existence, non-existence and uniqueness of zeros in boxes, slope principles, etc. -- The paper combines these tools and proposes an algorithm with the following features: Given a box \(X\subset \mathbb{R}^n\) and a \(C^2\) function \(f:X\to \mathbb{R}^n\), then the algorithm renders 2 lists of subboxes of \(X\). Each box of the first list contains exactly one zero of \(f\) over \(X\), and the boxes of the other list contain the remaining zeros of \(f\) over \(X\). Reports on numerical experiments are included.