A Hummel \& Seebeck family of iterative methods with improved convergence and efficiency

DOI10.1016/j.amc.2007.02.084zbMath1193.65059OpenAlexW2011318780MaRDI QIDQ990428

Miquel Grau-Sánchez, José Luis Dıáz-Barrero

Publication date: 1 September 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.02.084

zbMATH Keywords

iterative methodsnonlinear equationscomputational efficiencyorder of convergence

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items

Zero-finder methods derived using Runge-Kutta techniques ⋮ Adams-like techniques for zero-finder methods ⋮ Zero-finder methods derived from Obreshkov's techniques

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improvement of the Euler-Chebyshev iterative method
• On computational efficiency for multi-precision zero-finding methods
• An improvement to the computing of nonlinear equation solutions
• A variant of Cauchy's method with accelerated fifth-order convergence.
• An improvement to Ostrowski root-finding method
• A Generalization of Taylor's Expansion