Abstract

The Super-Halley method is one of the best known third-order iteration for solving nonlnear equations. A Newton-like method which is an approximation of this method is studied. Our approach yields a fourth R-order iterative process which is more efficient than its classical predecessor. We establish a Newton-Kantorovich-type convergence theorem using a new system of recurrence relations, and give an explicit expression for the a priori error bound of the iteration.

Full Text
Published version (Free)

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 call