A high-order algorithm for time-domain scattering in three dimensions (Q6168050)

From MaRDI portal
scientific article; zbMATH DE number 7723887
Language Label Description Also known as
English
A high-order algorithm for time-domain scattering in three dimensions
scientific article; zbMATH DE number 7723887

    Statements

    A high-order algorithm for time-domain scattering in three dimensions (English)
    0 references
    8 August 2023
    0 references
    Let \(\Omega\) be a bounded domain in \(\mathbb{R}^n\) and \(\Omega^c := \mathbb{R}^n \setminus \Omega\) be its exterior domain. The authors give the numerical methods to solve a linear wave equation in the unbounded domain \([0,T] \times \Omega^c\) with homogenous initial conditions and inhomogeneous boundary conditions such as the Dirichlet, Neumann or Robin boundary conditions. Their strategy is not using the well-known truncation into the bounded domain, but using the surface integral operator with the fundamental solution for the wave equation. Remark that the space-time domain \([0,T] \times \partial \Omega\) for the surface-integration is bounded. First, they derive the surface integral equation, and they derive the fully discrete scheme by discretizing the surface integral equation by decomposing the space-time domain. They apply the spectrally accurate Galerkin method in the discretization with respect to the space variable and the convolution quadratic Runge-Kutta method in the discretization with respect to the time variable, which is a combination of the Laplace transform and the Runge-Kutta method. Lastly, they give numerical examples to verify the method's superiority by comparing the previous results.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    wave equation
    0 references
    time-domain scattering
    0 references
    surface integral equations
    0 references
    convolution quadrature
    0 references
    high-order spectral method
    0 references
    0 references
    0 references
    0 references
    0 references