Interval Newton method: Hansen-Greenberg approach - some procedural improvements (Q751765)

Consider the nonlinear equation \(f(x)=0\), where f is a differentiable function f: \(D\subseteq {\mathbb{R}}^ n\to {\mathbb{R}}^ n\). The author investigates a Newton-type iteration to construct a sequence of intervals in \({\mathbb{R}}^ n\) that, under certain conditions, converges to a solution of \(f(x)=0\). He takes up recent work of \textit{E. R. Hansen} and \textit{R. I. Greenberg} [Appl. Math. Comput. 12, 89-98 (1983; Zbl 0526.65040)] and suggests improvements. The paper contains some disturbing misprints and intermingles the notions ``fixpoint'' and ``zero''. Nevertheless, the presented modifications of the Hansen-Greenberg algorithm seem to be promising.