Fast Iterative Division of p-adic Numbers

Krishnamurthy Krishnamurthy

IEEE Transactions on Computers · 1983 · 11 citations · 7 references

Concepts

Abstract

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.

References

7