scientific article; zbMATH DE number 3255157
From MaRDI portal
Publication:5541562
Cited in
(13)- Symbolic computation and computer graphics as tools for developing and studying new root-finding methods
- A general approach to the study of the convergence of Picard iteration with an application to Halley's method for multiple zeros of analytic functions
- Computer visualization and dynamic study of new families of root-solvers
- On the convergence radius of the modified Newton method for multiple roots under the center-Hölder condition
- Two optimal general classes of iterative methods with eighth-order
- On the convergence of Halley's method for multiple polynomial zeros
- On the convergence of Chebyshev's method for multiple polynomial zeros
- Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple polynomial zeros
- On a numerical technique for finding multiple zeros and its dynamic
- Extended Kung-Traub-type method for solving equations
- Unified ball convergence of inexact methods for finding zeros with multiplicity
- On a modification of Chebyshev's method
- A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5541562)
