Fast parallel algorithms for matrix reduction to normal forms

DOI10.1007/s002000050089zbMath0905.65054OpenAlexW2170966175MaRDI QIDQ1392668

Gilles Villard

Publication date: 28 July 1998

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002000050089

zbMATH Keywords

computational complexityefficiencycanonical formsfast parallel algorithmsFrobenius normal formSmith normal formsmatrix reductionJordan normal forms

Mathematics Subject Classification ID

Related Items (3)

A local construction of the Smith normal form of a matrix polynomial ⋮ Elimination ideal and bivariate resultant over finite fields ⋮ The complexity of the characteristic and the minimal polynomial.

Uses Software

• Givaro

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