An excellent numerical technique for multiple roots

DOI10.1016/J.MATCOM.2020.11.008OpenAlexW3098084410MaRDI QIDQ1998374

Sunil Kumar, Janak Raj Sharma

Publication date: 6 March 2021

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2020.11.008

zbMATH Keywords

convergencenonlinear systemsfast algorithmsmultiple roots

Mathematics Subject Classification ID

Nonlinear algebraic or transcendental equations (65Hxx)

Related Items (1)

Unnamed Item

Cites Work

• 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
• A class of two-point sixth-order multiple-zero finders of modified double-Newton type and their dynamics
• Constructing a family of optimal eighth-order modified Newton-type multiple-zero finders along with the dynamics behind their purely imaginary extraneous fixed points
• Modified Jarratt method for computing multiple roots
• Optimal iterative methods for finding multiple roots of nonlinear equations using free parameters
• An optimal scheme for multiple roots of nonlinear equations with eighth-order convergence
• Optimal iterative methods for finding multiple roots of nonlinear equations using weight functions and dynamics
• An eighth-order family of optimal multiple root finders and its dynamics
• 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: An excellent numerical technique for multiple roots