A novel and efficient subgridding scheme in FDTD method using the Crank-Nicolson algorithm

✍ Scribed by Ting-Chun Lin; Chih-Wen Kuo

• Publisher: John Wiley and Sons
• Year: 2007
• Tongue: English
• Weight: 216 KB
• Volume: 49
• Category: Article
• ISSN: 0895-2477
• DOI: 10.1002/mop.22932

✦ Synopsis

Abstract

Subgridding algorithms in the finite‐difference time‐domain (FDTD) method are applicable and efficient in handling problems containing fine structural features. Only regions surrounding the fine features need to be discretized with a finer spatial grid to avoid finely discretizing the whole computation domain but still maintaining the desired accuracy. A novel subgridding scheme using the Crank‐Nicolson (CN) method to update the field components in the fine grid region is proposed in this article. Combined with the Douglas‐Gunn algorithm to convert the block tri‐diagonal matrix of the CN method into pure tri‐diagonal form, the proposed method is efficient at solving circuit problems and scattering problems. Accuracy of the proposed method is verified by comparison with results from a conventional FDTD method with fine spatial increment. © 2007 Wiley Periodicals, Inc. Microwave Opt Technol Lett 49: 3103–3106, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.22932