×

A note on Babylonian square-root algorithm and related variants. (English) Zbl 0948.65048

The authors connect the square-root algorithm developed by Old Babylonians before 4000 years and some iterative procedures as Newton and Weierstrass methods. Special attention is devoted to the global convergence of these methods for the quadratic polynomial. An accelerated method of the fourth order is also given.

MSC:

65H05 Numerical computation of solutions to single equations
12Y05 Computational aspects of field theory and polynomials (MSC2010)
26C10 Real polynomials: location of zeros
30C15 Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)
PDFBibTeX XMLCite
Full Text: EuDML