Parallel polynomial arithmetic over finite rings
โ Scribed by Robert D. Silverman
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 592 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
โฆ Synopsis
Convolution algorithms for polynomial multiplication are well known, as is the use of Residue Number Systems and the Chinese Remainder Theorem. This paper discusses how these techniques may be used to perform polynomial arithmetic over very large rings or finite fields. The algorithm is practical and structured so that it can be implemented very efficiently on either a shared memory or a message passing parallel computer. We discuss the mathematical basis of the algorithm and contrast its performance on an Alliant FX/8 and a Symult S2010. These are, respectively, shared memory and message passing parallel computers.
๐ SIMILAR VOLUMES
Efficient algorithms are presented for factoring polynomials in the skew-polynomial ring F[x; ฯ], a non-commutative generalization of the usual ring of polynomials F[x], where F is a finite field and ฯ: F โ F is an automorphism (iterated Frobenius map). Applications include fast functional decomposi
For each finite field K, we construct a commutative Goldie K-algebra R such that the polynomial ring R x is not a Goldie ring. This generalizes a construction of Kerr.
Given the ring of integers R of an algebraic number field K, for which natural ลฝ . number n is there a finite group G ; GL n, R such that RG, the R-span of G, ลฝ . ลฝ . ลฝ . coincides with M n, R , the ring of n = n -matrices over R? Given G ; GL n, R ลฝ . we show that RG s M n, R if and only if the Bra