A hybrid graph-genetic method for domain decomposition

Finite Elements in Analysis and Design

Volumn 39, Issue 13, 2003, Pages 1237-1247

  Kaveh, A ^a   Bondarabady, H A Rahimi ^b  

^a IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

^b YAZD UNIVERSITY   (Iran)

Author keywords

Bisection; Coarsening; Genetic algorithm; Graph Partitioning; Hybrid method; Matching; Substructuring

Indexed keywords

DECOMPOSITION; FINITE ELEMENT METHOD; GENETIC ALGORITHMS; PARALLEL PROCESSING SYSTEMS;

DOMAIN DECOMPOSITION;

GRAPH THEORY;

EID: 0042360646     PISSN: 0168874X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-874X(02)00192-0     Document Type: Article

References (20)

1. A. Kaveh, Application of graph theory and matroids in structural analysis, Ph.D. Thesis, Imperial College, London University, UK, 1974.
2. Farhat C. A simple and efficient automatic FEM domain decomposer. Comput. Struct. 28:1988;579-602.
3. Farhat C., Lesoinne M. Automatic partitioning of unstructured meshes for the parallel solution of problems in computational mechanics. Int. J. Numer. Methods Eng. 36:1993;745-764.
4. Al-Nasra M., Nguyen D.T. An algorithm for domain decomposition in finite element analysis. Comput. Struct. 39:1991;277-289.
5. Simon H.D. Partitioning of unstructured problems for parallel processing. Comput. System Eng. 2/3(2):1991;135-148.
6. A. Kaveh, G.R. Roosta, A graph theoretical method for decomposition in finite element analysis, Proceedings of the Civil-Comp 94, Edinburgh, UK, 1994, 35-42.
7. D. Vanderstraeten, O. Zone, R. Keunings, Non-deterministic heuristic for automatic domain decomposition in direct parallel finite element calculation, Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, SIAM, Philadelphia, PA, 1993, 929-932.
8. Vanderstraeten D., Keunings R. Optimized partitioning of unstructured meshes. Int. J. Numer. Methods Eng. 38:1995;433-450.
9. Pothen A., Simon H.D., Liou K.P. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11:1990;430-452.
10. Kaveh A., Davaran A. Spectral bisection of adaptive finite element meshes for parallel processing. Comput. Struct. 70:1999;315-324.
11. Khan A.I., Topping B.H.V. Parallel adaptive mesh generation. Comput. System Eng. 1(2):1991;75-102.
12. A.I. Khan, B.H.V. Topping, Sub-domain generation for parallel finite element analysis, Proceedings of the Civil Comp 93, UK, 1993.
13. Topping B.H.V., Khan A.I. Parallel Finite Element Computations. 1996;Saxe-Coburg Publications, UK.
14. Mackerle J. Parallel finite element and boundary element analysis. theory and applications - a biography (1997-1999) Finite Element Anal. Des. 35:2000;283-296.
15. Kaveh A. Optimal Structural Analysis. 1997;RSP (Wiley), UK.
16. Goldberg D.E. Genetic Algorithm in Search Optimization and Machine Learning. 1989;Addison-Wesley Publishing Co. Ltd, Reading, MA.
17. Mitchell M. An Introduction to Genetic Algorithm. 1996;MIT Press, USA.
18. G. Karypis, V. Kumar, A fast and high quality multilevel scheme for partitioning irregular graphs, Technical Report TR 95-035, Department of Computer Science, University of Minnesota, 1995.
19. T. Bui, C. Jones, A heuristic for reducing fill in sparse matrix factorization. Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, Philadelphia, PA, 1993, 445-452.
20. B. Hendirckson, R. Leland, A multilevel algorithm for partitioning graphs, Technical Report SAND93-1301, Sandia National Laboratories, 1993.