Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

An Iterative Algorithm for the Least Squares Centrosymmetric Solution of a Matrix Equation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Minghui Wang ; Dept. of Math., Qingdao Univ. of Sci. & Technol., Qingdao, China

In this paper, the linear mapping from the constrained solution sets to their independent parameter spaces is constructed, and its properties are studied. Based on these properties and the classical algorithm LSQR for solving the (unconstrained) LS problem, a matrix iterative method that can find the special Centro symmetric solution is proposed. Numerical results are reported that show the efficiency of the proposed method.

Published in:

Computational Sciences and Optimization (CSO), 2011 Fourth International Joint Conference on

Date of Conference:

15-19 April 2011