TY - JOUR

T1 - A method of boundary equations for unsteady hyperbolic problems in 3D

AU - Petropavlovsky, S.

AU - Tsynkov, S.

AU - Turkel, E.

N1 - Publisher Copyright:
© 2018 Elsevier Inc.

PY - 2018/7/15

Y1 - 2018/7/15

N2 - We consider interior and exterior initial boundary value problems for the three-dimensional wave (d'Alembert) equation. First, we reduce a given problem to an equivalent operator equation with respect to unknown sources defined only at the boundary of the original domain. In doing so, the Huygens’ principle enables us to obtain the operator equation in a form that involves only finite and non-increasing pre-history of the solution in time. Next, we discretize the resulting boundary equation and solve it efficiently by the method of difference potentials (MDP). The overall numerical algorithm handles boundaries of general shape using regular structured grids with no deterioration of accuracy. For long simulation times it offers sub-linear complexity with respect to the grid dimension, i.e., is asymptotically cheaper than the cost of a typical explicit scheme. In addition, our algorithm allows one to share the computational cost between multiple similar problems. On multi-processor (multi-core) platforms, it benefits from what can be considered an effective parallelization in time.

AB - We consider interior and exterior initial boundary value problems for the three-dimensional wave (d'Alembert) equation. First, we reduce a given problem to an equivalent operator equation with respect to unknown sources defined only at the boundary of the original domain. In doing so, the Huygens’ principle enables us to obtain the operator equation in a form that involves only finite and non-increasing pre-history of the solution in time. Next, we discretize the resulting boundary equation and solve it efficiently by the method of difference potentials (MDP). The overall numerical algorithm handles boundaries of general shape using regular structured grids with no deterioration of accuracy. For long simulation times it offers sub-linear complexity with respect to the grid dimension, i.e., is asymptotically cheaper than the cost of a typical explicit scheme. In addition, our algorithm allows one to share the computational cost between multiple similar problems. On multi-processor (multi-core) platforms, it benefits from what can be considered an effective parallelization in time.

KW - Calderon's boundary equation

KW - Method of difference potentials (MDP)

KW - Parallelization in time

KW - Sub-linear complexity

KW - The Huygens’ principle

KW - Time-dependent wave equation

UR - http://www.scopus.com/inward/record.url?scp=85044989076&partnerID=8YFLogxK

U2 - 10.1016/j.jcp.2018.03.039

DO - 10.1016/j.jcp.2018.03.039

M3 - מאמר

AN - SCOPUS:85044989076

VL - 365

SP - 294

EP - 323

JO - Journal of Computational Physics

JF - Journal of Computational Physics

SN - 0021-9991

ER -