A globally convergent interval Newton's method for computing and bounding real roots of a function with one variable
Summary: It is known that Newton's method is locally convergent, involves errors in numerical computations, and requires an initial guess point for calculating. This initial guess point should be closed enough to the root or zeros otherwise this method fails to converge to the desired root. The method of interval mathematics should overcome these issues and be used to make Newton's method as globally convergent. This paper shows how to use interval mathematics for computing and bounding the simple and multiple roots of multimodal functions. It shows how to solve the problem when zero is in the given interval. The numerical computations for the two examples show the ability of newly proposed methods and satisfactory computational behaviour and convince us that Newton's method is able to solve nonlinear problems statement.
- scientific article; zbMATH DE number 804643
- Interval iteration for zeros of systems of equations
- Globally convergent algorithm for solving nonlinear equations
- Interval Newton/generalized bisection when there are singularities near roots
- A fast and robust method for computing real roots of nonlinear equations
This page was built for publication: A globally convergent interval Newton's method for computing and bounding real roots of a function with one variable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113795)
