A new family of Newton-type iterative methods with and without memory for solving nonlinear equations

DOI10.1007/s10092-012-0072-2zbMath1312.65078OpenAlexW2006863666MaRDI QIDQ2017951

Tie Zhang, Xiaofeng Wang

Publication date: 23 March 2015

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10092-012-0072-2

zbMATH Keywords

convergence accelerationnonlinear equationscomputational efficiencyroot-findingoptimal ordernumerical comparisoniterative methods with memory\(R\)-order convergence

Mathematics Subject Classification ID

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

Related Items (max. 100)

Several two-point with memory iterative methods for solving nonlinear equations ⋮ Family of multipoint with memory iterative schemes for solving nonlinear equations ⋮ 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 ⋮ Dynamics of iterative families with memory based on weight functions procedure ⋮ A family of Newton type iterative methods for solving nonlinear equations ⋮ New three- and four-parametric iterative with memory methods with efficiency index near 2 ⋮ Stability of King's family of iterative methods with memory ⋮ Efficient two-step derivative-free iterative methods with memory and their dynamics ⋮ A velocity-combined local best particle swarm optimization algorithm for nonlinear equations ⋮ Dynamical techniques for analyzing iterative schemes with memory ⋮ Unnamed Item ⋮ Efficient \(n\)-point iterative methods with memory for solving nonlinear equations ⋮ Multipoint iterative methods for finding all the simple zeros in an interval ⋮ 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
• On optimal fourth-order iterative methods free from second derivative and their dynamics
• Interpolatory multipoint methods with memory for solving nonlinear equations
• Three-point methods with and without memory for solving nonlinear equations
• Unifying fourth-order family of iterative methods
• Derivative free two-point methods with and without memory for solving nonlinear equations
• Construction of optimal order nonlinear solvers using inverse interpolation
• Some eighth-order root-finding three-step methods
• A family of three-point methods of optimal order for solving nonlinear equations
• Three-step iterative methods with eighth-order convergence for solving nonlinear equations
• A new continuation Newton-like method and its deformation
• Some modifications of King's family with optimal eighth order of convergence
• Newton-like method with some remarks
• Variants of Newton's method using fifth-order quadrature formulas
• A new family of higher order methods for solving equations
• Optimal Order of One-Point and Multipoint Iteration
• A Family of Fourth Order Methods for Nonlinear Equations
• A new family of modified Ostrowski's methods with accelerated eighth order convergence

This page was built for publication: A new family of Newton-type iterative methods with and without memory for solving nonlinear equations