A family of two-point methods with memory for solving nonlinear equations
From MaRDI portal
Publication:4899908
DOI10.2298/AADM110905021PzbMath1265.65097OpenAlexW2134748397MaRDI QIDQ4899908
Jovana Džunić, Miodrag S. Petković, Ljiljana D. Petković
Publication date: 10 January 2013
Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/aadm110905021p
numerical examplesiterative methodscomputational efficiencyacceleration of convergencederivative-free methodsmultipoint methods with memory
Numerical computation of solutions to single equations (65H05) Complexity and performance of numerical algorithms (65Y20)
Related Items (24)
An efficient derivative free family of fourth order methods for solving systems of nonlinear equations ⋮ An efficient class of multipoint root-solvers with and without memory for nonlinear equations ⋮ On efficient two-parameter methods for solving nonlinear equations ⋮ Semilocal Convergence of Steffensen-Type Algorithms for Solving Nonlinear Equations ⋮ A new family of adaptive methods with memory for solving nonlinear equations ⋮ Dynamics of iterative families with memory based on weight functions procedure ⋮ On generalized multipoint root-solvers with memory ⋮ Three-point methods with and without memory for solving nonlinear equations ⋮ Some efficient derivative free methods with memory for solving nonlinear equations ⋮ Efficient four-parametric with-and-without-memory iterative methods possessing high efficiency indices ⋮ A general class of one-parametric with memory method for solving nonlinear equations ⋮ Efficient derivative-free variants of Hansen-Patrick's family with memory for solving nonlinear equations ⋮ Multipoint methods for solving nonlinear equations: a survey ⋮ A dynamical comparison between iterative methods with memory: are the derivatives good for the memory? ⋮ On an efficient family of derivative free three-point methods for solving nonlinear equations ⋮ On generalized biparametric multipoint root finding methods with memory ⋮ An efficient family of Traub-Steffensen-type methods for solving systems of nonlinear equations ⋮ A cubically convergent Steffensen-like method for solving nonlinear equations ⋮ Dynamical techniques for analyzing iterative schemes with memory ⋮ On some efficient derivative-free iterative methods with memory for solving systems of nonlinear equations ⋮ Unnamed Item ⋮ On the guaranteed convergence of new two-point root-finding methods for polynomial zeros ⋮ Unnamed Item ⋮ Efficient higher order derivative-free multipoint methods with and without memory for systems of nonlinear equations
This page was built for publication: A family of two-point methods with memory for solving nonlinear equations
