Fast Iterative Division of p-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 funct...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on computers Ročník C-32; číslo 4; s. 396 - 398
Hlavní autoři: KRISHNAMURTHY, E. V, MURTHY, V. K
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.04.1983
Institute of Electrical and Electronics Engineers
Témata:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Arithmetic
Circuits and systems
Codes
Computer science; control theory; systems
Convergence
Digital signal processing
Exact sciences and technology
Finite element analysis
Hensel code
Hensel lemma
higher order convergence
iterate
Iterative methods
Laplace equations
Newton method
p-adic numbers
Polynomials
quadratic convergence
reciprocal
Theoretical computing
Computers arithmetic
ISSN:0018-9340, 1557-9956
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.1983.1676241