An optimization of Chebyshev's method (Q2272151): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jco.2009.04.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004693784 / rank
 
Normal rank

Revision as of 19:52, 19 March 2024

scientific article
Language Label Description Also known as
English
An optimization of Chebyshev's method
scientific article

    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

    Identifiers