Abstract
AbstractThis paper compares conditions for instability with conditions for global asymptotic stability of a discretetime output error adaptive estimation algorithm. This comparison leads to a boundedness conjecture which states that all signals within this adaptive system as well as the output error and parameter estimates remain globally bounded for all time despite any unstable behaviour. The investigation into the stability properties of this algorithm begins with a global stability criterion applied to a transfer function which is not strictly positive real. This criterion states that for large enough adaptation gain and/or input signal magnitude the system will be asymptotically stable. Then a local result is applied which states that for small enough adaptation gain and/or input signal magnitude the same system is unstable. The result is a bifurcation due to the decrease of the adaptation gain and/or input signal magnitude as the system goes from asymptotic stability to instability which remains bounded. The results suggested by the computer simulations are verified by an exact analysis of a linearized periodic version of the adaptive system.
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 Adaptive Control and Signal Processing
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.
