UZH-Logo

Maintenance Infos

Sparse convolution quadrature for time domain boundary integral formulations of the wave equation


Hackbusch, W; Kress, W; Sauter, S (2009). Sparse convolution quadrature for time domain boundary integral formulations of the wave equation. IMA Journal of Numerical Analysis, 29(1):158-179.

Abstract

Many important physical applications are governed by the wave equation. The formulation as time domain boundary integral equations involves retarded potentials. For the numerical solution of this problem, we employ the convolution quadrature method for the discretization in time and the Galerkin boundary element method for the space discretization. We introduce a simple a priori cut-off strategy where small entries of the system matrices are replaced by zero. The threshold for the cut-off is determined by an a priori analysis which will be developed in this paper. This analysis will also allow to estimate the effect of additional perturbations such as panel clustering and numerical integration on the overall discretization error. This method reduces the storage complexity for time domain integral equations from O(M2N) to O(M2N1/2 logM), where N denotes the number of time steps and M is the dimension of the boundary element space.

Abstract

Many important physical applications are governed by the wave equation. The formulation as time domain boundary integral equations involves retarded potentials. For the numerical solution of this problem, we employ the convolution quadrature method for the discretization in time and the Galerkin boundary element method for the space discretization. We introduce a simple a priori cut-off strategy where small entries of the system matrices are replaced by zero. The threshold for the cut-off is determined by an a priori analysis which will be developed in this paper. This analysis will also allow to estimate the effect of additional perturbations such as panel clustering and numerical integration on the overall discretization error. This method reduces the storage complexity for time domain integral equations from O(M2N) to O(M2N1/2 logM), where N denotes the number of time steps and M is the dimension of the boundary element space.

Citations

33 citations in Web of Science®
35 citations in Scopus®
Google Scholar™

Altmetrics

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:2009
Deposited On:11 Nov 2009 15:38
Last Modified:05 Apr 2016 13:31
Publisher:Oxford University Press
ISSN:0272-4979
Publisher DOI:https://doi.org/10.1093/imanum/drm044
Related URLs:http://www.ams.org/mathscinet-getitem?mr=2470945

Download

Full text not available from this repository.
View at publisher

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