Array algorithms for H^2 and H^∞ estimation
- Creators
- Hassibi, Babak
- Kailath, Thomas
- Sayed, Ali H.
- Other:
- Datta, Biswa Nath
Abstract
Currently, the preferred method for implementing H^2 estimation algorithms is what is called the array form, and includes two main families: square-root array algorithms, that are typically more stable than conventional ones, and fast array algorithms, which, when the system is time-invariant, typically offer an order of magnitude reduction in the computational effort. Using our recent observation that H^∞ filtering coincides with Kalman filtering in Krein space, in this chapter we develop array algorithms for H^∞ filtering. These can be regarded as natural generalizations of their H^2 counterparts, and involve propagating the indefinite square roots of the quantities of interest. The H^∞ square-root and fast array algorithms both have the interesting feature that one does not need to explicitly check for the positivity conditions required for the existence of H^∞ filters. These conditions are built into the algorithms themselves so that an H^∞ estimator of the desired level exists if, and only if, the algorithms can be executed. However, since H^∞ square-root algorithms predominantly use J-unitary transformations, rather than the unitary transformations required in the H^2 case, further investigation is needed to determine the numerical behavior of such algorithms.
Additional Information
© 1999 Birkhäuser Boston. This work was supported in part by DARPA through the Department of Air Force under contract F49620-95-1-0525-P00001 and by the Joint Service Electronics Program at Stanford under contract DAAH04-94-G-0058-P-00003.Attached Files
Submitted - array.pdf
Files
Name | Size | Download all |
---|---|---|
md5:e031155da8b3daa49d54b6a7d0c571f6
|
413.0 kB | Preview Download |
Additional details
- Eprint ID
- 55077
- Resolver ID
- CaltechAUTHORS:20150223-071202056
- Air Force Office of Scientific Research (AFOSR)
- F49620-95-1-0525-P00001
- Joint Service Electronics Program at Stanford
- DAAH04-94-G-0058-P-00003
- Created
-
2015-03-04Created from EPrint's datestamp field
- Updated
-
2021-11-10Created from EPrint's last_modified field