Finite element mesh decomposition using complementary Laplacian matrix

DOI<379::AID-CNM332>3.0.CO;2-G 10.1002/1099-0887(200006)16:6<379::AID-CNM332>3.0.CO;2-GzbMath0956.65112OpenAlexW2021824521MaRDI QIDQ4495457

H. A. Rahimi Bondarabady, Ali Kaveh

Publication date: 27 February 2001

Full work available at URL: https://doi.org/10.1002/1099-0887(200006)16:6<379::aid-cnm332>3.0.co;2-g

zbMATH Keywords

finite elementseigenvectordomain decompositioniterative methodgraph partitioningLaplacian matrixalgebraic graph theoryFiedler vectorsecond eigenvaluecomplementary Laplacian matrixgraph patitioning

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Related Items

Eigensolutions for matrices of special structures, Spectral trisection of finite element models, Graph transformations for efficient structural analysis, 2D and 3D finite element meshing and remeshing, Additivity properties of graphs with Form II symmetry, Eigensolutions for factorable matrices of special patterns

Cites Work

• Unnamed Item
• Unnamed Item
• Transportation in graphs and the admittance spectrum
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Linear Algebra in Geography: Eigenvectors of Networks
• Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm
• Spectral bisection of adaptive finite element meshes for parallel processing