liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
On some Asymptotic Uncertainty Bounds in Recursive Least Squares Identification
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, The Institute of Technology.
1992 (English)Report (Other academic)
Abstract [en]

This note deals with the performance of the recursive least squares algorithm when it is applied to problems where the measured signal is corrupted by bounded noise. Using ideas from bounding ellipsoid algorithms we derive an asymptotic expression for the bound on the uncertainty of the parameter estimate for a simple choice of design variables. This bound is also transformed to a bound on the uncertainty of the transfer function estimate.

Place, publisher, year, edition, pages
Linköping: Linköping University , 1992.
LiTH-ISY-I, ISSN 8765-4321 ; 1368
Keyword [en]
Recursive identification, Uncertainty bounds, Least squares approximations, Transfer functions
National Category
Control Engineering
URN: urn:nbn:se:liu:diva-55555OAI: diva2:316363
Available from: 2010-04-30 Created: 2010-04-30 Last updated: 2013-07-29

Open Access in DiVA

fulltext(133 kB)69 downloads
File information
File name FULLTEXT01.psFile size 133 kBChecksum SHA-512
Type fulltextMimetype application/postscript

Search in DiVA

By author/editor
Gunnarsson, Svante
By organisation
Automatic ControlThe Institute of Technology
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 69 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 55 hits
ReferencesLink to record
Permanent link

Direct link