Computing multiple zeros by using a parameter in Newton-secant method
From MaRDI portal
Publication:1689248
Abstract: In this paper, we modify the Newton-Secant method with third order of convergence for finding multiple roots of nonlinear equations. Per iteration this method requires two evaluations of the function and one evaluation of its first derivative. This method has the efficiency index equal to . We describe the analysis of the proposed method along with numerical experiments including comparison with existing methods. Moreover, the dynamics of the proposed method are shown with some comparisons to the other existing methods.
Recommendations
- Cubic convergence of parameter-controlled Newton-secant method for multiple zeros
- A third-order modification of Newton's method for multiple roots
- Third-order and fourth-order iterative methods free from second derivative for finding multiple roots of nonlinear equations
- Fifth-order iterative method for finding multiple roots of nonlinear equations
- Modified Newton's methods of cubic convergence for multiple roots
Cites work
- A complex dynamical approach of Chebyshev's method
- A family of multiopoint iterative functions for finding multiple roots of equations
- A family of root finding methods
- A higher order method for multiple zeros of nonlinear functions
- A modified secant method for semismooth equations
- A new class of optimal four-point methods with convergence order 16 for solving nonlinear equations
- A new class of three-point methods with optimal convergence order eight and its dynamics
- A study of optimization for Steffensen-type methods with frozen divided differences
- A two-step Steffensen's method under modified convergence conditions
- A variant of Newton's method with accelerated third-order convergence
- An optimal multiple root-finding method of order three
- Ball comparison between two optimal eight-order methods under weak conditions
- Basin attractors for various methods
- Dynamics of a family of third-order iterative methods that do not require using second derivatives
- Graphic and numerical comparison between iterative methods
- scientific article; zbMATH DE number 3352737 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- Mathematica®: A Problem-Centered Approach
- Multipoint methods for solving nonlinear equations
- New families of nonlinear third-order solvers for finding multiple roots
- On a higher order secant method.
- On a Steffensen's type method and its behavior for semismooth equations
- On improved three-step schemes with high efficiency index and their dynamics
- On the local convergence of secant-type methods
- Review of some iterative root-finding methods from a dynamical point of view
- Solving nonlinear equations by a derivative-free form of the King's family with memory
- Variants of Newton's method using fifth-order quadrature formulas
Cited in
(8)- Cubic convergence of parameter-controlled Newton-secant method for multiple zeros
- Developing a new family of Newton-Secant method with memory based on a weight function
- A multi-point iterative method for solving nonlinear equations with optimal order of convergence
- Some real-life applications of a newly constructed derivative free iterative scheme
- Review of some iterative methods for solving nonlinear equations with multiple zeros
- An optimal three-point eighth-order iterative method without memory for solving nonlinear equations with its dynamics
- Optimal Newton-secant like methods without memory for solving nonlinear equations with its dynamics
- New modification of Maheshwari's method with optimal eighth order convergence for solving nonlinear equations
This page was built for publication: Computing multiple zeros by using a parameter in Newton-secant method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689248)
