Newton-type iterative methods for finding zeros having higher multiplicity
In this paper, using the idea of Gander, families of several iterative methods for solving non-linear equations $ f(x)=0 $ having zeros of higher multiplicity are presented. The families of methods presented here include methods of Newton type, Steffensen type and their variant. We obtain families o...
Main Authors: | Pankaj Jain, Kriti Sethi |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2016-12-01
|
Series: | Cogent Mathematics |
Subjects: | |
Online Access: | http://dx.doi.org/10.1080/23311835.2016.1277463 |
Similar Items
-
Ball Convergence for Steffensen-type Fourth-order Methods
by: Ioannis Argyros, et al.
Published: (2015-08-01) -
Some Real-Life Applications of a Newly Constructed Derivative Free Iterative Scheme
by: Ramandeep Behl, et al.
Published: (2019-02-01) -
An Optimal Biparametric Multipoint Family and Its Self-Acceleration with Memory for Solving Nonlinear Equations
by: Quan Zheng, et al.
Published: (2015-12-01) -
On the Development of Numerical Iterated Method of Newton Raphson method for Estimating Nonlinear Equations
by: Umair Khalid Qureshi, et al.
Published: (2019-05-01) -
Novel Iteration Schemes for Computing Zeros of Non-Linear Equations With Engineering Applications and Their Dynamics
by: Amir Naseem, et al.
Published: (2021-01-01)