Efficient Solution of Constrained Least Squares Problems with Kronecker Product Structure

DOI10.1137/S0895479895295027zbMath0913.65033OpenAlexW2021628135MaRDI QIDQ4389066

Anders Barrlund

Publication date: 11 May 1998

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895479895295027

zbMATH Keywords

Kronecker productgeneralized singular value decompositionalgorithm complexityconstrained least squaresnull space method

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Complexity and performance of numerical algorithms (65Y20)

Related Items (3)

Condition numbers of the minimum norm least squares solution for the least squares problem involving Kronecker products ⋮ On condition numbers for Moore–Penrose inverse and linear least squares problem involving Kronecker products ⋮ The ubiquitous Kronecker product

This page was built for publication: Efficient Solution of Constrained Least Squares Problems with Kronecker Product Structure