Finite element mesh decomposition using complementary Laplacian matrix

Communications in Numerical Methods in Engineering

Volumn 16, Issue 6, 2000, Pages 379-389

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

^a IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

^b TARBIAT MODARES UNIVERSITY   (Iran)

Author keywords

Algebraic graph theory; Complementary laplacian matrix; Domain decomposition; Finite elements; Graph partitioning: Fiedler vector; Laplacian matrix

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; EIGENVALUES AND EIGENFUNCTIONS; ITERATIVE METHODS; LAPLACE TRANSFORMS; MATRIX ALGEBRA; TREES (MATHEMATICS);

FIEDLER VECTORS; FINITE ELEMENT MESH DECOMPOSITIONS;

FINITE ELEMENT METHOD;

EID: 0034207365     PISSN: 10698299     EISSN: None     Source Type: Journal    
DOI: 10.1002/1099-0887(200006)16:6<379::AID-CNM332>3.0.CO;2-G     Document Type: Article

References (19)

1. Kaveh A. Structural Mechanics: Graph and Matrix Methods (2nd edn). RSP. Wiley: UK, 1995.
2. Kaveh A. Optimal Structural Analysis. RSP. Wiley: UK, 1997.
3. Biggs NL. Algebraic Graph Theory (2nd edn). Cambridge University Press: Cambridge, 1993.
4. Cvelkovic DM, Doob M, Sachs H. Spectra of Graphs, Theory and Applications. Academic Press: New York, 1980.
5. Seidel JJ. Graphs and Their Spectra, Combinatorics and Graph Theory. PWN-Polish Scientific Publishing: Warsaw, 1989; 147-162.
6. Chung JJ. Spectral Graph Theory, CBMS, Number 92. American Mathematical Society: Providence, RI, 1997.
7. Fiedler M. Algebraic connectivity of graphs. Czechoslovak Mathematical Journal 1973; 23:298-305.
8. Mohar B. The Laplacian spectrum of graphs. In Graph Theory, Combinatorics and Applications, vol. 2, Alavi Y et al. (eds). Wiley: New York 1991; 871-898.
9. Pothen A, Simon H, Liou KP. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal on Matrix Analysis and Applications 1990; 11:430-452.
10. Topping BHV, Sziveri J. Parallel subdomain generation method. Proceedings of Civil Computations, UK, 1995.
11. Gould P. The geographical interpretation of eigenvalues. Transactions of the Institute of British Geographer 1967; 42:53-58.
12. Straffing PD. Linear algebra in geography, eigenvectors of networks. Mathematical Magazine 1980; 53:269-276.
13. Maas C. Transportation in graphs and the admittance spectrum. Discrete and Applied Mathematics 1987; 16:31-49.
14. Grime RG, Pierce DJ, Simon HD. A new algorithm for finding a pseudo-peripheral node in a graph. SIAM Journal on Analysis and Applications 1990; 11:323-334.
15. Kaveh A. Algebraic and topological graph theory for ordering. Zeitschrift fuer Angewandte Mathematik und Mechanik, 1991; 71:T739-T742.
16. Paulino GH, Menezes IFM, Gattass M, Mukherjee S. Node and element resequencing using Laplacian of a finite element graph, Part-I - general concepts and algorithms. International Journal for Numerical Methods in Engineering 1994; 37:1511-1530.
17. Simon HD. Partitioning of unstructured problems for parallel processing. Computations in System Engineering 1991; 2:135-148.
18. Seale C, Topping BHV. Parallel implementation of recursive spectral bisection. Proceedings of Civil Computations 95, Edinburgh, UK, 1995; 459-473.
19. Kaveh A, Davaran A. Spectral bisection of adaptive finite element meshes for parallel processing. Computers and Structures 1999; 70:315-327.