IEEE Transactions on Computers · 1983 · 11 citations · 7 references
ComputingComputer ScienceMathematicsAlgorithmsNumber TheoryTheory Of ComputationComputational Number TheoryIterative SolversNumber-theoretic AlgorithmsNumerical AlgorithmsNumerical AnalysisP-adic Number TheoryArithmetic Of Finite FieldsDivision AlgorithmsFinite Field ArithmeticFinite Field ComputationNewton ConvergenceP-adic AlgorithmsP-adic Numbers
A fast iterative scheme based on the Newton method is described for finding the reciprocal of a finite segment p-adic numbers (Hensel code). The rate of generation of the reciprocal digits per step can be made quadratic or higher order by a proper choice of the starting value and the iterating function. The extension of this method to find the inverse transform of the Hensel code of a rational polynomial over a finite field is also indicated.
7