This section briefly reviews some well known square root iterative
algorithms, and derives the Newton-Raphson and Secant methods. It also
shows that Muir's iteration for the square root (Claerbout, 1995)
belongs to the same family of iterative methods, if we make an
appropriate choice of the generating function.
![[pdf]](icons/pdf.png){kind=icon}