DocumentCode
2188417
Title
Fast parallel matrix and GCD computations
Author
Borodin, Allan ; Borodin, Allan ; Borodin, Allan ; Borodin, Allan ; von zur Gathem, Joachim ; von zur Gathem, Joachim ; von zur Gathem, Joachim ; von zur Gathem, Joachim ; Hopcroft, John ; Hopcroft, John ; Hopcroft, John ; Hopcroft, John
fYear
1982
fDate
3-5 Nov. 1982
Firstpage
65
Lastpage
71
Abstract
We present parallel algorithms to compute the determinant and characteristic polynomial of n×n-matrices and the gcd of polynomials of degree ≤n. The algorithms use parallel time O(log2n) and a polynomial number of processors. We also give a fast parallel Las Vegas algorithm for the rank of matrices. All algorithms work over arbitrary fields.
Keywords
Concurrent computing; Equations; Galois fields; Monte Carlo methods; Parallel algorithms; Parallel programming; Phase change random access memory; Polynomials; Testing; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1982. SFCS '08. 23rd Annual Symposium on
Conference_Location
Chicago, IL, USA
ISSN
0272-5428
Type
conf
DOI
10.1109/SFCS.1982.17
Filename
4568376
Link To Document