Improved polynomial matrix determinant computation

DOI10.1109/81.795848MaRDI QIDQ4510477zbMATH OpenOpenAlexFDO

Authors Michael Sebek, 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

polynomial matrixrational matrixdeterminant computationSmith-MacMillan formdeterminant interpolationdeterminant zeroing

Mathematics Subject Classification ID

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

Recommendations

• Computing the determinant of a matrix with polynomial entries by approximation
• A compound matrix algorithm for the computation of the Smith form of a polynomial matrix
• scientific article; zbMATH DE number 708841
• Improved algorithms for computing determinants and resultants
• An effective algorithm of computing symbolic determinants with multivariate polynomial entries

Cited in

(6)

• Computing determinants of rational functions
• An effective algorithm of computing symbolic determinants with multivariate polynomial entries
• 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
• On the fundamental matrix of the inverse of a polynomial matrix and applications to ARMA representations
• Degree of Dieudonné determinant defines the order of nonlinear system
• Computing the determinant of a matrix with polynomial entries by approximation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4510477)