We present polynomial upper and lower bounds on the number of iterations performed by Lloyd’s method for k-means clustering. Our upper bounds are polynomial in the number of points, number of clusters, and the spread of the point set. We also present a lower bound, showing that in the worst case the k-means heuristic needs to perform Ω(n) iterations, for n points on the real line and two center...

we are concerned with the development of a k−step method for the numerical solution of fuzzy initial value problems. convergence and stability of the method are also proved in detail. moreover, a specific method of order 4 is found. the numerical results show that the proposed fourth order method is efficient for solving fuzzy differential equations.

We are concerned with the development of a K−step method for the numerical solution of fuzzy initial value problems. Convergence and stability of the method are also proved in detail. Moreover, a specific method of order 4 is found. The numerical results show that the proposed fourth order method is efficient for solving fuzzy differential equations.