Fast parallel algorithms for matrix reduction to normal forms (Q1392668): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s002000050089 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2170966175 / rank | |||
Normal rank | |||
Latest revision as of 22:50, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast parallel algorithms for matrix reduction to normal forms |
scientific article |
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
