 Multi-almost periodicity in semi-discretizations of a general class of neural networksZhenkun Huang, Sannay Mohamad and Feng Gao Mathematics and Computers in Simulation (MATCOM), 2014, vol. 101, issue C, 43-60 Abstract: In this paper, we present multi-almost periodicity of a general class of discrete-time neural networks derived from a well-known semi-discretization technique, that is, coexistence and exponential stability of 2N almost periodic sequence solutions of discrete-time neural networks subjected to external almost periodic stimuli. By using monotonicity and boundedness of activation functions, we construct 2N close regions to attain the existence of almost periodic sequence solutions. Meanwhile, some new and simple criteria are derived for the networks to converge exponentially toward 2N almost periodic sequence solutions. As special cases, our results can extend to discrete-time analogues of periodic or autonomous neural networks and hence complement or improve corresponding existing ones. Finally, computer numerical simulations are performed to illustrate multi-almost periodicity of semi-discretizations of neural networks. Keywords: Neural networks; Semi-discretization; Multi-almost periodicity; Almost periodic sequence; Exponential stability (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:101:y:2014:i:c:p:43-60 DOI: 10.1016/j.matcom.2013.05.017 Access Statistics for this article Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.