Domain decomposition method for the solution of electromagnetic field penetration problems

We present a novel fast algorithm based on a mixed technique of the FD method and the domain decomposition method (DDM) for the analysis of electromagnetic field penetration problems. Different from other methods, the new method decomposes the whole domain of the problem into several coupled subdomains. For different sub-domains, the different most efficient method can be chosen independently. However, each sub-domain can have its own lattices independently to suit for the special shapes, and same lattices in all sub-domains are unnecessary. Besides, it is well suited for numerical implementations on parallel computation and can considerably reduce both memory storage requirements and central processing unit (CPU) time. The numerical results shown demonstrated that the computational effort and memory storage requirement of the new algorithm are only O(N) and O(N/sub max/), respectively. Here N is the total number of unknowns and N/sub max/=max(N/sub i/), while N/sub i/ is the number of unknowns in ith sub-domain.