An efficient class of multipoint root-solvers with and without memory for nonlinear equations

DOI10.1007/s40306-015-0132-1zbMath1343.65052OpenAlexW218631812MaRDI QIDQ300667

Tahereh Eftekhari

Publication date: 28 June 2016

Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40306-015-0132-1

zbMATH Keywords

numerical experimentsnonlinear equationscomputational efficiencyorder of convergenceKung-Traub conjecturemultipoint methods with memory

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Three-point methods with and without memory for solving nonlinear equations
• A new optimal eighth-order Ostrowski-type family of iterative methods for solving nonlinear equations
• An optimal Steffensen-type family for solving nonlinear equations
• An optimized derivative-free form of the Potra-Pták method
• On some iterative methods with memory and high efficiency index for solving nonlinear equations
• On an efficient family of derivative free three-point methods for solving nonlinear equations
• An efficient two-parametric family with memory for nonlinear equations
• Some efficient derivative free methods with memory for solving nonlinear equations
• Remarks on “On a General Class of Multipoint Root-Finding Methods of High Computational Efficiency”
• Optimal Order of One-Point and Multipoint Iteration
• A family of two-point methods with memory for solving nonlinear equations
• A Family of Three-point Derivative-free Methods of Eighth-order for Solving Nonlinear Equations