Abstract
System identification based on the errors-in-variables (EIV) system model has been investigated by a number of people, led by Söderström and others. The total least-squares (TLS) algorithm is now well known, and has been effective for estimating the system parameters. In this paper, we first show that the TLS algorithm computes approximate maximum likelihood estimate (MLE) of the system parameters. Then we propose a graph subspace approach to tackle the same EIV identification problem, and derive a new estimation algorithm that is more general than the TLS algorithm. Two numerical examples are worked out to illustrate the proposed estimation algorithm for the EIV-based system identification.
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.
