A globally convergent interval Newton's method for computing and bounding real roots of a function with one variable
by Ismail Bin Mohd; Yosza Bin Dasril
International Journal of Mathematics in Operational Research (IJMOR), Vol. 20, No. 4, 2021

Abstract: 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.

Online publication date: Fri, 07-Jan-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com