Indexed metadata

On condition numbers for Moore–Penrose inverse and linear least squares problem involving Kronecker products

Huaian Diao, Weiguo Wang, Yimin Wei, Sanzheng Qiao

Source record

Source: Crossref

Published: Jan 26, 2012

DOI: 10.1002/nla.1823

Open original source ↗

Source abstract

SUMMARY In this paper, we investigate the normwise, mixed, and componentwise condition numbers and their upper bounds for the Moore–Penrose inverse of the Kronecker product and more general matrix function compositions involving Kronecker products. We also present the condition numbers and their upper bounds for the associated Kronecker product linear least squares solution with full column rank. In practice, the derived upper bounds for the mixed and componentwise condition numbers for Kronecker product linear least squares solution can be efficiently estimated using the Hager–Higham Algorithm. Copyright © 2012 John Wiley & Sons, Ltd.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

On condition numbers for Moore–Penrose inverse and linear least squares problem involving Kronecker products — Mathematical Frontier Network