An efficient class of Traub-Steffensen-type methods for computing multiple zeros

DOI10.3390/AXIOMS8020065zbMath1432.65005OpenAlexW2944987332WikidataQ127794312 ScholiaQ127794312MaRDI QIDQ2306338

Janak Raj Sharma, C. Cesarano, Deepak Kumar

Publication date: 23 March 2020

Published in: Axioms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/axioms8020065

zbMATH Keywords

convergencenonlinear equationsmultiple rootsderivative-free method

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Acceleration of convergence in numerical analysis (65B99)

Related Items (4)

Development of cubically convergent iterative derivative free methods for computing multiple roots ⋮ Bayesian analysis of the Weibull paired comparison model using numerical approximation ⋮ An efficient approach for the numerical solution of fifth-order KdV equations ⋮ New class of \(G\)-Wolfe-type symmetric duality model and duality relations under \(G_f\)-bonvexity over arbitrary cones

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal fourth-order family of methods for multiple roots and its dynamics
• Basin attractors for various methods
• Constructing higher-order methods for obtaining the multiple roots of nonlinear equations
• A class of two-point sixth-order multiple-zero finders of modified double-Newton type and their dynamics
• Graphic and numerical comparison between iterative methods
• Modified Jarratt method for computing multiple roots
• A new fourth-order iterative method for finding multiple roots of nonlinear equations
• New third order nonlinear solvers for multiple roots
• Some fourth-order nonlinear solvers with closed formulae for multiple roots
• Extraneous fixed points, basin boundaries and chaotic dynamics for Schröder and König rational iteration functions
• A family of root finding methods
• An optimal multiple root-finding method of order three
• On developing fourth-order optimal families of methods for multiple roots and their dynamics
• A new class of three-point methods with optimal convergence order eight and its dynamics
• A higher order method for multiple zeros of nonlinear functions
• An Optimal Eighth-Order Scheme for Multiple Zeros of Univariate Functions
• A variant of Newton's method with accelerated third-order convergence

This page was built for publication: An efficient class of Traub-Steffensen-type methods for computing multiple zeros