论文信息 - Spectral trisection of finite element models

Spectral trisection of finite element models

In this paper a new method is proposed for finite element domain decomposition. A weighted incidence graph is first constructed for the finite element model. A spectral partitioning heuristic is then applied to the graph using the second and the third eigenvalues of the Laplacian matrix of the graph, to partition it into three subgraphs and correspondingly trisect the finite element model.

Ali Kaveh | H. A. Rahimi Bondarabady | A. Kaveh | H. A. R. Bondarabady

[1] B. Mohar. THE LAPLACIAN SPECTRUM OF GRAPHS y , 1991 .

[2] Barry Hilary Valentine Topping,et al. Parallel adaptive mesh generation , 1991 .

[3] Ali Kaveh,et al. Spectral bisection of adaptive finite element meshes for parallel processing , 1999 .

[4] Laurence A. Wolsey,et al. Non-Deterministic Heuristics for Automatic Domain Decomposition in Direct Parallel Finite Element Calculations , 1993, PPSC.

[5] Charbel Farhat,et al. Automatic partitioning of unstructured meshes for the parallel solution of problems in computational mechanics , 1993 .

[6] Charbel Farhat,et al. A simple and efficient automatic fem domain decomposer , 1988 .

[7] Alex Pothen,et al. PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[8] Horst D. Simon,et al. Partitioning of unstructured problems for parallel processing , 1991 .

[9] Asad I. Khan,et al. Subdomain generation for parallel finite element analysis , 1993 .

[10] A. Kaveh,et al. Finite element mesh decomposition using complementary Laplacian matrix , 2000 .

[11] Denis Vanderstraeten,et al. Optimized partitioning of unstructured finite element meshes , 1995 .

[12] M. Fiedler. Algebraic connectivity of graphs , 1973 .

[13] Ali Kaveh,et al. Optimal Structural Analysis , 1997 .