Accession Number : ADA113577

Title :   Fast Parallel Matrix and GCD Computations.

Descriptive Note : Technical rept.,

Corporate Author : CORNELL UNIV ITHACA NY DEPT OF COMPUTER SCIENCE

Personal Author(s) : Borodin,Allan ; von zur Gathen,Joachim ; Hopcroft,John E

PDF Url : ADA113577

Report Date : Apr 1982

Pagination or Media Count : 34

Abstract : We present parallel algorithms to compute the determinant and characteristics polynomial of nxn-matrices and the gcd of polynomials of degree less than or equal n. The algorithms use parallel time O(log to the 2nd power n) and a polynomial number of processors. We also give a fast parallel Monte Carlo algorithm for the rank of matrices. All algorithms work over arbitrary fields. (Author)

Descriptors :   *Matrices(Mathematics), *Polynomials, *Division, Matrix theory, Determinants(Mathematics), Computations, Algorithms, Monte Carlo method, Ranking, Problem solving, Sequences(Mathematics), Linear algebraic equations

Subject Categories : Theoretical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE