A new block algorithm for full-rank solution of the sylvester-observer equation
From MaRDI portal
Publication:5266665
DOI10.1109/TAC.2003.820150zbMath1364.93235OpenAlexW2136521735MaRDI QIDQ5266665
No author found.
Publication date: 20 June 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tac.2003.820150
Related Items
Unique Full-Rank Solution of the Sylvester-Observer Equation and Its Application to State Estimation in Control Design ⋮ Computational Methods for Linear Matrix Equations ⋮ A new algorithm for generalized Sylvester-observer equation and its application to state and velocity estimations in vibrating systems ⋮ Solutions of the generalized Sylvester matrix equation and the application in eigenstructure assignment ⋮ Closed-form solutions to Sylvester-conjugate matrix equations ⋮ Finite iterative algorithms for the generalized Sylvester-conjugate matrix equation \(AX+BY=E\overline{X}F+S\) ⋮ On closed-form solutions to the generalized Sylvester-conjugate matrix equation ⋮ On solutions of matrix equations \(V - AVF = BW\) and \(V-A\bar V F= BW\) ⋮ Solving the generalized Sylvester matrix equation \(AV+BW=EVF\) via a Kronecker map ⋮ Proportional multiple‐integral observer design for continuous‐time descriptor linear systems ⋮ Proportional multiple-integral observer design for discrete-time descriptor linear systems