Abstract
Wave propagation problems in unbounded homogeneous domains can be formulated as time-domain integral equations. An effective way to discretize such equations in time are Runge-Kutta based convolution quadratures. In this paper the behaviour of the weights of such quadratures is investigated. In particular approximate sparseness of their Galerkin discretization is analyzed. Further, it is demonstrated how these results can be used to construct and analyze the complexity of fast algorithms for the assembly of the fully discrete systems.
| Original language | English |
|---|---|
| Pages (from-to) | 901-936 |
| Number of pages | 36 |
| Journal | BIT Numerical Mathematics |
| Volume | 54 |
| Issue number | 4 |
| Early online date | 17 Jun 2014 |
| DOIs | |
| Publication status | Published - Dec 2014 |
Keywords
- Convolution quadrature
- Runge-Kutta methods
- Time-domain boundary integral equations
- Wave equation
ASJC Scopus subject areas
- Computational Mathematics
- Applied Mathematics
- Software
- Computer Networks and Communications