Fast parallel matrix and gcd computations
Book
·
OSTI ID:6292675
The authors 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(log/sup 2/n) and a polynomial number of processors. Also given is a fast parallel Las Vegas algorithm for the rank of matrices. All algorithms work over arbitrary fields. 19 references.
- OSTI ID:
- 6292675
- Country of Publication:
- United States
- Language:
- English
Similar Records
Fast parallel matrix and gcd computations
A new approach to parallel computation of polynomial GCD and to related parallel computations over fields and integer rings
Transitive reduction in parallel via branchings
Journal Article
·
Sun Feb 28 23:00:00 EST 1982
· Inf. Control; (United States)
·
OSTI ID:5436319
A new approach to parallel computation of polynomial GCD and to related parallel computations over fields and integer rings
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:416837
Transitive reduction in parallel via branchings
Book
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:6471860