Abstract
Newton’s method is a classical iterative algorithm for the numerical computation of isolated roots of algebraic equations and stationary points of functions. While its application is ubiquitous in a plethora of fields, questions concerning its robust stability to uncertainties in problem data and numerical accuracy often arise in practice. This paper seeks to provide sufficient conditions for practical stability, input-to-state-stability (ISS), integral ISS (iISS) and incremental ISS (δISS) of Newton’s method in the presence of such uncertainties, and provide illustrative examples of their application.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
