Matrix Processors Using p-adic Arithmetic for Exact Linear Computations

Authors:
E. V. Krishnamurthy
Affiliations:
Department of Applied Mathematics, Indian Institute of Science
Venue:
IEEE Transactions on Computers
Year:
1977

Citing 1
Cited 7

The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Comments on "Matrix Processors Using p-Adic Arithmetic for Exact Linear Computations"

IEEE Transactions on Computers
Implementing Exact Calculations in Hardware

IEEE Transactions on Computers
On the Conversion of Hensel Codes to Farey Rationals

IEEE Transactions on Computers
Error Free Computation: A Direct Method to Convert Finite-Segment p-Adic Numbers into Rational Numbers

IEEE Transactions on Computers
Fast Iterative Division of p-adic Numbers

IEEE Transactions on Computers
A method for Hensel code overflow detection

ACM SIGAPP Applied Computing Review
Implementation of the polynomial method to calculate eAt using P-adic

Proceedings of the 2012 ACM Research in Applied Computation Symposium

Quantified Score

Hi-index	15.01

Visualization

Abstract

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.