A hybrid method for domain decomposition in parallel computing

Abstract

A hybrid method is presented for domain decomposition employing combinatorial and algebraic graph theoretical algorithms. The method uses combinatorial graph theory for partial decomposition, followed by a spectral bisection approach based on concepts from algebraic graph theory. Examples are presented to illustrate the efficiency of the mixed method. In this paper, the effects of nodal ordering on the performance of the spectral bisection and mixed method are investigated.