Computing multiple zeros by using a parameter in Newton-secant method
From MaRDI portal
Publication:1689248
DOI10.1007/s40324-016-0074-0zbMath1380.65089arXiv1507.03493OpenAlexW2963827957MaRDI QIDQ1689248
Massimiliano Ferrara, Somayeh Sharifi, Mehdi Salimi
Publication date: 12 January 2018
Published in: S\(\vec{\text{e}}\)MA Journal (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.03493
numerical experimentsbasin of attractionnonlinear equationmultiple rootsmulti-point iterative methodsthird order of convergenceNewton-secant method
Related Items (7)
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 ⋮ An optimal three-point eighth-order iterative method without memory for solving nonlinear equations with its dynamics ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving nonlinear equations by a derivative-free form of the King's family with memory
- On improved three-step schemes with high efficiency index and their dynamics
- Basin attractors for various methods
- Graphic and numerical comparison between iterative methods
- A two-step Steffensen's method under modified convergence conditions
- A complex dynamical approach of Chebyshev's method
- A study of optimization for Steffensen-type methods with frozen divided differences
- Ball comparison between two optimal eight-order methods under weak conditions
- New families of nonlinear third-order solvers for finding multiple roots
- A family of root finding methods
- An optimal multiple root-finding method of order three
- On a higher order secant method.
- A modified secant method for semismooth equations
- Dynamics of a family of third-order iterative methods that do not require using second derivatives
- 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
- Variants of Newton's method using fifth-order quadrature formulas
- On a Steffensen's type method and its behavior for semismooth equations
- Mathematica®: A Problem-Centered Approach
- A family of multiopoint iterative functions for finding multiple roots of equations
- A higher order method for multiple zeros of nonlinear functions
- On the local convergence of secant-type methods
- A variant of Newton's method with accelerated third-order convergence
This page was built for publication: Computing multiple zeros by using a parameter in Newton-secant method
