A multi-level finite element nodal ordering using algebraic graph theory

DOI10.1016/S0168-874X(01)00062-2MaRDI QIDQ5958348zbMATH OpenFDO

Authors A. Kaveh, H. A. Rahimi Bondarabady

Publication date 3 March 2002

Published in Finite Elements in Analysis and Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0168-874X(01)00062-2

zbMATH Keywords

algebraic graph theorycoarseningeigenvectorFiedler vectorfinite elementiterative methodLaplacian matrixmulti-level schemenodal orderingsecond eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Finite element methods applied to problems in solid mechanics (74S05)

Recommendations

• Combinatorial optimization of special graphs for nodal ordering and graph partitioning
• Algebraic graph theory for ordering
• A novel nodal ordering algorithm for profile optimization by efficient solution of a differential equation
• Finite element mesh decomposition using complementary Laplacian matrix

Cited in

(11)

• A novel nodal ordering algorithm for profile optimization by efficient solution of a differential equation
• scientific article; zbMATH DE number 3989404 (Why is no real title available?)
• A connectivity coordinate system for node and element ordering
• An alternative pseudoperipheral node finder for resequencing schemes
• Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm
• scientific article; zbMATH DE number 1174814 (Why is no real title available?)
• Finite element mesh decomposition using complementary Laplacian matrix
• Algebraic graph theory for ordering
• Eigensolution of Laplacian matrices for graph partitioning and domain decomposition: approximate algebraic method
• Efficient finite element analysis using graph-theoretical force method; rectangular plane stress and plane strain Lagrange family elements
• Combinatorial optimization of special graphs for nodal ordering and graph partitioning

This page was built for publication: A multi-level finite element nodal ordering using algebraic graph theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958348)