Interval Newton method: Hansen-Greenberg approach - some procedural improvements
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.
- Newton type interval methods for solving nonlinear scalar equations
- scientific article; zbMATH DE number 804643
- scientific article; zbMATH DE number 3888808
- Über die Konvergenzordnungen einiger Klassen intervallmäßiger Iterationsverfahren
- Iterationsverfahren höherer Ordnung zur Einschließung der Inversen einer Matrix
- An interval Newton method
- Associated Polynomials and Uniform Methods for the Solution of Linear Problems
- Bounding solutions of systems of equations using interval analysis
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Interval Arithmetic in Matrix Computations, Part II
- On Solving Systems of Equations Using Interval Arithmetic
This page was built for publication: Interval Newton method: Hansen-Greenberg approach - some procedural improvements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751765)