Spectral bisection of adaptive finite element meshes for parallel processing

DOI10.1016/S0045-7949(98)00170-9zbMath0969.74594OpenAlexW2139577760MaRDI QIDQ4937346

A. Davaran, Ali Kaveh

Publication date: 18 September 2001

Published in: Computers & Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0045-7949(98)00170-9

zbMATH Keywords

parallel processingadaptive finite element meshweighted graph partitioningspectral bisection method

Mathematics Subject Classification ID

Rods (beams, columns, shafts, arches, rings, etc.) (74K10) Finite element methods applied to problems in solid mechanics (74S05) Spectral and related methods applied to problems in solid mechanics (74S25)

Related Items

Topology and graph products; eigenproblems in optimal structural analysis, Spectral trisection of finite element models, A new algorithm for domain decomposition of finite element models, Eigensolution of Laplacian matrices for graph partitioning and domain decomposition, Finite element mesh decomposition using complementary Laplacian matrix, Error estimates and adaptive finite element methods, Factorization for efficient solution of eigenproblems of adjacency and Laplacian matrices for graph products, 2D and 3D finite element meshing and remeshing, A unified method for eigendecomposition of graph products, FEM and BEM parallel processing: theory and applications – a bibliography (1996‐2002)