Abstract
This paper proposes two fractional gradient descent algorithms for switching models. Each submodel is assigned a weight which can determine the identity of the submodel in each sampling instant. By using the fractional gradient descent algorithms, the parameters of each submodel can be obtained, and then the weights of all the submodels can be estimated based on the self-organizing maps method. These two algorithms can deal with different kinds of switching models on a case by case basis. In addition, compared with the traditional identification algorithms, the proposed methods have two advantages: (1) has faster convergence rates; (2) has less computational efforts. Simulation example demonstrates the effectiveness of the proposed methods.
Published Version
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.
