000233358 001__ 233358
000233358 005__ 20181203024915.0
000233358 0247_ $$2doi$$a10.1109/9.847105
000233358 022__ $$a0018-9286
000233358 037__ $$aARTICLE
000233358 245__ $$aArray algorithms for Hoo estimation
000233358 260__ $$c2000
000233358 269__ $$a2000
000233358 336__ $$aJournal Articles
000233358 520__ $$aWe develop array algorithms for H/sup /spl infin// filtering. These algorithms can be regarded as the Krein space generalizations of H/sup 2/ array algorithms, which are currently the preferred method fur implementing H/sup 2/ filters. The array algorithms considered include two main families: square-root array algorithms, which are typically numerically 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. Both have the interesting feature that one does not need to explicitly check for the positivity conditions required for the existence of H/sup /spl infin// filters, as these conditions are built into the algorithms themselves. However, since H/sup /spl infin// square-root algorithms predominantly use J-unitary transformations, rather than the unitary transformations required in the H/sup 2/ case, further investigation is needed to determine the numerical behavior of such algorithms.
000233358 700__ $$aHassibi, B.
000233358 700__ $$aKailath, T.
000233358 700__ $$0251037$$aSayed, Ali H.$$g283344
000233358 773__ $$j45$$k4$$q702-706$$tIEEE Transactions on Automatic Control
000233358 909C0 $$0252608$$pASL$$xU13470
000233358 909CO $$ooai:infoscience.tind.io:233358$$pSTI$$particle
000233358 917Z8 $$x144315
000233358 937__ $$aEPFL-ARTICLE-233358
000233358 970__ $$ahassibi2000array/ASL
000233358 973__ $$aOTHER$$rREVIEWED$$sPUBLISHED
000233358 980__ $$aARTICLE