Abstract

Because to apply a deterministic RNN to a noisy time series and the existence of a linear approximation are doubtful, we reconsider the solubility and stability of a recurrent neural network (RNN). Simpler methods are proposed to replace the complicated nonsingular M-matrix method when nonlinearities exist and to replace the complicated linear matrix inequality method when time-varying delays exist.

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 call

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.