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.
Recommendations
Cited in
(11)- The complexity of the characteristic and the minimal polynomial.
- Families of Algorithms for Reducing a Matrix to Condensed Form
- Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
- COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME
- scientific article; zbMATH DE number 7089070 (Why is no real title available?)
- Normalization of row reduced matrices
- A local construction of the Smith normal form of a matrix polynomial
- Elimination ideal and bivariate resultant over finite fields
- Bivariate polynomial reduction and elimination ideal over finite fields
- Computing Krylov iterates in the time of matrix multiplication
- Parallel algorithms for matrix normal forms
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)