求解三维问题的区域分解时域有限差分方法  

THE DOMAIN DECOMPOSITION FDTD ALGORITHM(DD-FDTD) FOR THREE-DIMENSIONAL COMPLEX PROBLEMS

作　　者：许锋[1] 洪伟[1] 周后型[1] 

机构地区：[1]东南大学计算电磁学研究中心,南京210096

出　　处：《电子与信息学报》2003年第8期1114-1119,共6页Journal of Electronics & Information Technology

摘　　要：该文提出一种用于三维复杂问题的区域分解时域有限差分算法(DD-FDTD)。依据待解三维复杂问题的特点,将其分解为几个子区域。每个子域中的问题相对简单,可采用适合于该区域的共形网格进行划分计算,通过插值再修正误差的办法,把各个子区域综合起来,获得原问题的解。这样,应用区域分解的思想,简化了复杂的问题。修正误差的方法,使本算法得以实现并大幅度提高了计算精度。采用本算法对三维口径天线问题进行了分析计算并与实测数据进行了比对,验证了算法的正确性。The Domain Decomposition FDTD (DD-FDTD) method is presented for solving complex 3-D problems and improving the accuracy of solutions. According to the features of the problem, the original domain is decomposed into several sub-domains. In each sub-domain, the conformal meshes are created in local coordinates and the FDTD computation is carried out independently in local meshes. In the iteration procedure of FDTD, the data are exchanged between adjacent sub-domains with overlapped meshes. An interpolating and error-modifying scheme proposed here integrates the sub-domains and leads to a more exact solution. A complex 3-D aperture antenna problem is calculated by using this method and the accuracy of the solution validates the usefulness and exactness of this method.

关 键 词：区域分解 时域有限差分法 共形网格 口径天线 FDTD 

分 类 号：TN820[电子电信—信息与通信工程]