Fast parallel algorithms for matrix reduction to normal forms

DOI10.1007/S002000050089MaRDI QIDQ1392668zbMATH OpenOpenAlexFDO

Authors 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

canonical formscomputational complexityefficiencyfast parallel algorithmsFrobenius normal formJordan normal formsmatrix reductionSmith normal forms

Mathematics Subject Classification ID

Canonical forms, reductions, classification (15A21) Parallel numerical computation (65Y05)

Recommendations

• Parallel algorithms for matrix normal forms
• scientific article; zbMATH DE number 1256647
• Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
• Nearly Optimal Algorithms for Canonical Matrix Forms

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

Describes a project that uses

Uses Software

• Givaro

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)