Improved polynomial matrix determinant computation

DOI10.1109/81.795848zbMath0968.65026OpenAlexW2144828708MaRDI QIDQ4510477

Michael Šebek, Didier Henrion

Publication date: 29 October 2000

Published in: IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8d38c964287e5a89e83e0889ba28cab4be6d04a9

zbMATH Keywords

rational matrixpolynomial matrixdeterminant computationSmith-MacMillan formdeterminant interpolationdeterminant zeroing

Mathematics Subject Classification ID

Numerical computation of determinants (65F40) Matrices over function rings in one or more variables (15A54)

Related Items (4)

On the extension of Sarrus' rule to \(n \times n\) (\(n > 3\)) matrices: development of new method for the computation of the determinant of \(4 \times 4\) matrix ⋮ Degree of Dieudonné determinant defines the order of nonlinear system ⋮ An effective algorithm of computing symbolic determinants with multivariate polynomial entries ⋮ On the fundamental matrix of the inverse of a polynomial matrix and applications to ARMA representations

This page was built for publication: Improved polynomial matrix determinant computation