By Topic

A new divide and conquer algorithm for real symmetric band generalized 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
$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

2 Author(s)
Wei Lifeng ; Sch. of Comput., Nat. Univ. of Defense Technol., Changsha, China ; Li Xiaomei

In this paper we present a new divide and conquer algorithm for solving a real symmetric band generalized eigenvalue problem under a distributed environment. This algorithm computes generalized eigenpairs of a real symmetric band matrix pair using the divide and conquer method combined with multisection and generalized Rayleigh quotient iteration. Theoretical analysis and numerical experiments prove that this algorithm is better than the classic method DSBGVX in LAPACK when the scale of matrices is large enough. During parallel computing, there is little communication between processors, so high speedup can be expected.

Published in:

Algorithms and Architectures for Parallel Processing, 2002. Proceedings. Fifth International Conference on

Date of Conference:

23-25 Oct. 2002