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

DOI10.1016/S0168-874X(01)00062-2zbMath0987.65116MaRDI QIDQ5958348

Ali Kaveh, H. A. Rahimi Bondarabady

Publication date: 3 March 2002

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

zbMATH Keywords

eigenvectorfinite elementiterative methodcoarseningLaplacian matrixalgebraic graph theoryFiedler vectormulti-level schemenodal orderingsecond eigenvalue

Mathematics Subject Classification ID

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

Related Items (max. 100)

Efficient finite element analysis using graph-theoretical force method; rectangular plane stress and plane strain Lagrange family elements ⋮ Eigensolution of Laplacian matrices for graph partitioning and domain decomposition ⋮ 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