Wavelets and convolution quadrature for the efficient solution of a 2D space-time BIE for the wave equation

We consider a wave propagation problem in 2D, reformulated in terms of a Boundary Integral Equation (BIE) in the space-time domain. For its solution, we propose a numerical scheme based on a convolution quadrature formula by Lubich for the discretization in time, and on a Galerkin method in space. I...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Applied mathematics and computation 2020-02, Vol.366, p.124726, Article 124726
Hauptverfasser: Bertoluzza, S., Falletta, S., Scuderi, L.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider a wave propagation problem in 2D, reformulated in terms of a Boundary Integral Equation (BIE) in the space-time domain. For its solution, we propose a numerical scheme based on a convolution quadrature formula by Lubich for the discretization in time, and on a Galerkin method in space. It is known that the main advantage of Lubich’s formulas is the use of the FFT algorithm to retrieve discrete time integral operators with a computational complexity of order RlogR,R being twice the total number of time steps performed. Since the discretization in space leads in general to a quadratic complexity, the global computational complexity is of order M2RlogR and the working storage required is M2R/2, where M is the number of grid points on the domain boundary. To reduce the complexity in space, we consider here approximant functions of wavelet type. By virtue of the properties of wavelet bases, the discrete integral operators have a rapid decay to zero with respect to time, and the overwhelming majority of the associated matrix entries assume negligible values. Based on an a priori estimate of the decaying behaviour in time of the matrix entries, we devise a time downsampling strategy that allows to compute only those elements which are significant with respect to a prescribed tolerance. Such an approach allows to retrieve the temporal history of each entry e (corresponding to a fixed couple of wavelet basis functions), via a Fast Fourier Transform, with computational complexity of order R¯elogR¯e. The parameter R¯e depends on the two basis functions, and it satisfies R¯e≪R for a relevant percentage of matrix entries, percentage which increases significantly as time and/or space discretization are refined. Globally, the numerical tests show that the computational complexity and memory storage of the overall procedure are linear in space and time for small velocities of the wave propagation, and even sub-linear for high velocities.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2019.124726