On efficient two-parameter methods for solving nonlinear equations

DOI10.1007/s11075-012-9641-3zbMath1280.65043OpenAlexW2131882019MaRDI QIDQ2391884

Jovana Džunić

Publication date: 5 August 2013

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-012-9641-3

zbMATH Keywords

numerical examplesiterative methodsnonlinear equationscomputational efficiencyacceleration of convergencemultipoint methods with memorySteffensen type method

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Complexity and performance of numerical algorithms (65Y20)

Related Items (20)

Derivative free iterative methods with memory having higher R-order of convergence ⋮ On the optimal choice of parameters in two-point iterative methods for solving nonlinear equations ⋮ A new accelerating technique applied to a variant of Cordero-Torregrosa method ⋮ An Ostrowski-type method with memory using a novel self-accelerating parameter ⋮ A new family of adaptive methods with memory for solving nonlinear equations ⋮ Iterative methods for multiple roots with memory using self-accelerating technique ⋮ On the construction of some tri-parametric iterative methods with memory ⋮ Unnamed Item ⋮ Solving nondifferentiable nonlinear equations by new Steffensen-type iterative methods with memory ⋮ Unnamed Item ⋮ Two bi-accelerator improved with memory schemes 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 fast and robust method for computing real roots of nonlinear equations ⋮ An efficient two-parametric family with memory for nonlinear equations ⋮ Efficient two-step derivative-free iterative methods with memory and their dynamics ⋮ Improving R-Order Convergence of Derivative Free with Memory Method by Two Self-accelerator Parameters ⋮ Efficient \(n\)-point iterative methods with memory for solving nonlinear equations ⋮ Creating a new two-step recursive memory method with eight-order based on Kung and Traub’s method ⋮ A family of Newton-type iterative methods using some special self-accelerating parameters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On generalized multipoint root-solvers with memory
• Iterative methods for solving nonlinear equations with finitely many roots in an interval
• Three-point methods with and without memory for solving nonlinear equations
• A multi-parameter family of three-step eighth-order iterative methods locating a simple root
• Iterative methods based on the signum function approach for solving nonlinear equations
• A non-iterative method for solving non-linear equations
• Sigmoid-like functions and root finding methods
• Remarks on “On a General Class of Multipoint Root-Finding Methods of High Computational Efficiency”
• Principles for Testing Polynomial Zerofinding Programs
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• Optimal Order of One-Point and Multipoint Iteration
• A family of two-point methods with memory for solving nonlinear equations

This page was built for publication: On efficient two-parameter methods for solving nonlinear equations