Abstract
Several recursive algorithms for parametric identification of discrete time systems derived from M.R.A.S. techniques in a deterministic environment areanalysed. All these algorithms belong to the class of output error method which have been very little discussed previously in the identification litterature. These algorithms are analysed in the stochastic environment using the O.D.E. method. A summary of the convergence properties of these algorithms is also given for the deterministic case. A comparative evaluation of these algorithms is presented with respect to recursive algorithms belonging to "equation error method" (least squares, extended least squares, approximate maxlirnum likelihood.
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.
