DocumentCode
1148486
Title
Fast Iterative Division of p-adic Numbers
Author
Krishnamurthy ; MURTHY, VENU K.
Author_Institution
Department of Applied Mathematics, Indian Institute of Science, Bangalore 560012, India, and the IDL—Nitro Nobel Basic Research Institute
Issue
4
fYear
1983
fDate
4/1/1983 12:00:00 AM
Firstpage
396
Lastpage
398
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.
Keywords
Hensel code; Hensel lemma; Newton method; higher order convergence; iterate; p-adic numbers; quadratic convergence; reciprocal; Arithmetic; Convergence; Galois fields; Iterative algorithms; Iterative methods; Mathematics; Newton method; Venus; Hensel code; Hensel lemma; Newton method; higher order convergence; iterate; p-adic numbers; quadratic convergence; reciprocal;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1983.1676241
Filename
1676241
Link To Document