JavaScript is disabled for your browser. Some features of this site may not work without it.
Approximation with Kronecker Products

Author
Loan, Charles Van; Pitsianis, Nikos
Abstract
Let A be an m-by-n matrix with m=m1m2 and n=n1n2. We consider the problem of finding (mathematical formula omitted) so that (mathematical formula omitted) is minimized. This problem can be solved by computing the largest singular value and associated singular vectors of a permuted version of A. If A is symmetric, definite, non-negative, or banded, then the minimizing B and C are similarly structured. The idea of using Kronecker product preconditioners is briefly discussed.
Date Issued
1992-11Publisher
Cornell University
Subject
theory center
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.tc/92-109
Type
technical report