An improved bisection Newton-like method for enclosing simple zeros of nonlinear equations (Q905071)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An improved bisection Newton-like method for enclosing simple zeros of nonlinear equations |
scientific article; zbMATH DE number 6530115
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved bisection Newton-like method for enclosing simple zeros of nonlinear equations |
scientific article; zbMATH DE number 6530115 |
Statements
An improved bisection Newton-like method for enclosing simple zeros of nonlinear equations (English)
0 references
14 January 2016
0 references
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.
0 references
nonlinear equations
0 references
bisection method
0 references
enclosing methods
0 references
iteration method
0 references
fourth-order derivative free Newton-like method
0 references
simple root
0 references
algorithm
0 references
convergence
0 references
numerical experiment
0 references
0 references
0.8680432438850403
0 references
0.821291446685791
0 references
0.8132032752037048
0 references
0.801351010799408
0 references
