By Topic

An efficient parallel finite-element-based domain decomposition iterative technique with polynomial preconditioning

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

3 Author(s)
Yu Liang ; Army High Performance Comput. Res. Center, Minnesota Univ., Minneapolis, MN, USA ; Ramdev Kanapady ; K. K. Tamma

An efficient parallel finite element-based non-overlapping domain decomposition iterative technique formulated with polynomial preconditioned GMRES method is presented. Unlike the standard row-oriented partitioning of a matrix, the finite element based domain decomposition solver with polynomial preconditioning circumvents the assembly of matrix, reordering of matrix, redundant computations associated with the interface elements, numerical problems associated with local pre-conditioner, and costly global preconditioner construction. A dramatic reduction in parallel overhead both in terms of computation and communication results in a highly scalable solver. The parallel performance results for large-scale static and dynamic problems on the IBM SP2 and the SGI Origin are presented

Published in:

2006 International Conference on Parallel Processing Workshops (ICPPW'06)

Date of Conference:

0-0 0