This paper presents an algorithm for evaluating an arithmetic expression over "big" rational numbers. The method exploits \(p\)-adic arithmetic and parallelism to achieve efficiency. Roughly, the algorithm begins by mapping the input rational numbers to the related p-adic codes for several prime ba
Parallel p-adic computation
β Scribed by John F. Morrison
- Book ID
- 113163275
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 525 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We present a parallel algorithm for an exact solution of an integer linear system of equations using the single modulus p-adic expansion technique. More specifically, we parallelize an algorithm of Dixon, and present our implementation results on a distributed-memory multiprocessor. The parallel alg
We consider the problem of bringing a given matrix into "cyclic form," from which the rational form can be computed easily. Matrices are taken to have p-adic integer entries, and computations are done with rational integer approximations to p-adic integers. We give bounds on the precision necessary