Dissipativity analysis for discrete stochastic neural networks with Markovian delays and partially known transition matrix

  • Magdi S. Mahmoud*
  • , Gulam Dastagir Khan
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

27 Scopus citations

Abstract

The problem of dissipativity analysis for a class of discrete-time stochastic neural networks with discrete and finite-distributed delays is considered in this paper. System parameters are described by a discrete-time Markov chain. A discretized Jensen inequality and lower bounds lemma are employed to reduce the number of decision variables and to deal with the involved finite sum quadratic terms in an efficient way. A sufficient condition is derived to ensure that the neural networks under consideration is globally delay-dependent asymptotically stable in the mean square and strictly (Z,S,G)-α-dissipative. Next, the case in which the transition probabilities of the Markovian channels are partially known is discussed. Numerical examples are given to emphasize the merits of reduced conservatism of the developed results.

Original languageEnglish
Pages (from-to)292-310
Number of pages19
JournalApplied Mathematics and Computation
Volume228
DOIs
StatePublished - 1 Feb 2014

Bibliographical note

Funding Information:
The authors would like to thank the reviewers for their helpful comments on our submission. This work is supported by the deanship of scientific research (DSR) at KFUPM through research group project No. RG-1316-1.

Keywords

  • Delay-dependent stability
  • Dissipativity
  • Markov chain
  • Neural networks
  • Partially known transition matrix
  • Time-delays

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Dissipativity analysis for discrete stochastic neural networks with Markovian delays and partially known transition matrix'. Together they form a unique fingerprint.

Cite this