IDEAS home Printed from https://ideas.repec.org/a/hin/jnddns/2539272.html
   My bibliography  Save this article

An Optimal Fourth-Order Finite Difference Scheme for the Helmholtz Equation Based on the Technique of Matched Interface Boundary

Author

Listed:
  • Dongsheng Cheng
  • Jianjun Chen
  • Guangqing Long
  • Tetsuji Tokihiro

Abstract

In this paper, a new optimal fourth-order 21-point finite difference scheme is proposed to solve the 2D Helmholtz equation numerically, with the technique of matched interface boundary (MIB) utilized to treat boundary problems. For the approximation of Laplacian, two sets of fourth-order difference schemes are derived firstly based on the Taylor formula, with a total of 21 grid points involved. Then, a weighted combination of the two schemes is employed in order to reduce the numerical dispersion, and the weights are determined by minimizing the dispersion. Similarly, for the discretization of the zeroth-order derivative term, a weighted average of all the 21 points is implemented to obtain the fourth-order accuracy. The new scheme is noncompact; hence, it encounters great difficulties in dealing with the boundary conditions, which is crucial to the order of convergence. To tackle this issue, the matched interface boundary (MIB) method is employed and developed, which is originally used to accommodate free edges in the discrete singular convolution analysis. Convergence analysis and dispersion analysis are performed. Numerical examples are given for various boundary conditions, which show that new scheme delivers a fourth order of accuracy and is efficient in reducing the numerical dispersion as well.

Suggested Citation

  • Dongsheng Cheng & Jianjun Chen & Guangqing Long & Tetsuji Tokihiro, 2021. "An Optimal Fourth-Order Finite Difference Scheme for the Helmholtz Equation Based on the Technique of Matched Interface Boundary," Discrete Dynamics in Nature and Society, Hindawi, vol. 2021, pages 1-16, December.
  • Handle: RePEc:hin:jnddns:2539272
    DOI: 10.1155/2021/2539272
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/ddns/2021/2539272.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/ddns/2021/2539272.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/2539272?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
    ---><---

    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:hin:jnddns:2539272. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.