An optimization of Chebyshev's method (Q2272151)
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 optimization of Chebyshev's method |
scientific article; zbMATH DE number 5590649
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimization of Chebyshev's method |
scientific article; zbMATH DE number 5590649 |
Statements
An optimization of Chebyshev's method (English)
0 references
6 August 2009
0 references
The authors present a new third-order multipoint iteration with the efficiency close to the efficiency of the Newton method for approximating numerical solutions of nonlinear equations and with the same region of accessibility. First, they remind some basic facts on approximations to the numerical solution of an equation \(F(x)=0\) using the Newton and Chebyshev methods. Then, a modification of the Chebyshev method is introduced together with a convergence and complexity analysis of the iterations. Finally, the authors give some examples of the new method.
0 references
nonlinear operator equations
0 references
Banach spaces
0 references
Newton's method
0 references
Chebyshev's method
0 references
multipoint iteration
0 references
semilocal convergence
0 references
\(R\)-order of convergence
0 references
region of accessibility
0 references
attraction basin
0 references
numerical examples
0 references
complexity
0 references
0 references
0.9148783
0 references
0.9056264
0 references
0.90516275
0 references
0.90422964
0 references
0.90422964
0 references
0.8962529
0 references
0.8919507
0 references