Cart (Loading....) | Create Account
Close category search window

A minimal residual algorithm for the inconsistent matrix equation AXB + CYD = E over anti-symmetric matrices

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

5 Author(s)
Ling Fang ; Dept. of Found. Studies, Logistical Eng. Univ. of PLA, Chongqing, China ; Can Li ; Bo Li ; Shilu Fu
more authors

A minimal residual algorithm based on the idea of the classical CG method for the inconsistent matrix equation AXB + CYD = E is constructed in this paper. By this method, the minimum norm least squares solution for anti-symmetric matrices can be obtained within finite iteration steps by choosing a special kind of initial iteration matrix when the matrix equation AXB + CYD = E is not consistent and an error bound is given. Finally, an example verifies the efficiency of the algorithm.

Published in:

Apperceiving Computing and Intelligence Analysis (ICACIA), 2010 International Conference on

Date of Conference:

17-19 Dec. 2010

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.