'Institute of Electrical and Electronics Engineers (IEEE)'
Abstract
In this paper we develop array algorithms for H-infinity filtering. These algorithms can be regarded as the Krein space generalizations of H-2 array algorithms, which are currently the preferred method for implementing H-2 biters, The array algorithms considered include typo 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-infinity filters, as these conditions are built into the algorithms themselves. However, since H-infinity 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
