Fully Implicit Coupling for Non-Matching Grids

The efficient solution of flow problems depends on quality meshing the computational domain. In problems with complex geometries or having a large spectrum of time or length scale, the meshing process greatly benefits from the subdivision of the original geometry (domain decomposition) into sub-domains, that are meshed independently with suitable elements and mesh density. Procedures for solving multiblock meshes can be of two types explicit or implicit. In either case it is essential that the fluxes at the regions interfaces be conserved. In this paper an efficient fully implicit multi-region coupling discretization procedure is presented. A test problem involving 1, 2, 4 and 8 blocks with a mesh size of about 100,000 elements, is solved to show that the coupling procedure yields the same number of iteration for multiple block as for a single block.