A geometric construction of iterative functions of order three to solve nonlinear equations

DOI10.1016/j.camwa.2007.01.007zbMath1141.65030OpenAlexW1980093875MaRDI QIDQ2458699

Changbum Chun

Publication date: 2 November 2007

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2007.01.007

zbMATH Keywords

Newton's methoditerative methodsnonlinear equationsnumerical experimentorder of convergenceroot-findingiteration function

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items

An efficient hyperpower iterative method for computing weighted Moore-Penrose inverse, Sensitivity of iterated function systems under the product operation, An optimal and efficient general eighth-order derivative free scheme for simple roots, New predictor-corrector methods for solving nonlinear equations, Chebyshev-type methods and preconditioning techniques, Certain improvements of Newton's method with fourth-order convergence, How to increase convergence order of the Newton method to \(2\times m\)?, An efficient class of iterative methods for computing generalized outer inverse \({M_{T,S}^{(2)}}\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A modification of Newton method with third-order convergence
• A modified Newton method for rootfinding with cubic convergence.
• Some variant of Newton's method with third-order convergence.
• A new continuation Newton-like method and its deformation
• On Newton-type methods with cubic convergence
• Some new variants of Newton's method.
• On a class of quadratically convergent iteration formulae
• A variant of Newton's method with accelerated third-order convergence