Fast parallel algorithms for matrix reduction to normal forms

From MaRDI portal





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.





Describes a project that uses

Uses Software






This page was built for publication: Fast parallel algorithms for matrix reduction to normal forms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1392668)