By Topic

Local block factorization and its parallelization to block tridiagonal 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

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

A type of incomplete decomposition preconditioner based on local block factorization is considered, for the matrices derived from discreting 2-D or 3-D elliptic partial differential equations. We prove that the condition numbers of the preconditioned matrices are small, which means that the constructed preconditioners are effective. Further we consider an efficient parallel version of the preconditioner which depends only on a single integer argument. When its value is small, the iterations needed on multiple processors to converge is much more than on a single processor But with the increase of this value, the difference decreases step by step. Finally, we have many experiments on a cluster of 6 PCs with main frequencies of 1.8GHz. The results show that the local block factorization constructed are efficient in serial implementation, if compared to some well-known effective preconditioners, and the parallel versions are also efficient.

Published in:

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

Date of Conference:

23-25 Oct. 2002