An improved bisection Newton-like method for enclosing simple zeros of nonlinear equations
type: Item
instance of: scholarly article
title: An improved bisection Newton-like method for enclosing simple zeros of nonlinear equations
zbMATH Open document ID: 1332.65067
author: N. E. Zubov
published in: S\(\vec{\text{e}}\)MA Journal
publication date: 2016-01-14T00:00:00Z
review text: An iteration method known as the bisection Newton-like algorithm (BNLA) which is a combination of the bisection method with a fourth-order derivative free Newton-like method for finding simple roots of real nonlinear equations is received. The algorithm possesses fourth order of convergence. Results of numerical experiments are given.
Mathematics Subject Classification ID: 65H05
zbMATH DE Number: 6530115
zbMATH Keywords: nonlinear equations
zbMATH Keywords: bisection method
zbMATH Keywords: enclosing methods
zbMATH Keywords: iteration method
zbMATH Keywords: fourth-order derivative free Newton-like method
zbMATH Keywords: simple root
zbMATH Keywords: algorithm
zbMATH Keywords: convergence
zbMATH Keywords: numerical experiment
reviewed by: Anton Iliev
MaRDI profile type: Publication
full work available at URL: s40324-015-0050-0
OpenAlex ID: W2181528125
cites work: Q3996272
cites work: The “Pegasus” method for computing the root of an equation
cites work: An improved pegasus method for root finding
cites work: New high-order convergence iteration methods without employing derivatives for solving nonlinear equations
cites work: An improved regula falsi method with quadratic convergence of both diameter and point for enclosing simple zeros of nonlinear equations
cites work: On a class of quadratic convergence iteration formulae without derivatives
cites work: A free-derivative iteration method of order three having convergence of both point and interval for nonlinear equations
DOI: 10.1007/S40324-015-0050-0
description: scientific article; zbMATH DE number 6530115