Minimum-norm updating with the rank-revealing URV decomposition
M.F. Griffin, Eugene C. Boman, G. W. Stewart · 1992
In many practical direction-of-arrival (DOA) problems the number of sources and their directions from an antenna array do not remain stationary. Hence a practical DOA algorithm must be able to track changes with a minimal number of snapshots. DOA algorithms, based on a new decomposition, the URV decomposition, that are not expensive to compute or difficult to update are presented. The algorithms are compared with algorithms based on the singular value decomposition (SCD).>