This paper describes an optimization and artificial intelligence-based approach for solving the mesh partitioning problem for explicit parallel dynamic finite element analysis. The Sub-Domain Generation Method (SGM) (Topping, Khan, Parallel Finite Element Computations. Saxe-Coburg Publications: Edinburgh, U.K., 1996) is briefly introduced with its virtues and drawbacks. This paper describes the enhancement of the SGM algorithm (ESGM) by the introduction of a new, non-convex bisection procedure and a new Genetic Algorithm (GA) module, which is better tuned for this particular optimization problem. Example decompositions are given and comparisons made between parallel versions of the ESGM, the SGM and other decomposition methods. The scalability of the ESGM is examined by using a range of examples. Copyright © 2000 John Wiley & Sons, Ltd.
|Number of pages||28|
|Journal||International Journal for Numerical Methods in Engineering|
|Publication status||Published - 10 Apr 2000|
- Genetic algorithms
- Mesh generation
- Neural networks