Abstract
An adaptive algorithm, called the dual sign algorithm (DSA), has been proposed recently to simplify the implementation of the widely-used stochastic iteration algorithm (SIA). Previous study has shown that, in stationary environments, the DSA, although simpler, exhibits faster convergence compared with the SIA, Here, computer simulation is used to compare the performance of the two algorithms in identifying some typical time-varying models. The results show that if both algorithms are designed to attain the same steady-state accuracy, the DSA always has a better tracking capability. >
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.
