An efficient class of Traub-Steffensen-type optimal order multiple root solvers

DOI10.1007/s11075-023-01683-xzbMath1544.65081MaRDI QIDQ6582399

Harmandeep Singh, Janak Raj Sharma

Publication date: 2 August 2024

Published in: Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

nonlinear equationscomplex dynamicsmultiple rootsoptimal convergenceTraub-Steffensen method

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A stable class of modified Newton-like methods for multiple roots and their dynamics
• About infinitely many algorithms for the solution of equations.
• On the dynamics of a triparametric family of optimal fourth-order multiple-zero finders with a weight function of the principal \(m\)th root of a function-to-function ratio
• A new higher-order optimal derivative free scheme for multiple roots
• An excellent derivative-free multiple-zero finding numerical technique of optimal eighth order convergence
• A family of optimal quartic-order multiple-zero finders with a weight function of the principal \(k\)th root of a derivative-to-derivative ratio and their basins of attraction
• An efficient class of Traub-Steffensen-type methods for computing multiple zeros
• An optimal eighth order derivative free multiple root finding numerical method and applications to chemistry
• Iterative Methods and Their Dynamics with Applications
• An Optimal Eighth-Order Scheme for Multiple Zeros of Univariate Functions

This page was built for publication: An efficient class of Traub-Steffensen-type optimal order multiple root solvers