Pages that link to "Item:Q521932"

The following pages link to Comparative study of eighth-order methods for finding simple roots of nonlinear equations (Q521932):

Displaying 19 items.

• How good are methods with memory for the solution of nonlinear equations? (Q1689279) (← links)
• Generating function method for constructing new iterations (Q1740165) (← links)
• Comparing the geometry of the basins of attraction, the speed and the efficiency of several numerical methods (Q1794682) (← links)
• An optimal thirty-second-order iterative method for solving nonlinear equations and a conjecture (Q2114405) (← links)
• Computers in mathematical research: the study of three-point root-finding methods (Q2189414) (← links)
• Computer visualization and dynamic study of new families of root-solvers (Q2231295) (← links)
• Construction of stable and globally convergent schemes for the matrix sign function (Q2273833) (← links)
• Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros (Q2291994) (← links)
• On developing a novel sixth order transformation method for multiple roots and its basins of attraction (Q2301159) (← links)
• A note on ``Convergence radius of Osada's method under Hölder continuous condition'' (Q2423088) (← links)
• Small modification on modified Euler method for solving initial value problems (Q2664890) (← links)
• (Q3300217) (← links)
• An optimal eighth-order class of three-step weighted Newton's methods and their dynamics behind the purely imaginary extraneous fixed points (Q5028577) (← links)
• (Q5049838) (← links)
• (Q5132521) (← links)
• COMPARATIVE STUDY OF METHODS OF VARIOUS ORDERS FOR FINDING SIMPLE ROOTS OF NONLINEAR EQUATIONS (Q5859355) (← links)
• A general approach for improving the Padé iterations for the matrix sign function (Q6073161) (← links)
• Memory in the iterative processes for nonlinear problems (Q6182970) (← links)
• New family of root-finding algorithms based on inverse rational interpolation (Q6195504) (← links)