Published 1994
| Published
Book Section - Chapter
Open
H^∞ bounds for the recursive-least-squares algorithm
- Creators
- Hassibi, Babak
- Kailath, Thomas
Abstract
We obtain upper and lower bounds for the H^∞ norm of the RLS (recursive-least-squares) algorithm. The H^∞ norm may be regarded as the worst-case energy gain from the disturbances to the prediction errors, and is therefore a measure of the robustness of an algorithm to perturbations and model uncertainty. Our results allow one to compare the robustness of RLS compared to the LMS (least-mean-squares) algorithm, which is known to minimize the H^∞ norm. Simulations are presented to show the behaviour of RLS relative to these bounds.
Additional Information
© 1994 IEEE. This research was supported by the Advanced Research Projects Agency of the Department of Defense monitored by the Air Force Office of Scientific Research under Contract F4962G93-1-008.Attached Files
Published - 00411555.pdf
Files
00411555.pdf
Files
(195.1 kB)
Name | Size | Download all |
---|---|---|
md5:828bc182b1e4dac16ddfd340c8deca33
|
195.1 kB | Preview Download |
Additional details
- Eprint ID
- 54973
- Resolver ID
- CaltechAUTHORS:20150219-072113191
- Department of Defense
- F4962G93-1-008
- Created
-
2015-03-03Created from EPrint's datestamp field
- Updated
-
2021-11-10Created from EPrint's last_modified field