Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6327
Title: Fast Parallel Matrix and GCD Computations
Authors: Borodin, Allan B.
Von zur Gathen, Joachim
Hopcroft, John E.
Keywords: computer science
technical report
Issue Date: Apr-1982
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR82-487
Abstract: We present parallel algorithms to compute the determinant and characteristic polynomial of n x n-matrices and the gcd of polynomials of degree $\leq$n. The algorithms use parallel time $O(\log^{2}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.
URI: http://hdl.handle.net/1813/6327
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
82-487.pdf1.69 MBAdobe PDFView/Open
82-487.ps479.58 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us