IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-319-74325-7_24.html
   My bibliography  Save this book chapter

An Optimized Unconditionally Stable Approach for the Solution of Discretized Maxwell’s Equations

In: Modern Discrete Mathematics and Analysis

Author

Listed:
  • Theodoros T. Zygiridis

    (University of Western Macedonia)

Abstract

Explicit finite-difference time-domain (FDTD) methods are well-established grid-based computational approaches for the solution of the time-dependent Maxwell’s equations that govern electromagnetic problems. As they describe time-evolving phenomena, iterative procedures that calculate the necessary field values at successive time instants constitute fundamental procedures of the corresponding algorithms. In order for these time-marching processes to remain stable and provide reliable results, the size of the selected time step (i.e., the distance between successive time instants) should not exceed a known stability limit. Fulfillment of this condition may render the implementation of explicit FDTD approaches inefficient in certain types of simulations, where a large number of iterations are necessary to be executed. Appropriate unconditionally stable FDTD techniques have been developed throughout the years for modeling such classes of problems, which enable the selection of larger time steps without sacrificing stability. These methods are implicit, but they can perform efficiently as well, since they require fewer iterations for a given time period. In this work, we present an optimized version of a four-stage split-step unconditionally stable algorithm that is characterized by minimized errors at selected frequency bands, depending on the problem under investigation. Unlike conventional FDTD schemes, the spatial operators do not comply with the standard, Taylor series-based definitions but are designed in a special fashion, so that they minimize an error formula that represents the inherent space-time errors. In this way, the performance of the unconditionally stable algorithm is upgraded by simply modifying the values of some constant coefficients, thus producing a more efficient alternative without augmentation of the involved computational cost. The properties of the proposed algorithm are assessed theoretically as well as via numerical simulations, and the improved performance ensured by the new spatial operators is verified.

Suggested Citation

  • Theodoros T. Zygiridis, 2018. "An Optimized Unconditionally Stable Approach for the Solution of Discretized Maxwell’s Equations," Springer Optimization and Its Applications, in: Nicholas J. Daras & Themistocles M. Rassias (ed.), Modern Discrete Mathematics and Analysis, pages 505-521, Springer.
  • Handle: RePEc:spr:spochp:978-3-319-74325-7_24
    DOI: 10.1007/978-3-319-74325-7_24
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:spochp:978-3-319-74325-7_24. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.