On the rediscovery of Halley's iterative method for computing the zero of an analytic function
From MaRDI portal
Publication:1743925
DOI10.1016/j.cam.2017.11.040zbMath1503.65099OpenAlexW2774751758MaRDI QIDQ1743925
Publication date: 16 April 2018
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2017.11.040
Related Items (4)
Schröder's processes and the best ways of increasing order of Newton's method ⋮ On the Bhattacharya-Mesner rank of third order hypermatrices ⋮ On generalized Halley-like methods for solving nonlinear equations ⋮ High Order Fixed Point and Newton’s Methods in Banach Space
Cites Work
- On the order of convergence of a determinantal family of root-finding methods
- On rediscovered iteration methods for solving equations
- A basic family of iteration functions for polynomial root finding and its characterizations
- Relationships between order and efficiency of a class of methods for multiple zeros of polynomials
- Newton's method and generation of a determinantal family of iteration functions
- Roots of equations by functional iteration
- On Schröder's families of root-finding methods
- Fixed Point and Newton's Methods for Solving a Nonlinear Equation: From Linear to High-Order Convergence
- On Halley's Iteration Method
- A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial
- Accelerated Convergence in Newton’s Method
- Historical Development of the Newton–Raphson Method
- Accelerated Convergence in Newton’s Method
- Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the rediscovery of Halley's iterative method for computing the zero of an analytic function
