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

被引:6
作者
Bertoluzza, S. [1 ]
Falletta, S. [2 ]
Scuderi, L. [2 ]
机构
[1] CNR, IMATI, Pavia, Italy
[2] Politecn Torino, Dipartimento Sci Matemat, Turin, Italy
关键词
Wave equation; Space-time boundary integral equations; Multiresolution analysis; Downsampling; Numerical methods; BOUNDARY INTEGRAL-EQUATIONS; DISCRETIZATION; ALGORITHMS;
D O I
10.1016/j.amc.2019.124726
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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 R log R, 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 (MR)-R-2 log R and the working storage required is (MR)-R-2/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) over bar (e) log (R) over bar (e). The parameter (R) over bar (e) depends on the two basis functions, and it satisfies (R) over bar (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. (C) 2019 Elsevier Inc. All rights reserved.
引用
收藏
页数:21
相关论文
共 30 条
[1]   An energy approach to space-time Galerkin BEM for wave propagation problems [J].
Aimi, A. ;
Diligenti, M. ;
Guardasoni, C. ;
Mazzieri, I. ;
Panizzi, S. .
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2009, 80 (09) :1196-1240
[2]  
[Anonymous], [No title captured]
[3]  
[Anonymous], 10 LECT WAVELETS
[4]  
[Anonymous], [No title captured]
[5]  
Bamberger A., 1986, MATH METHOD APPL SCI, V8, P405, DOI [10.1002/mma.1670080127, DOI 10.1002/MMA.1670080127]
[6]   FAST AND OBLIVIOUS ALGORITHMS FOR DISSIPATIVE AND TWO-DIMENSIONAL WAVE EQUATIONS [J].
Banjai, L. ;
Lopez-Fernandez, M. ;
Schaedle, A. .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 2017, 55 (02) :621-639
[7]   Fast convolution quadrature for the wave equation in three dimensions [J].
Banjai, L. ;
Kachanovska, M. .
JOURNAL OF COMPUTATIONAL PHYSICS, 2014, 279 :103-126
[8]   Efficient long-time computations of time-domain boundary integrals for 2D and dissipative wave equation [J].
Banjai, Lehel ;
Gruhne, Volker .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2011, 235 (14) :4207-4220
[9]   FAST WAVELET TRANSFORMS AND NUMERICAL ALGORITHMS .1. [J].
BEYLKIN, G ;
COIFMAN, R ;
ROKHLIN, V .
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 1991, 44 (02) :141-183
[10]  
Ciarlet P. G., 2002, Stud. Math. Appl.