Abstract

Two gradient descent based fractional methods are proposed for systems with outliers in this paper. The outliers in the collected data usually causes biased estimates, resulting in a poor identification model. Tradition fractional gradient descent (FGD) algorithm has an assumption that the fractional derivative is a scalar, which leads to slow convergence rates, especially for systems with an ill-conditioned matrix. The proposed algorithms in this paper have several advantages over the traditional identification methods: (1) can get unbiased estimates; (2) have faster convergence rates; (3) enrich the FGD estimation framework. Simulation examples demonstrate the effectiveness of the proposed algorithms.

Full Text
Paper version not known

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.