Efficient families of Newton's method and its variants suitable for non-convergent cases

DOI10.1007/s13370-015-0376-xzbMath1354.65095OpenAlexW1770013177MaRDI QIDQ337957

Arvind Garg, Sanjeev Kumar, Munish Kansal, Vinay Kanwar

Publication date: 3 November 2016

Published in: Afrika Matematika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13370-015-0376-x

zbMATH Keywords

Newton's methodsystem of nonlinear equationssimple zerosJarratt's methodSchröder's methodTraub-Ostrowski's method

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Numerical computation of solutions to single equations (65H05)

Related Items (1)

Two-phase quasi-Newton method for unconstrained optimization problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometrically constructed families of Newton's method for unconstrained optimization and nonlinear equations
• Numerical methods for roots of polynomials. Part I
• New optimal class of higher-order methods for multiple roots, permitting \(f'(x_{n})=0\)
• Modified families of Newton, Halley and Chebyshev methods
• New third-order method for solving systems of nonlinear equations
• A new continuation Newton-like method and its deformation
• A one-parameter family of third-order methods to solve nonlinear equations
• Modified families of multi-point iterative methods for solving nonlinear equations
• Simple geometric constructions of quadratically and cubically convergent iterative functions to solve nonlinear equations
• Efficient continuation Newton-like method for solving systems of non-linear equations
• Optimal Order of One-Point and Multipoint Iteration

This page was built for publication: Efficient families of Newton's method and its variants suitable for non-convergent cases