Nearly Optimal Algorithms for Canonical Matrix Forms (Q4857589)
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: Nearly Optimal Algorithms for Canonical Matrix Forms |
scientific article; zbMATH DE number 821922
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nearly Optimal Algorithms for Canonical Matrix Forms |
scientific article; zbMATH DE number 821922 |
Statements
Nearly Optimal Algorithms for Canonical Matrix Forms (English)
0 references
2 June 1996
0 references
matrix powering
0 references
matrix multiplication
0 references
processor-efficient parallel algorithms
0 references
Las-Vegas-type probabilistic algorithm
0 references
Frobenius canonical form
0 references
complexity
0 references
evaluating polynomials at matrices
0 references
rational Jordan form
0 references
0.913015067577362
0 references
0.839512825012207
0 references
