论文信息 - A Systolic Array For Linearly Constrained Least-Squares Problems

A Systolic Array For Linearly Constrained Least-Squares Problems

A systolic array for linearly constrained least-squares optimisation is described. It is shown how the "canonical" array, designed to perform least-squares minimisation with one simple constraint, may also be used for problems involving an arbitrary number of general linear constraints.

John G. McWhirter | T. J. Shepherd

[1] J. G. McWhirter,et al. A novel algorithm and architecture for adaptive digital beamforming , 1986 .

[2] J. G. McWhirter,et al. Recursive Least-Squares Minimization Using A Systolic Array , 1983, Optics & Photonics.

[3] Charles L. Lawson,et al. Solving least squares problems , 1976, Classics in applied mathematics.

[4] W. E. Gentleman. Least Squares Computations by Givens Transformations Without Square Roots , 1973 .

[5] W. Givens. Computation of Plain Unitary Rotations Transforming a General Matrix to Triangular Form , 1958 .

[6] H. T. Kung,et al. Matrix Triangularization By Systolic Arrays , 1982, Optics & Photonics.