The performance of the secant method in the field of $p$-adic numbers

Abstract

In this paper, we compute the square roots of p-adic numbers in Qp, using the secant method. We also study the performance of this method: the speed of its convergence and the number of iterations necessary to obtain the desired precision M which represents the number of p-adic digits in the development of √ a.