Newton-type iterative methods for finding zeros having higher multiplicity

DOI10.1080/23311835.2016.1277463zbMath1426.65067OpenAlexW2563964201MaRDI QIDQ4966866

Pankaj Jain, Kriti Sethi

Publication date: 27 June 2019

Published in: Cogent Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/23311835.2016.1277463

zbMATH Keywords

Newton methodnonlinear equationsorder of convergencemultiple zerosSteffensen method

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items (2)

A problem-based learning proposal to teach numerical and analytical nonlinear root searching methods ⋮ On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros

Cites Work

• A new fourth-order iterative method for finding multiple roots of nonlinear equations
• A one-parameter family of second-order iteration methods
• Steffensen type methods for solving non-linear equations
• Locating multiple zeros interactively
• A significant improvement on Newton's iterative method
• Efficient Halley-like methods for the inclusion of multiple zeros of polynomials
• Families of Newton-like methods with fourth-order convergence
• On an efficient method for the simultaneous approximation of polynomial multiple roots
• On Halley's Iteration Method

This page was built for publication: Newton-type iterative methods for finding zeros having higher multiplicity