Efficient \(n\)-point iterative methods with memory for solving nonlinear equations (Q747735): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q179290
RedirectionBot (talk | contribs)
Changed an Item
Property / reviewed by
 
Property / reviewed by: A. I. Iliev / rank
 
Normal rank

Revision as of 10:52, 10 February 2024

scientific article
Language Label Description Also known as
English
Efficient \(n\)-point iterative methods with memory for solving nonlinear equations
scientific article

    Statements

    Efficient \(n\)-point iterative methods with memory for solving nonlinear equations (English)
    0 references
    0 references
    0 references
    19 October 2015
    0 references
    A new family of \(n\)-point derivative-free iterative methods with and without memory for solving nonlinear equations is proposed. The convergence order of the new \(n\)-point derivative-free methods with memory is \((2^{n+1} - 1 + \sqrt{2^{2(n+1)} + 1}) /2\). The computational efficiency of the new \(n\)-point methods with memory is very high. Numerical results are given.
    0 references
    multipoint iterative methods
    0 references
    computational efficiency
    0 references
    nonlinear equations
    0 references
    root-finding methods
    0 references
    derivative-free
    0 references
    convergence order
    0 references
    numerical result
    0 references
    0 references

    Identifiers