A unique code (called Hensel's code) is derived for a rational number by truncating its infinite p-adic expansion. The four basic arithmetic algorithms for these codes are described and their application to rational matrix computations is demonstrated by solving a system of linear equations exactly, using the Gaussian elimination procedure
This paper considers the problem of effective algorithms for some problems having structured coeffic...
Triangular matrix decompositions are fundamental building blocks in computational linear algebra. Th...
In this work we are concerned with the calculation of the Hensel codes of square roots of p-adic num...
A fractional weighted number system, based on Hensel's p-adic number system, is proposed for constru...
An error-free carry-free (parallel) rational arithmetic system based on residue and p-adic represent...
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 ...
A fast iterative scheme based on the Newton method is described for finding the reciprocal of a fini...
The solution to a set of simultaneous equations is of the form A-1 B = X where A-1 is the inverse of...
AbstractIn a finite segment p-adic number system one of the difficult problems is concerned with con...
In this work we describe the use of truncated p-adic expansion for handling rational numbers by para...
In this work we describe the use of truncated p-adic expansion of handling rational numbers by paral...
We have advanced the application of algorithms within a method of basic matrices, which are equipped...
180 pagesNew numerical methods using rational functions are presented for applications in linear alg...
A Straight-line code, which consists of assignment, addition, and multiplication statements is an ab...
This paper considers the problem of effective algorithms for some problems having structured coeffic...
Triangular matrix decompositions are fundamental building blocks in computational linear algebra. Th...
In this work we are concerned with the calculation of the Hensel codes of square roots of p-adic num...
A fractional weighted number system, based on Hensel's p-adic number system, is proposed for constru...
An error-free carry-free (parallel) rational arithmetic system based on residue and p-adic represent...
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 ...
A fast iterative scheme based on the Newton method is described for finding the reciprocal of a fini...
The solution to a set of simultaneous equations is of the form A-1 B = X where A-1 is the inverse of...
AbstractIn a finite segment p-adic number system one of the difficult problems is concerned with con...
In this work we describe the use of truncated p-adic expansion for handling rational numbers by para...
In this work we describe the use of truncated p-adic expansion of handling rational numbers by paral...
We have advanced the application of algorithms within a method of basic matrices, which are equipped...
180 pagesNew numerical methods using rational functions are presented for applications in linear alg...
A Straight-line code, which consists of assignment, addition, and multiplication statements is an ab...
This paper considers the problem of effective algorithms for some problems having structured coeffic...
Triangular matrix decompositions are fundamental building blocks in computational linear algebra. Th...
In this work we are concerned with the calculation of the Hensel codes of square roots of p-adic num...