Spectral trisection of finite element models

Abstract

In this paper a new method is proposed for finite element domain decomposition. A weighted incidence graph is first constructed for the finite element model. A spectral partitioning heuristic is then applied to the graph using the second and the third eigenvalues of the Laplacian matrix of the graph, to partition it into three subgraphs and correspondingly trisect the finite element model.