UZH-Logo

Maintenance Infos

The panel-clustering method for the wave equation in two spatial dimensions


Falletta, Silvia; Sauter, Stefan A (2016). The panel-clustering method for the wave equation in two spatial dimensions. Journal of Computational Physics, 305:217-243.

Abstract

We consider the numerical solution of the wave equation in a two-dimensional domain and start from a boundary integral formulation for its discretization. We employ the convolution quadrature (CQ) for the temporal and a Galerkin boundary element method (BEM) for the spatial discretization. Our main focus is the sparse approximation of the arising sequence of boundary integral operators by panel clustering. This requires the definition of an appropriate admissibility condition such that the arising kernel functions can be efficiently approximated on admissible blocks. The resulting method has a complexity of $\mathcal{O}(\mathit{N}(\mathit{N}+\mathit{M})\mathit{q}^{4+\mathit{s}})$, $\mathit{s} \in$ {0,1}, where $\mathit{N}$ is the number of time points, $\mathit{M}$ denotes the dimension of the boundary element space, and $\mathit{q}=\mathcal{O}$ (log $\mathit{N}$ + log $\mathit{M})$ is the order of the panel-clustering expansion. Numerical experiments will illustrate the efficiency and accuracy of the proposed CQ-BEM method with panel clustering.

Abstract

We consider the numerical solution of the wave equation in a two-dimensional domain and start from a boundary integral formulation for its discretization. We employ the convolution quadrature (CQ) for the temporal and a Galerkin boundary element method (BEM) for the spatial discretization. Our main focus is the sparse approximation of the arising sequence of boundary integral operators by panel clustering. This requires the definition of an appropriate admissibility condition such that the arising kernel functions can be efficiently approximated on admissible blocks. The resulting method has a complexity of $\mathcal{O}(\mathit{N}(\mathit{N}+\mathit{M})\mathit{q}^{4+\mathit{s}})$, $\mathit{s} \in$ {0,1}, where $\mathit{N}$ is the number of time points, $\mathit{M}$ denotes the dimension of the boundary element space, and $\mathit{q}=\mathcal{O}$ (log $\mathit{N}$ + log $\mathit{M})$ is the order of the panel-clustering expansion. Numerical experiments will illustrate the efficiency and accuracy of the proposed CQ-BEM method with panel clustering.

Altmetrics

Downloads

0 downloads since deposited on 10 Aug 2016
0 downloads since 12 months

Additional indexing

Item Type:Journal Article, refereed, original work
Communities & Collections:07 Faculty of Science > Institute of Mathematics
Dewey Decimal Classification:510 Mathematics
Language:English
Date:January 2016
Deposited On:10 Aug 2016 07:32
Last Modified:11 Aug 2016 07:56
Publisher:Elsevier
ISSN:0021-9991
Publisher DOI:https://doi.org/10.1016/j.jcp.2015.10.033

Download

[img]
Content: Accepted Version
Language: English
Filetype: PDF - Registered users only until 16 January 2018
Size: 1MB
View at publisher
Embargo till: 2018-01-16

TrendTerms

TrendTerms displays relevant terms of the abstract of this publication and related documents on a map. The terms and their relations were extracted from ZORA using word statistics. Their timelines are taken from ZORA as well. The bubble size of a term is proportional to the number of documents where the term occurs. Red, orange, yellow and green colors are used for terms that occur in the current document; red indicates high interlinkedness of a term with other terms, orange, yellow and green decreasing interlinkedness. Blue is used for terms that have a relation with the terms in this document, but occur in other documents.
You can navigate and zoom the map. Mouse-hovering a term displays its timeline, clicking it yields the associated documents.

Author Collaborations