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 M2R log R 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 Re log Re. The parameter Re depends on the two basis functions, and it satisfies Re 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.

Wavelets and convolution quadrature for the efficient solution of a 2D space-time BIE for the wave equation / Bertoluzza, Silvia; Falletta, Silvia; Scuderi, Letizia. - In: APPLIED MATHEMATICS AND COMPUTATION. - ISSN 0096-3003. - STAMPA. - 366:(2020), pp. 1-21. [10.1016/j.amc.2019.124726]

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

Silvia Falletta;Letizia Scuderi
2020

Abstract

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 M2R log R 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 Re log Re. The parameter Re depends on the two basis functions, and it satisfies Re 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.
File in questo prodotto:
File Dimensione Formato  
AMC_pre_print.pdf

accesso aperto

Tipologia: 1. Preprint / submitted version [pre- review]
Licenza: PUBBLICO - Tutti i diritti riservati
Dimensione 1.06 MB
Formato Adobe PDF
1.06 MB Adobe PDF Visualizza/Apri
AMC_post_print.pdf

Open Access dal 02/11/2021

Descrizione: Articolo principale
Tipologia: 2. Post-print / Author's Accepted Manuscript
Licenza: Creative commons
Dimensione 1.07 MB
Formato Adobe PDF
1.07 MB Adobe PDF Visualizza/Apri
Wavelets and convolution quadrature for the efficient solution of a 2D space-time BIE for the wave equation.pdf

non disponibili

Tipologia: 2a Post-print versione editoriale / Version of Record
Licenza: Non Pubblico - Accesso privato/ristretto
Dimensione 1.86 MB
Formato Adobe PDF
1.86 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2730981