Fast parallel algorithms for matrix reduction to normal forms (Q1392668)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast parallel algorithms for matrix reduction to normal forms |
scientific article; zbMATH DE number 1180592
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast parallel algorithms for matrix reduction to normal forms |
scientific article; zbMATH DE number 1180592 |
Statements
Fast parallel algorithms for matrix reduction to normal forms (English)
0 references
28 July 1998
0 references
Fast parallel algorithms are examined to compute normal forms of matrices and the corresponding transformations. The computational complexity is given for the Frobenius and Smith normal forms as well as for the Hermite and Jordan normal forms.
0 references
matrix reduction
0 references
efficiency
0 references
Frobenius normal form
0 references
canonical forms
0 references
fast parallel algorithms
0 references
computational complexity
0 references
Smith normal forms
0 references
Jordan normal forms
0 references
