Fast parallel algorithms for matrix reduction to normal forms
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.
scientific article; zbMATH DE number 1180592