A class of computationally efficient numerical algorithms for locating multiple zeros

DOI10.1007/S13370-020-00865-3zbMath1488.65119OpenAlexW3123657658MaRDI QIDQ1984183

Sunil Kumar, Janak Raj Sharma

Publication date: 13 September 2021

Published in: Afrika Matematika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13370-020-00865-3

zbMATH Keywords

convergencenonlinear equationsfast algorithmNewton-like methodsmultiple roots

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a numerical technique for finding multiple zeros and its dynamic
• Finding the solution of nonlinear equations by a class of optimal methods
• Constructing higher-order methods for obtaining the multiple roots of nonlinear equations
• Modified Jarratt method for computing multiple roots
• A new fourth-order iterative method for finding multiple roots of nonlinear equations
• Some fourth-order nonlinear solvers with closed formulae for multiple roots
• A family of multiopoint iterative functions for finding multiple roots of equations
• A secant method for multiple roots
• Optimal Order of One-Point and Multipoint Iteration
• A variant of Newton's method with accelerated third-order convergence

This page was built for publication: A class of computationally efficient numerical algorithms for locating multiple zeros