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žené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on computers Ročník C-32; číslo 4; s. 396 - 398
Hlavní autori:	KRISHNAMURTHY, E. V, MURTHY, V. K
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York, NY IEEE 01.04.1983 Institute of Electrical and Electronics Engineers
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!