On asymptotic stability of delay-difference systems (Q2496013)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5037961
Language Label Description Also known as
default for all languages
No label defined
    English
    On asymptotic stability of delay-difference systems
    scientific article; zbMATH DE number 5037961

      Statements

      On asymptotic stability of delay-difference systems (English)
      0 references
      0 references
      0 references
      0 references
      30 June 2006
      0 references
      The stability of recursive systems of the form \[ \begin{aligned} x(k+1)&=A(k)x(k)+B(k)x(k-\tau ),\\ \Delta \left[ x(k)-Cx(k-\tau )\right] &=Ax(k)+Bx(k-\tau ),\\ x(k+1)&=Ax(k)+\sum_{i=1}^{m}A_{i}x(k-\tau _{i}),\\ x(k+1)&=f(x(k))+c\sum_{i=1}^{m}A_{i}g(x(k-\tau _{i})), \end{aligned} \] are discussed, where \(A,B,C,A_{i},A(k),B(k)\) are real square matrices, \(\tau ,\tau _{i}\) are positive integers, \(c>0,\) and \(f,g\) are real \(C^{(1)}\) functions. It is shown that if certain matrices are positive definite, then the trivial solutions of the above systems are stable. Since these matrices involve undetermined submatrices, these stability criteria are difficult to apply. Further explicit conditions are needed.
      0 references
      0 references
      discrete Lyapunov method
      0 references
      difference system
      0 references
      delay-difference equations
      0 references
      matrix inequalities
      0 references

      Identifiers