By Topic

An Implementation of Matrix Eigenvalue Decomposition with Improved Jacobi Algorithm

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
$33 $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)
Wei Yu Mei ; Harbin Inst. of Technol., Harbin, China ; Jin ming ; Liu shuai ; Qiao Xiao Lin
more authors

Eigenvalue decomposition for real symmetric matrix is significant in mathematics and engineering. In engineering implementation, most of implementation for eigenvalue decomposition based on hardware prefers to choose Jacobi algorithm because of its inherent parallelism. But the calculated eigenvalue and its corresponding eigenvector from traditional Jacobi algorithm are unordered arrangement. To solve this problem, an improved Jacobi is proposed in this paper, which can get eigenvalue and eigenvector in descending order.

Published in:

Pervasive Computing Signal Processing and Applications (PCSPA), 2010 First International Conference on

Date of Conference:

17-19 Sept. 2010