Modified Newton's method with third-order convergence and multiple roots

Authors:
M. Frontini;E. Sormani
Affiliations:
Dipartimento di Mathematica, Politecnico di Milano, Piazza L. da Vinci 32, Milano 32 20133, Italy;Dipartimento di Mathematica, Politecnico di Milano, Piazza L. da Vinci 32, Milano 32 20133, Italy
Venue:
Journal of Computational and Applied Mathematics
Year:
2003

Citing 3
Cited 13

Numerical analysis: an introduction

Numerical analysis: an introduction
Some variant of Newton's method with third-order convergence

Applied Mathematics and Computation
Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Classics in Applied Mathematics, 16)

Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Classics in Applied Mathematics, 16)

On Newton-type methods with cubic convergence

Journal of Computational and Applied Mathematics
Letter to the Editor: Third-order modification of Newton's method

Journal of Computational and Applied Mathematics
Some modifications of Newton's method with fifth-order convergence

Journal of Computational and Applied Mathematics
Simple geometry facilitates iterative solution of a nonlinear equation via a special transformation to accelerate convergence to third order

Journal of Computational and Applied Mathematics
Fourth-order two-step iterative methods for determining multiple zeros of non-linear equations

International Journal of Computer Mathematics
Modified Newton's method for systems of nonlinear equations with singular Jacobian

Journal of Computational and Applied Mathematics
Convergence analysis for a deformed Newton's method with third-order in Banach space under γ-condition

International Journal of Computer Mathematics
New families of nonlinear third-order solvers for finding multiple roots

Computers & Mathematics with Applications
On Newton-type methods for multiple roots with cubic convergence

Journal of Computational and Applied Mathematics
On Newton-type methods with cubic convergence

Journal of Computational and Applied Mathematics
Accelerating generators of iterative methods for finding multiple roots of nonlinear equations

Computers & Mathematics with Applications
Convergence of the modified Halley's method for multiple zeros under Hölder continuous derivative

Numerical Algorithms
Accurate fourteenth-order methods for solving nonlinear equations

Numerical Algorithms

Quantified Score

Hi-index	7.30

Visualization

Abstract

In recent papers (Appl. Math. Comput. 140 (2003) 419-426; Appl. Math. Lett. 13 (2000) 87-93) a new modification of the Newton's method (mNm) which produces iterative methods with order of convergence three have been proposed. Here we study the order of convergence of such methods when we have multiple roots. We prove that the order of convergence of the mNm go down to one but, when the multiplicity p is known, it may be rised up to two by using two different types of correction. When p is unknown we show that the two most efficient methods in the family of the mNm converge faster than the classical Newton's method.