Efficient algorithm for a class of least squares estimation problems

A computationally efficient algorithm for solving least squares estimation problems is proposed. It is well suited for problems with the normal equation matrix factorizable in terms of Kronecker's products. Three classes of identification problems factorizable in this sense are pointed out. Computational complexity of the algorithm and its robustness against round off errors is also discussed.<
>