Fast parallel matrix and gcd computations
Journal Article
·
· Inf. Control; (United States)
Parallel algorithms to compute the determinant and characteristic polynomial of matrices and the gcd of polynomials are presented. The rank of matrices and solutions of arbitrary systems of linear equations are computed by parallel Las Vegas algorithms. All algorithms work over arbitrary fields. They run in parallel time o(log/sup 2/ n) (where n is the number of inputs) and use a polynomial number of processors. 21 references.
- Research Organization:
- Univ. of Toronto, Canada
- OSTI ID:
- 5436319
- Journal Information:
- Inf. Control; (United States), Journal Name: Inf. Control; (United States) Vol. 3; ISSN IFCNA
- 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
Fast parallel algorithms for graph-theoretic problems: matching, coloring, and partitioning
Book
·
Thu Dec 31 23:00:00 EST 1981
·
OSTI ID:6292675
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
Fast parallel algorithms for graph-theoretic problems: matching, coloring, and partitioning
Thesis/Dissertation
·
Mon Dec 31 23:00:00 EST 1984
·
OSTI ID:5062298