A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf
.
Fast Parallel Algorithms for Matrix Reduction to Normal Forms
1997
Applicable Algebra in Engineering, Communication and Computing
We investigate fast parallel algorithms to compute normal forms of matrices and the corresponding transformations. Given a matrix B in M LL (K), where K is an arbitrary commutative field, we establish that computing a similarity transformation P such that F"P\BP is in Frobenius normal form can be done in NC ) . Using a reduction to this first problem, a similar fact is then proved . We get that over concrete fields such as the rationals, these problems are in NC. Using our previous results we
doi:10.1007/s002000050089
fatcat:nq52uowzobh3dasfbkwfrvs76y