Barrlund, Anders Efficient solution of constrained least squares problems with Kronecker product structure. (English) Zbl 0913.65033 SIAM J. Matrix Anal. Appl. 19, No. 1, 154-160 (1998). A null space method to solve constrained least squares problems is presented. It is shown how to take advantage of both Kronecker product in constraints and the Kronecker product in the least squares equations. It is also shown how the generalized singular value decomposition can be used on these problems. The complexity of the algorithm is examined. Reviewer: F.Luban (Bucureşti) Cited in 3 Documents MSC: 65F20 Numerical solutions to overdetermined systems, pseudoinverses 65F30 Other matrix algorithms (MSC2010) 65Y20 Complexity and performance of numerical algorithms Keywords:algorithm complexity; Kronecker product; constrained least squares; generalized singular value decomposition; null space method PDFBibTeX XMLCite \textit{A. Barrlund}, SIAM J. Matrix Anal. Appl. 19, No. 1, 154--160 (1998; Zbl 0913.65033) Full Text: DOI