Premium
EVALUATION OF AUTOMATIC DOMAIN PARTITIONING ALGORITHMS FOR PARALLEL FINITE ELEMENT ANALYSIS
Author(s) -
HSIEH SHANGHSIEN,
PAULINO GLAUCIO H.,
ABEL JOHN F.
Publication year - 1997
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/(sici)1097-0207(19970330)40:6<1025::aid-nme103>3.0.co;2-p
Subject(s) - benchmark (surveying) , computer science , algorithm , polygon mesh , domain (mathematical analysis) , finite element method , set (abstract data type) , curse of dimensionality , strengths and weaknesses , graphics , mathematics , machine learning , engineering , programming language , mathematical analysis , philosophy , computer graphics (images) , geodesy , structural engineering , epistemology , geography
This paper studies and compares the domain partitioning algorithms presented by Farhat, Al‐Nasra and Nguyen, Malone, and Simon/Hsieh et al. , for load balancing in parallel finite element analysis. Both the strengths and weaknesses of these algorithms are discussed. Some possible improvements to the partitioning algorithms are also suggested and studied. A new approach for evaluating domain partitioning algorithms is described. Direct numerical comparisons among the considered partitioning algorithms are then conducted using this suggested approach with both regular and irregular finite element meshes of different order and dimensionality. The test problems used in the comparative studies along with the results obtained provide a set of benchmark examples for other researchers to evaluate both new and existing partitioning algorithms. In addition, interactive graphics tools used in this work to facilitate the evaluation and comparative studies are presented. © 1997 by John Wiley & Sons, Ltd.