A fast and robust method for computing real roots of nonlinear equations

DOI10.1016/j.aml.2016.12.013zbMath1361.65030OpenAlexW2563305124MaRDI QIDQ518465

Xiao-Diao Chen, Weiyin Ma, Jiaer Shi

Publication date: 28 March 2017

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2016.12.013

zbMATH Keywords

numerical exampleslinear equationsnonlinear equationsroot findingNewton's methodsoptimal convergence orderprogressive formula

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items (1)

A common framework for modified regula falsi methods and new methods of this kind

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient method based on progressive interpolation for solving non-linear equations
• Ostrowski type methods for solving systems of nonlinear equations
• Accurate fourteenth-order methods for solving nonlinear equations
• A family of modified Ostrowski's methods with optimal eighth order of convergence
• A new family of optimal eighth order methods with dynamics for nonlinear equations
• Sixteenth-order method for nonlinear equations
• Iterative methods based on the signum function approach for solving nonlinear equations
• A family of Steffensen type methods with seventh-order convergence
• New iterative methods for solving nonlinear equation by using homotopy perturbation method
• An efficient family of weighted-Newton methods with optimal eighth order convergence
• On efficient two-parameter methods for solving nonlinear equations
• A non-iterative method for solving non-linear equations
• Two weighted eight-order classes of iterative root-finding methods
• Optimal Order of One-Point and Multipoint Iteration
• On the guaranteed convergence of a cubically convergent Weierstrass-like root-finding method

This page was built for publication: A fast and robust method for computing real roots of nonlinear equations