Skip to Main Content
Some new, efficient, and numerically stable algorithms for the recursive solution of matrix problems arising in optimal beam-forming and direction finding are described and analyzed. The matrix problems considered are systems of linear equations and spectral decomposition. While recursive solution procedures based on the matrix inversion lemma may be unstable, ours are stable. Furthermore, these algorithms are extremely fast.