Comparative study of eighth-order methods for finding simple roots of nonlinear equations

From MaRDI portal
Publication:521932

DOI10.1007/S11075-016-0191-YzbMath1362.65054OpenAlexW2511950701MaRDI QIDQ521932

Beny Neta, Changbum Chun

Publication date: 12 April 2017

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-016-0191-y




Related Items (19)

Unnamed ItemSmall modification on modified Euler method for solving initial value problemsComputers in mathematical research: the study of three-point root-finding methodsA general approach for improving the Padé iterations for the matrix sign functionHow good are methods with memory for the solution of nonlinear equations?A note on ``Convergence radius of Osada's method under Hölder continuous conditionMemory in the iterative processes for nonlinear problemsNew family of root-finding algorithms based on inverse rational interpolationComputer visualization and dynamic study of new families of root-solversGenerating function method for constructing new iterationsUnnamed ItemConstruction of stable and globally convergent schemes for the matrix sign functionComparing the geometry of the basins of attraction, the speed and the efficiency of several numerical methodsComputer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zerosOn developing a novel sixth order transformation method for multiple roots and its basins of attractionUnnamed ItemCOMPARATIVE STUDY OF METHODS OF VARIOUS ORDERS FOR FINDING SIMPLE ROOTS OF NONLINEAR EQUATIONSAn optimal thirty-second-order iterative method for solving nonlinear equations and a conjectureAn optimal eighth-order class of three-step weighted Newton's methods and their dynamics behind the purely imaginary extraneous fixed points




Cites Work




This page was built for publication: Comparative study of eighth-order methods for finding simple roots of nonlinear equations