Abstract

A class of transformation matrices, analogous to the Householder matrices, is developed with a nonorthogonal property designed to permit the efficient deletion of data from least-squares problems. These matrices, which we term hyperbolic Householder, are shown to effect deletion, or simultaneous addition and deletion, of data with much less sensitivity to rounding errors than for techniques based on normal equations. When the addition/deletion sets are large, this numerical robustness is obtained at the expense of only a modest increase in computations, and when only a relatively small fraction of the data set is modified, there is a decrease in required computations. Two applications to signal processing problems are considered. First, these transformations are used to obtain a square root algorithm for windowed recursive least-squares filtering. Second, the transformations are employed to implement the rejection of spurious data from the weight vector estimation process in an adaptive array.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.