Reliable numerical methods for polynomial matrix triangularization

DOI10.1109/9.751344zbMath0956.65036OpenAlexW2038130734MaRDI QIDQ4506705

Michael Šebek, Didier Henrion

Publication date: 17 October 2000

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/9.751344

zbMATH Keywords

interpolationalgorithmspolynomial matricesring of polynomialsSylvester matricestriangularization methodspolynomial fractionsgreatest common divisor extractionpolynomial null-space computationpolynomial rank evaluation

Mathematics Subject Classification ID

Related Items (7)

A Toeplitz algorithm for polynomial \(J\)-spectral factorization ⋮ Revisiting the Matrix Polynomial Greatest Common Divisor ⋮ Implicitization of rational hypersurfaces via linear syzygies: a practical overview ⋮ A coprime factorisation and its application in ℋ₂ control ⋮ Unnamed Item ⋮ An improved Toeplitz algorithm for polynomial matrix null-space computation ⋮ Spectral factorization of non-symmetric polynomial matrices

Uses Software

• mctoolbox

This page was built for publication: Reliable numerical methods for polynomial matrix triangularization