By Topic

Divide and conquer algorithm for computer simulation and application in the matrix eigenvalue problem

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

4 Author(s)
Yuhuan Cui ; Coll. of Light Ind., Hebei Polytech. Univ., Tangshan, China ; Jingguo Qu ; Weili Chen ; Aimin Yang

DC is a divide and conquers method for short. Its basic idea is to divide the given real symmetric tridiagonal matrix A into two lower-order submatrix A1 , A2 first, then glue the eigenvalues of the two submatrixes together and find the eigenvalue and eigenvector of the original symmetric triangular matrix by means of some calculations. It is that we solve the submatrix eigenvalue problem, and then pose a question easy to answer than the original eigenvalue problem. Finally we uses computer to simulate, using mathematical software programming to solve the eigenvalues of each submatrix separately.

Published in:

Test and Measurement, 2009. ICTM '09. International Conference on  (Volume:1 )

Date of Conference:

5-6 Dec. 2009