Local and Parallel Finite Element Algorithm Based on the Partition of Unity for Incompressible Flows

Abstract

By combining two-grid method with domain decomposition method, a new local and parallel finite element algorithm based on the partition of unity is proposed for the incompressible flows. The interesting points in this algorithm lie in (1) a class of partition of unity is derived by a given triangulation, which guides the domain decomposition (2) the globally fine grid correction step is decomposed into a series of local linearized residual problems on some subdomains and (3) the global continuous finite element solution is obtained by assembling all local solutions together using the partition of unity functions. Some numerical simulations are presented to demonstrate the high efficiency and flexibility of the new algorithm.