IDEAS home Printed from https://ideas.repec.org/a/taf/tewaxx/v33y2019i2p151-164.html
   My bibliography  Save this article

The implementation of unconditionally stable higher order PML based on the implicit CNAD-FDTD algorithm

Author

Listed:
  • Jianxiong Li
  • Peiyu Wu
  • Haolin Jiang

Abstract

An unconditionally stable implementation of the higher order complex frequency-shifted perfectly matched layer (CFS-PML) based on the Crank–Nicolson-approximate-decoupling (CNAD) algorithm and the bilinear transform (BT) method is proposed to terminate the finite-difference time-domain (FDTD) lattice. The proposed scheme not only takes advantage of the CNAD algorithm in terms of reducing computational time but also has the advantage of the conventional FDTD algorithm in terms of absorbing performance. Two numerical examples are provided to validate the proposed implementation in the homogenous free space and lossy FDTD domains. The results show that the proposed scheme can overcome the Courant–Friedrich–Levy condition compared with the conventional FDTD method and further enhance the absorbing performance compared with the first order PML implementation.

Suggested Citation

  • Jianxiong Li & Peiyu Wu & Haolin Jiang, 2019. "The implementation of unconditionally stable higher order PML based on the implicit CNAD-FDTD algorithm," Journal of Electromagnetic Waves and Applications, Taylor & Francis Journals, vol. 33(2), pages 151-164, January.
    • Handle: RePEc:taf:tewaxx:v:33:y:2019:i:2:p:151-164
    DOI: 10.1080/09205071.2018.1530615
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/09205071.2018.1530615
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/09205071.2018.1530615?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tewaxx:v:33:y:2019:i:2:p:151-164. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tewa .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.