A globally convergent interval Newton's method for computing and bounding real roots of a function with one variable

DOI10.1504/IJMOR.2021.120103zbMATH Open1486.65048OpenAlexW4285518878MaRDI QIDQ2113795FDOQ2113795

Authors: Ismail Mohd, Yosza Dasril 

Publication date: 14 March 2022

Published in: International Journal of Mathematics in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijmor.2021.120103

Recommendations

• 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

zbMATH Keywords

nonlinearalgorithmglobal convergenceNewton's methodinterval mathematicsroot findingAlefeld's method

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Cited In (2)

• Global root bracketing method with adaptive mesh refinement
• THE NEWTON’S METHOD INTERVAL SINGLE-STEP PROCEDURE FOR BOUNDING POLYNOMIAL ZEROS SIMULTANEOUSLY

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)