scientific article; zbMATH DE number 1526386

From MaRDI portal
Publication:4513041





A hybrid method for domain decomposition, employing combinatorial and algebraic graph theoretical algorithms, is presented. The approach uses the combinatorial graph theory for partial decomposition and then the spectral bisection approach. The spectral bisection is an algebraic graph method by which the associate graph of a finite element model is decomposed into two subgraphs. The optimality conditions consist of the equality of the numbers of nodes in the two subgraphs and minimality of the number of interface nodes. The Laplacian matrix is used to select a minimal cut set. The second eigenvalue and eigenvector of the Laplacian matrix are iteratively computed by the Lanczos method. For graph partitioning a hybrid method is proposed. In this algorithm the pseudo-peripheral nodes of the associate graph are first obtained. Four examples of partitioning illustrate the computational results.











This page was built for publication:

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