Recursive spectral algorithms for automatic domain partitioning in parallel finite element analysis (Q1913232)

This paper presents two recursive spectral partitioning algorithms, both of which generalize the recursive spectral bisection (RSB) algorithm for an arbitrary number of partitions. These algorithms are based on a graph partitioning approach which includes spectral techniques and graph representation of finite element meshes. The `algebraic connectivity vector' is introduced as a parameter to assess the quality of the partitioning results. Both node-based and element-based partitioning strategies are discussed. The spectral algorithms are also evaluated and compared for coarse-grained partitioning using different types of structures modelled by one-, two- and three-dimensional finite elements.