# Sparse convolution quadrature for time domain boundary integral formulations of the wave equation by cutoff and panel-clustering

Hackbusch, W; Kress, W; Sauter, S (2007). Sparse convolution quadrature for time domain boundary integral formulations of the wave equation by cutoff and panel-clustering. In: Schanz, M; Steinbach, O. Boundary element analysis. Berlin: Springer, 113-134.

## Abstract

We consider the wave equation in a time domain boundary integral formulation. To obtain a stable time discretization, we employ the convolution quadrature method in time, developed by Lubich. In space, a Galerkin boundary element method is considered. The resulting Galerkin matrices are fully populated and the computational complexity is proportional to N log2 NM 2, where M is the number of spatial unknowns and N is the number of time steps.
We present two ways of reducing these costs. The first is an a priori cutoff strategy, which allows to replace a substantial part of the matrices by 0. The second is a panel clustering approximation, which further reduces the storage and computational cost by approximating subblocks by low rank matrices.

## Abstract

We consider the wave equation in a time domain boundary integral formulation. To obtain a stable time discretization, we employ the convolution quadrature method in time, developed by Lubich. In space, a Galerkin boundary element method is considered. The resulting Galerkin matrices are fully populated and the computational complexity is proportional to N log2 NM 2, where M is the number of spatial unknowns and N is the number of time steps.
We present two ways of reducing these costs. The first is an a priori cutoff strategy, which allows to replace a substantial part of the matrices by 0. The second is a panel clustering approximation, which further reduces the storage and computational cost by approximating subblocks by low rank matrices.

## Statistics

### Citations

Dimensions.ai Metrics

31 citations in Scopus®