While eagerly searching for iterative methods to approximate $f(x)=0$ (commonly known as root-finder) for the quantile function or probit, I stumbled over "Ostrowski’s square root technique". Alas, it was mentioned only, given a formula: $$x_{n+1}=x_n-\frac{f}{f'}\sqrt{\frac{m}{\displaystyle 1-\frac{f\cdot f''}{(f')^2}}}$$ where $f$ stands for $f(x_n)$ and homological regarding $f'$ and $f''$. About $m$ the hint "... $m$ is the modification when the multiplicity $m$ is $\gt 1$", but no description, no discussion.
Apparently all publications of Ostrowski or papers related to his work are guarded behind pay-walls. That is why I ask for public available descriptions of "Ostrowski’s square root technique", its convergence behaviour, the use of $m$ and/or its relation to $f$.
BTW, I miss the tag root-finder, what is the canonical correct qualifier for those algorithms?