Convergence Radius of Traub's Method for Multiple Roots under Center-H?lder Continuous Condition
at present,people have proposed a new method to estimate the convergence ra-dius of iterative algorithm for solving multiple roots based on Taylor expansion.This method has estimated the convergence radius of Newton method and the convergence radius of Osada algorithm and Halley algorithm for solving multiple roots,but the calculated convergence radius is relatively large.This paper will solve the convergence radius of Traub algorithm with multiple roots under the central Hölder condition,and compare the calculation results through specific examples.The calculation result of Traub algorithm is obviously better than that of Osada and Halley algorithm under the same conditions.
multiple roots of nonlinear equationsTraub algorithmcentral Hölder condition
NETL
NSTL
万方数据
