Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4636278 | Applied Mathematics and Computation | 2007 | 17 Pages |
Abstract
Matrix iterative algorithms are proposed for solving the matrix least square problem of BXATÂ =Â F with variant linear constraints on solutions such as symmetry, skew-symmetry, and symmetry/skew-symmetry commuting with a given symmetric matrix P. We characterize the linear mapping from the constrained solution sets to their (independent) parameter spaces, and use these properties to deduce the matrix iterations, based on the classical algorithm LSQR for solving (unconstrained) LS problem. Numerical results are reported that show the efficiency of the proposed methods.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Yuyang Qiu, Zhenyue Zhang, Junfeng Lu,