We connect the square-root algorithm developed by Old Babylonians before 4000 years and some iterative procedures as Newton and Weierstrass's methods. Special attention is devoted to the global convergence of these methods for the quadratic polynomial. We also give an accelerated method of the fourth order which is also connected with Babylonian's formula.