An efficient parallel finite element-based domain decomposition iterative technique with polynomial preconditioning with particular attention to the GMRES solver is presented. Unlike the standard row-oriented partitioning of a matrix, finite element based domain decomposition with polynomial preconditioning circumvents the assembly of matrix, reordering of matrix, redundant computations associated with the interface elements, numerical problems associated with local preconditioner, 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.
Liang, Yu; Kanapady, Ramdev; Tamma, Kumar.
An Efficient Parallel Finite-Element-Based Domain Decomposition Iterative Technique With Polynomial Preconditioning.
Retrieved from the University of Minnesota Digital Conservancy,
Content distributed via the University of Minnesota's Digital Conservancy may be subject to additional license and use restrictions applied by the depositor.