Analysis of a recursive least-squares signal-processing algorithm
暂无分享，去创建一个
This paper concerns a popular recursive least-squares algorithm for beamforming. The way in which the method's stability depends on the condition of a special matrix is analyzed in detail, and a new procedure for estimating the error in the computed solution is presented.
[1] G. Stewart. Perturbation Bounds for the $QR$ Factorization of a Matrix , 1977 .
[2] John G. McWhirter,et al. Some Systolic Array Developments in the United Kingdom , 1987, Computer.
[3] H. T. Kung,et al. Matrix Triangularization By Systolic Arrays , 1982, Optics & Photonics.
[4] J. G. McWhirter,et al. Recursive Least-Squares Minimization Using A Systolic Array , 1983, Optics & Photonics.
[5] W. Gentleman. Error analysis of QR decompositions by Givens transformations , 1975 .