𝔖 Bobbio Scriptorium
✦   LIBER   ✦

EVALUATION OF AUTOMATIC DOMAIN PARTITIONING ALGORITHMS FOR PARALLEL FINITE ELEMENT ANALYSIS

✍ Scribed by SHANG-HSIEN HSIEH; GLAUCIO H. PAULINO; JOHN F. ABEL


Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
460 KB
Volume
40
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

✦ Synopsis


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.


πŸ“œ SIMILAR VOLUMES


An enhanced parallel sub-domain generati
✍ J. Sziveri; C. F. Seale; B. H. V. Topping πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 499 KB πŸ‘ 2 views

This paper describes an optimization and artiΓΏcial intelligence-based approach for solving the mesh partitioning problem for explicit parallel dynamic ΓΏnite element analysis. The Sub-Domain Generation Method (SGM) (Topping, Khan, Parallel Finite Element Computations. Saxe-Coburg Publications: Edinbu

The iterative group implicit algorithm f
✍ Sukomal Modak; Elisa D. Sotelino πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 142 KB πŸ‘ 1 views

The Iterative Group Implicit (IGI) algorithm is developed for the parallel solution of general structural dynamic problems. In this method the original structure is partitioned into a number of a subdomains. Each subdomain is solved independently and therefore concurrently, using any traditional dir

An efficient implementation of the finit
✍ Umesh D. Navsariwala; Stephen D. Gedney πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 135 KB πŸ‘ 3 views

An efficient algorithm for implementing the finite-element ( ) time-domain FETD method on parallel computers is presented. An unconditionally stable implicit FETD algorithm is combined with the ( ) finite-element tearing and interconnecting FETI method. This domain decomposition algorithm con¨erges

FINITE ELEMENT ALGORITHMS FOR DYNAMIC SI
✍ SUNG YI; M. FOUAD AHMAD; HARRY H. HILTON πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 237 KB πŸ‘ 2 views

Recently much attention has been paid to high-performance computing and the development of parallel computational strategies and numerical algorithms for large-scale problems. In this present study, a ΓΏnite element procedure for the dynamic analyses of anisotropic viscoelastic composite shell struct

On using different finite elements with
✍ C. K. Lee; R. E. Hobbs πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 439 KB πŸ‘ 2 views

A series of numerical tests is carried out employing some commonly used finite elements for the solution of 2-D elastostatic stress analysis problems with an automatic adaptive refinement procedure. Different kinds of elements including Lagrangian quadrilateral and triangular elements, serendipity q