Computers in mathematical research: the study of three-point root-finding methods (Q2189414)

From MaRDI portal
Revision as of 02:35, 2 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Computers in mathematical research: the study of three-point root-finding methods
scientific article

    Statements

    Computers in mathematical research: the study of three-point root-finding methods (English)
    0 references
    0 references
    0 references
    15 June 2020
    0 references
    The comparative study of three-point methods for solving nonlinear equations provided in the paper of \textit{C. Chun} and \textit{B. Neta} [Numer. Algorithms 74, No. 4, 1169--1201 (2017; Zbl 1362.65054)] is the motivation for the present article. The research is extended for higher-order polynomials, polynomials with random coefficients, and polynomials with clusters of zeros.
    0 references
    0 references
    comparison of root finding
    0 references
    CPU time empirical model
    0 references
    solving polynomial equations
    0 references
    computer graphics
    0 references
    convergence behavior
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references