Constrained Matrix Sylvester Equations
Copyright policy )Constrained Matrix Sylvester Equations
Etant données les matrices \(A(n\times n)\), \(B(n\times p)\), \(C(m\times n)\), \(F((n-m)\times (n-u))\), le problème est de déterminer les matrices \(L((n-m)\times m)\) et \(T((u-m)\times n)\) telles que \(TA-FT=LC\) et \(TB=0\). Les A. établissent des conditions d'existence des solutions ainsi qu'un algorithme de calcul. Un exemple numérique est donné.
algorithm, matrix Lyapunov equation, Sylvester operator, loop transfer recovery, Other matrix algorithms, Matrix equations and identities, reduced-order observes, Computational methods in systems theory, Control/observation systems governed by ordinary differential equations
algorithm, matrix Lyapunov equation, Sylvester operator, loop transfer recovery, Other matrix algorithms, Matrix equations and identities, reduced-order observes, Computational methods in systems theory, Control/observation systems governed by ordinary differential equations
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).26 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!