Domain decomposition by iterative field bouncing

In modeling geometries that involve two or more distinct partitions, an iterative field bouncing (IFB) method can be applied to substantially reduce total memory requirements. This approach also makes possible the use of several different techniques simultaneously, where the optimal analysis method can be chosen for each partition. Application of IFB accelerates solutions particularly in situations where each partition is moving with a velocity independent of the others. Results are shown for a typical application of IFB.