Abstract
ABSTRACTIn this paper, the problem of short-time behaviour analysis including short-time stability and short-time boundedness is studied for a class of fractional-order generalized pantograph-type neural networks. By extending the comparison principle with Mittag–Leffler functions, explicit conditions are derived in terms of M-matrix inequalities to ensure that the system states are confined in a certain threshold over a pre-specified interval of time. Finally, two numerical examples with simulations are given to demonstrate the effectiveness of the obtained results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computer Mathematics: Computer Systems Theory
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
