Abstract
Recently, a typical neural dynamics called Zhang dynamics (ZD) has been developed for online solution of dynamic linear matrix-vector inequality. This paper show a summary result by presenting the discrete-time forms of such a ZD for dynamic linear matrix-vector inequality solving. Specifically, by exploiting four different kinds of Taylor-type difference rules, the resultant discrete-time ZD (DTZD) algorithms, which are called respectively the DTZD-I, DTZD-II, DTZD-III, and DTZD-IV algorithms, are established. These algorithms can achieve excellent computational performance in solving dynamic linear matrix-vector inequality. The theoretical and numerical results are presented to further substantiate the efficacy of the presented four DTZD algorithms.
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 callDisclaimer: 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.
