An optimal biparametric multipoint family and its self-acceleration with memory for solving nonlinear equations (Q1736739)

From MaRDI portal
Revision as of 21:51, 18 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
An optimal biparametric multipoint family and its self-acceleration with memory for solving nonlinear equations
scientific article

    Statements

    An optimal biparametric multipoint family and its self-acceleration with memory for solving nonlinear equations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 March 2019
    0 references
    Summary: In this paper, a family of Steffensen-type methods of optimal order of convergence with two parameters is constructed by direct Newtonian interpolation. It satisfies the conjecture proposed by \textit{H. T. Kung} and \textit{J. F. Traub} [J. Assoc. Comput. Mach. 21, 643--651 (1974; Zbl 0289.65023)] that an iterative method based on \(m\) evaluations per iteration without memory would arrive at the optimal convergence of order \(2^{m - 1}\). Furthermore, the family of Steffensen-type methods of super convergence is suggested by using arithmetic expressions for the parameters with memory but no additional new evaluation of the function. Their error equations, asymptotic convergence constants and convergence orders are obtained. Finally, they are compared with related root-finding methods in the numerical examples.
    0 references
    nonlinear equation
    0 references
    Newton's method
    0 references
    Steffensen's method
    0 references
    derivative free
    0 references
    optimal convergence
    0 references
    super convergence
    0 references

    Identifiers