AN EFFICIENT SPECTRAL METHOD FOR BISECTION OF REGULAR FINITE ELEMENT MESHES

In this paper an efficient analytical method is presented for calculating the eigenvalues of special matrices related to finite element meshes (FEMs) with regular topologies. In the proposed method, a skeleton graph is used as the model of a FEM. This graph is then considered as the Cartesian product of its generators. The eigenvalues of the Laplacian matrix of the entire graph are then easily calculated using the eigenvalues of its generators. An exceptionally fast method is also proposed for computing the second eigenvalue of the Laplacian of the graph model of a FEM, known as the Fiedler vector. After ordering the entries of the second eigenvector, the graph model is partitioned and the corresponding FEM is bisected.

[1]  Ali Kaveh,et al.  Structural Mechanics: Graph and Matrix Methods , 1995 .

[2]  Ali Kaveh,et al.  A multi-level finite element nodal ordering using algebraic graph theory , 2001 .

[3]  A. Kaveh,et al.  BISECTION USING FIEDLER AND RITZ VECTORS , 2004 .

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

[5]  D. Hadker,et al.  Formex Configuration Processing , 1970 .

[6]  Thomas J. R. Hughes,et al.  Parallel implementation of recursive spectral bisection on the Connection Machine CM-5 system , 1995 .

[7]  A. Kaveh.  ALGEBRAIC AND TOPOLOGICAL GRAPH THEORY FOR ORDERING , 1991 .

[8]  Marcelo Gattass,et al.  Node and element resequencing using the laplacian of a finite element graph: part i---general concep , 1994 .

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

[10]  D. Cvetkovic,et al.  Spectra of Graphs: Theory and Applications , 1997 .

[11]  Hoshyar Nooshin.  Formex configuration processing in structural engineering , 1984 .

[12]  Christoph Maas,et al.  Transportation in graphs and the admittance spectrum , 1987, Discret. Appl. Math..

[13]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

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

[15]  P. Gould.  THE GEOGRAPHICAL INTERPRETATION OF EIGENVALUES , 1967 .

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

[17]  J. J. Seidel,et al.  Graphs and their spectra , 1989 .

[18]  R. Grimes,et al.  A new algorithm for finding a pseudoperipheral node in a graph , 1990 .

[19]  Gregory W. Brown,et al.  Mesh partitioning for implicit computations via iterative domain decomposition: Impact and optimization of the subdomain aspect ratio , 1995 .

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