An improvement of the Euler-Chebyshev iterative method (Q819019)

From MaRDI portal
Revision as of 19:07, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
An improvement of the Euler-Chebyshev iterative method
scientific article

    Statements

    An improvement of the Euler-Chebyshev iterative method (English)
    0 references
    22 March 2006
    0 references
    The computation of a simple root of a sufficiently smooth scalar function \(f\) is discussed. The Newton method and the Euler-Chebyshev method are briefly presented. A method based on the Euler-Chebyshev method using a linear combination of function values of \(f\) with a convergence order of 5 is constructed. For the practical test of 13 functions, a Maple-algorithm with iteration depending arithmetic is used.
    0 references
    0 references
    Euler-Chebyshev's formula
    0 references
    nonlinear equation
    0 references
    iterative methods
    0 references
    order of convergence
    0 references
    computational efficiency
    0 references
    numerical examples
    0 references
    Newton method
    0 references
    Maple algorithm
    0 references
    0 references
    0 references