A class of computationally efficient numerical algorithms for locating multiple zeros
type: Item
instance of: scholarly article
title: A class of computationally efficient numerical algorithms for locating multiple zeros
zbMATH Open document ID: 1488.65119
author: Janak Raj Sharma
author: Sunil Kumar
published in: Afrika Matematika
publication date: 2021-09-13T00:00:00Z
Mathematics Subject Classification ID: 65H05
zbMATH DE Number: 7394724
zbMATH Keywords: nonlinear equations
zbMATH Keywords: Newton-like methods
zbMATH Keywords: fast algorithm
zbMATH Keywords: multiple roots
zbMATH Keywords: convergence
describes a project that uses: Mathematica
MaRDI profile type: Publication
full work available at URL: s13370-020-00865-3
OpenAlex ID: W3123657658
cites work: A family of multiopoint iterative functions for finding multiple roots of equations
cites work: Q4844100
cites work: Q2945914
cites work: A secant method for multiple roots
cites work: Optimal Order of One-Point and Multipoint Iteration
cites work: Some fourth-order nonlinear solvers with closed formulae for multiple roots
cites work: A new fourth-order iterative method for finding multiple roots of nonlinear equations
cites work: Q5167035
cites work: Q5723445
cites work: Finding the solution of nonlinear equations by a class of optimal methods
cites work: Modified Jarratt method for computing multiple roots
cites work: On a numerical technique for finding multiple zeros and its dynamic
cites work: Q3925805
cites work: A variant of Newton's method with accelerated third-order convergence
cites work: Constructing higher-order methods for obtaining the multiple roots of nonlinear equations
DOI: 10.1007/S13370-020-00865-3
description: scientific article; zbMATH DE number 7394724