Header

UZH-Logo

Maintenance Infos

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


Hackbusch, W; Kress, W; Sauter, S A (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.

Statistics

Citations

Dimensions.ai Metrics
53 citations in Web of Science®
53 citations in Scopus®
Google Scholar™

Altmetrics

Downloads

67 downloads since deposited on 11 Nov 2009
15 downloads since 12 months
Detailed statistics

Additional indexing

Item Type:Journal Article, refereed, original work
Communities & Collections:07 Faculty of Science > Institute of Mathematics
Dewey Decimal Classification:510 Mathematics
Scopus Subject Areas:Physical Sciences > General Mathematics
Physical Sciences > Computational Mathematics
Physical Sciences > Applied Mathematics
Language:English
Date:2009
Deposited On:11 Nov 2009 15:38
Last Modified:03 Nov 2023 03:07
Publisher:Oxford University Press
ISSN:0272-4979
OA Status:Green
Publisher DOI:https://doi.org/10.1093/imanum/drm044
  • Content: Published Version
  • Language: English
  • Description: Nationallizenz 142-005