An algorithm for solving the matrix polynomial equation B(s)D(s)+A(s)N(s)=H(s)

DOI10.1109/31.192417zbMath0691.65025OpenAlexW1986188892MaRDI QIDQ3033206

Yheansen Lai

Publication date: 1989

Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

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

zbMATH Keywords

linear equationmatrix polynomial equationdiophantine matrix equationrow-searching algorithm

Mathematics Subject Classification ID

Related Items (6)

Solving multivariate polynomial matrix Diophantine equations with Gröbner basis method ⋮ Application of implicit system feedback to solving the diophantine equation ⋮ Pole assignment at infinity and polynomial matrix equations ⋮ Parametric solutions to Sylvester-conjugate matrix equations ⋮ On eigenstructure assignment using block poles placement ⋮ A robust solution of the generalized polynomial Bézout identity

This page was built for publication: An algorithm for solving the matrix polynomial equation B(s)D(s)+A(s)N(s)=H(s)