Add to ORKGA 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
Current implementations of p-adic numbers usually rely on so called zealous algorithms, which comput...
The order-N Farey fractions, where N is the largest integer satisfying N<= ˆ(p-1)/2, can be mapp...
This document contains the notes of a lecture I gave at the "Journées Nationales du Calcul Formel" (...
A fast iterative scheme based on the Newton method is described for finding the reciprocal of a fini...
A fractional weighted number system, based on Hensel's p-adic number system, is proposed for constru...
AbstractIn a finite segment p-adic number system one of the difficult problems is concerned with con...
In this work we are concerned with the calculation of the Hensel codes of square roots of p-adic num...
A unique code (called Hensel's code) is derived for a rational number by truncating its infinite p-a...
AbstractThe standard way to compute a p-adic zero α of a univariate polynomial f is to use Newton’s ...
Three different algorithms are described for the conversion of Hensel codes to Farey rationals. The ...
Three different algorithms are described for the conversion of Hensel codes to Farey rationals. The ...
In this work we describe the use of truncated p-adic expansion for handling rational numbers by para...
We design algorithms for computing values of many p-adic elementary and special functions, including...
In this work we describe the use of truncated p-adic expansion of handling rational numbers by paral...
This thesis is concerned with algorithmic investigations in p-adically closed fields, of which Hens...
Current implementations of p-adic numbers usually rely on so called zealous algorithms, which comput...
The order-N Farey fractions, where N is the largest integer satisfying N<= ˆ(p-1)/2, can be mapp...
This document contains the notes of a lecture I gave at the "Journées Nationales du Calcul Formel" (...
A fast iterative scheme based on the Newton method is described for finding the reciprocal of a fini...
A fractional weighted number system, based on Hensel's p-adic number system, is proposed for constru...
AbstractIn a finite segment p-adic number system one of the difficult problems is concerned with con...
In this work we are concerned with the calculation of the Hensel codes of square roots of p-adic num...
A unique code (called Hensel's code) is derived for a rational number by truncating its infinite p-a...
AbstractThe standard way to compute a p-adic zero α of a univariate polynomial f is to use Newton’s ...
Three different algorithms are described for the conversion of Hensel codes to Farey rationals. The ...
Three different algorithms are described for the conversion of Hensel codes to Farey rationals. The ...
In this work we describe the use of truncated p-adic expansion for handling rational numbers by para...
We design algorithms for computing values of many p-adic elementary and special functions, including...
In this work we describe the use of truncated p-adic expansion of handling rational numbers by paral...
This thesis is concerned with algorithmic investigations in p-adically closed fields, of which Hens...
Current implementations of p-adic numbers usually rely on so called zealous algorithms, which comput...
The order-N Farey fractions, where N is the largest integer satisfying N<= ˆ(p-1)/2, can be mapp...
This document contains the notes of a lecture I gave at the "Journées Nationales du Calcul Formel" (...