Abstract

This brief studies a rational model identification problem using a novel gradient descent algorithm. The rational model is approximated by a second-order Volterra system, whose parameters and structure are estimated through an accelerated gradient descent algorithm. This algorithm improves the convergence rates by computing an optimal step-size and introducing a preconditioning method. In addition, it can avoid the eigenvalue calculation if the preconditioning matrix is equal to the inverse of the information matrix. A numerical experiment is given to illustrate the performances of the proposed algorithm.

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.